Discrete Applied Mathematics, Volume 82

Volume 82, Number 1-3, March 1998

• Noga Alon, Ayal Zaks:
  T-choosability in Graphs. 1-13
  
• Eric Angel, Vassilis Zissimopoulos:
  On the Quality of Local Search for the Quadratic Assignment Problem. 15-25
  
• Shoshana Anily, Celia A. Glass, Refael Hassin:
  The Scheduling of Maintenance Service. 27-42
  
• Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
  The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. 43-77
  
• Bintong Chena, Monique Guignard:
  Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. 79-91
  
• Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos:
  An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. 93-101
  
• John Harrison, Thomas Brennan, Steven Gapinski:
  The Gergonne p-pile Problem and the Dynamics of the Function x | => (x + r)/p. 103-113
  
• Michael A. Henning, Hiren Maharaj:
  Some General Aspects of the Framing Number of a Digraph. 115-133
  
• Zhiquan Hu, Zhenhong Liu:
  A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. 135-154
  
• Mark Jerrum, Gregory B. Sorkin:
  The Metropolis Algorithm for Graph Bisection. 155-175
  
• Simon Litsyn, Patrick Solé, René Struik:
  On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. 177-191
  
• Wayne Martin:
  Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition. 193-207
  
• Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter:
  Characterizing and Edge-colouring Split-indifference Graphs. 209-217
  
• Huei-Jan Shyr, Shyr-Shen Yu:
  The Single Loop Representations of Regular Languages. 219-229
  
• Nan Zhu, Kevin A. Broughan:
  On Aggregating Two Linear Diophantine Equations. 231-246
  
• Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo:
  Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. 247-250
  
• Zoltán Füredi:
  On the Double Competition Number. 251-255
  
• Alexandros V. Gerbessiotis:
  A Graph-theoretic Result for a Model of Neural Computation. 257-262
  
• Martin Klazar:
  On Trees and Noncrossing Partitions. 263-269
  
• Akiyoshi Shioura:
  A Constructive Proof for the Induction of M-convex Functions through Networks. 271-278