Discrete Applied Mathematics, Volume 47

Volume 47, Number 1, 1993

• Péter L. Erdös, László A. Székely:
  Counting Bichromatic Evolutionary Trees. 1-8
  Electronic Edition (link) BibTeX
• Donald Goldfarb, Jianxiu Hao:
  On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. 9-16
  Electronic Edition (link) BibTeX
• Nen-Fu Huang:
  On the Complexity of two Circle Connecting Problems. 17-32
  Electronic Edition (link) BibTeX
• Peter Jeavons:
  Counting Representable Sets on Simple Graphs. 33-46
  Electronic Edition (link) BibTeX
• Fred R. McMorris, Robert C. Powers:
  Consensus Functions on Trees that Satisfy Independence Axiom. 47-55
  Electronic Edition (link) BibTeX
• Jack A. A. van der Veen:
  An O(n) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices. 57-75
  Electronic Edition (link) BibTeX

• Ephraim Korach, Michal Penn:
  A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. 77-83
  Electronic Edition (link) BibTeX

Volume 47, Number 2, 1993

• Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci:
  Preface. 85
  Electronic Edition (link) BibTeX
• Susanne Albers, Peter Brucker:
  The Complexity of One-Machine Batching Problems. 87-107
  Electronic Edition (link) BibTeX
• Geir Dahl:
  Directed Steiner Problems with Connectivity Constraints. 109-128
  Electronic Edition (link) BibTeX
• Leslie A. Hall:
  A Note on Generalizing the Maximum Lateness Criterion for Scheduling. 129-137
  Electronic Edition (link) BibTeX
• Hermann G. Kahlbacher, T. C. Edwin Cheng:
  Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. 139-164
  Electronic Edition (link) BibTeX
• Hans Kellerer, Gerhard J. Woeginger:
  On the Euclidean two Paths Problem. 165-173
  Electronic Edition (link) BibTeX
• Federico Malucelli, Thomas Ottmann, Daniele Pretolani:
  Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. 175-179
  Electronic Edition (link) BibTeX
• Katta G. Murty:
  On the Complexity of a Special Basis Problem in LP. 181-185
  Electronic Edition (link) BibTeX
• Pawel Winter:
  Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. 187-206
  Electronic Edition (link) BibTeX

Volume 47, Number 3, 1993

• Martin Anthony, John Shawe-Taylor:
  A Result of Vapnik with Applications. 207-217
  Electronic Edition (link) BibTeX
• Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
  A New Class of Nonbinary Codes Meeting the Griesmer Bound. 219-226
  Electronic Edition (link) BibTeX
• Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura:
  Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. 227-232
  Electronic Edition (link) BibTeX
• Dieter Jungnickel:
  Trace-Orthogonal Normal Bases. 233-249
  Electronic Edition (link) BibTeX
• Y. Kaufman, Arie Tamir:
  Locating Service Centers with Precedence Constraints. 251-261
  Electronic Edition (link) BibTeX
• Mulan Liu, Zunquan Li:
  Coset Correlation of LR m-Arrays. 263-273
  Electronic Edition (link) BibTeX
• Arie Tamir:
  A Unifying Location Model on Tree Graphs Based on Submodularity Properties. 275-283
  Electronic Edition (link) BibTeX
• Fuji Zhang, Xueliang Li, Heping Zhang:
  Hexagonal Systems with Fixed Bonds. 285-296
  Electronic Edition (link) BibTeX