Discrete Applied Mathematics, Volume 77
Volume 77, Number 1, June 1997
Martin Anthony, John Shawe-Taylor: A Sufficient Condition for Polynomial Distribution-dependent Learnability. 1-12- Ginette Gauyacq: On Quasi-Cayley Graphs. 43-58
- K. Han, Chandra N. Sekharan, Sridhar Radhakrishnan: Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy. 59-71
- Jan Stallaert: The Complementary Class of Generalized Flow Cover Inequalities. 73-80
- Douglas R. Woodall: Monotonicity of Single-seat Preferential Election Rules. 81-98
Volume 77, Number 2, August 1997
- Dominique Barth, Marie-Claude Heydemann: A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. 99-118
- Christiane Bercoff: Uniform Tag Systems for Paperfolding Sequences. 119-138
- Manuel Duque-Antón: Constructing Efficient Simulated Annealing Algorithms. 139-159
- Vadim G. Timkovsky: A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem. 185-200
Volume 77, Number 3, August 1997
- Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing: Time-optimal Tree Computations on Sparse Meshes. 201-220
- Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger: The VC-dimension of Set Systems Defined by Graphs. 237-257
- Dieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. 259-270
- Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger: Simple But Efficient Approaches for the Collapsing Knapsack Problem. 271-280
- Ivan Stojmenovic: Multiplicative Circulant Networks Topological Properties and Communication Algorithms. 281-305
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team