Discrete Applied Mathematics, Volume 74

Volume 74, Number 1, April 1997

• Martin Aigner:
  Finding the Maximum and Minimum. 1-12
  Electronic Edition (link) BibTeX
• Stefan Felsner, Rudolf Müller, Lorenz Wernisch:
  Trapezoid Graphs and Generalizations, Geometry and Algorithms. 13-32
  Electronic Edition (link) BibTeX
• Ten-Hwang Lai, Shu-Shang Wei:
  Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem. 33-55
  Electronic Edition (link) BibTeX
• David Nehme, Gang Yu:
  The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications. 57-68
  Electronic Edition (link) BibTeX
• David Peleg, Avishai Wool:
  The Availability of Crumbling Wall Quorum Systems. 69-83
  Electronic Edition (link) BibTeX
• Hananya Yinnone:
  On Paths Avoiding Forbidden Pairs of Vertices in a Graph. 85-92
  Electronic Edition (link) BibTeX
• Mulan Liu, Gary L. Mullen:
  Irreducible Polynomials and Linear Recurring Arrays. 93-99
  Electronic Edition (link) BibTeX

Volume 74, Number 2, April 1997

• Pranava K. Jha, Naveen Agnihotri, Rajesh Kumar:
  Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree. 101-121
  Electronic Edition (link) BibTeX
• Yoshiyasu Ishigami, Sei'ichi Tani:
  VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States. 123-134
  Electronic Edition (link) BibTeX
• Alain Billionnet, Alain Faye:
  A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. 135-146
  Electronic Edition (link) BibTeX
• Rong-si Chen, Fuji Zhang:
  Regular Coronoid Systems. 147-158
  Electronic Edition (link) BibTeX
• Olivier Goldschmidt, Dorit S. Hochbaum:
  k-edge Subgraph Problems. 159-169
  Electronic Edition (link) BibTeX
• Olaf Kyek, Ian Parberry, Ingo Wegener:
  Bounds on the Number of Knight's Tours. 171-181
  Electronic Edition (link) BibTeX
• William A. Webb:
  How to Cut a Cake Fairly Using a Minimal Number of Cuts. 183-190
  Electronic Edition (link) BibTeX
• Rong-si Chen, Fuji Zhang:
  Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems. 191-196
  Electronic Edition (link) BibTeX
• Andrei A. Gladky:
  On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops. 197-201
  Electronic Edition (link) BibTeX

Volume 74, Number 3, May 1997

• Leizhen Cai:
  On Spanning 2-trees in a Graph. 203-216
  Electronic Edition (link) BibTeX
• Rowan Davies, Gordon F. Royle:
  Graph Domination, Tabu Search and the Football Pool Problem. 217-228
  Electronic Edition (link) BibTeX
• Yoshiyasu Ishigami, Sei'ichi Tani:
  VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States. 229-240
  Electronic Edition (link) BibTeX
• Y. Daniel Liang:
  Parallel Algorithms for the Domination Problems in Trapezoid Graphs. 241-249
  Electronic Edition (link) BibTeX
• Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki:
  Positive and Horn Decomposability of Partially Defined Boolean Functions. 251-274
  Electronic Edition (link) BibTeX
• Richard A. Brualdi, Jia-Yu Shao:
  Generalized Exponents of Primitive Symmetric Digraphs. 275-293
  Electronic Edition (link) BibTeX
• Stephane Perennes:
  A Proof of Jean De Rumeur's Conjecture. 295-299
  Electronic Edition (link) BibTeX