Discrete Applied Mathematics, Volume 93

Volume 93, Number 1, April 1999

• Hartmut Noltemeier, Kokichi Sugihara:
  Preface. 1
  
• Matthias Ehrgott, Horst W. Hamacher, Stefan Nickel:
  Geometric Methods to Solve Max-Ordering Location Problems. 3-20
  
• Ioannis Z. Emiris, Jan Verschelde:
  How to Count Efficiently all Affine Roots of a Polynomial System. 21-32
  
• Lee Gross, Gerald E. Farin:
  A Transfinite Form of Sibson's Interpolant. 33-50
  
• M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
  Geometric Tree Graphs of Points in Convex Position. 51-66
  
• Christoph A. Hipke, Christian Icking, Rolf Klein, Elmar Langetepe:
  How to Find a Point on a Line Within a Fixed Distance. 67-73
  
• Frank Hoffmann, Klaus Kriegel, Carola Wenk:
  An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. 75-88
  
• Oliver Karch, Thomas Wahl:
  Relocalization - Theory and Practice. 89-108
  
• Anita Schöbel:
  Solving Restricted Line Location Problems via a Dual Interpretation. 109-125
  
• Eduard Sojka:
  A New Algorithm for Jordan Sorting: Its Average-Case Analysis. 127-140
  

Volume 93, Number 2-3, July 1999

• Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
  Bipartite Embeddings of Trees in the Plane. 141-148
  
• Alexander A. Ageev, Maxim Sviridenko:
  An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. 149-156
  
• Luitpold Babel, Andreas Brandstädt, Van Bang Le:
  Recognizing the P₄-structure of Bipartite Graphs. 157-168
  
• Dominique Désérable:
  A Family of Cayley Graphs on the Hexavalent Grid. 169-189
  
• Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Bruno Marmol:
  On a Graph-theoretical Model for Cyclic Register Allocation. 191-203
  
• Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri:
  Compound Constructions of Broadcast Networks. 205-232
  
• Mordecai J. Golin, Assaf Schuster:
  Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. 233-263
  
• Guy Kortsarz, David Peleg:
  Approximating the Weight of Shallow Steiner Trees. 265-285
  
• Vitaly A. Strusevich:
  A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. 287-304