Discrete Applied Mathematics, Volume 30

Volume 30, Number 1, January 1991

• J. Bovet, C. Constantin, Dominique de Werra:
  A convoy scheduling problem. 1-14
  Electronic Edition (link) BibTeX
• Leizhen Cai, John A. Ellis:
  NP-completeness of edge-colouring some restricted graphs. 15-27
  Electronic Edition (link) BibTeX
• Refael Hassin, Nimrod Megiddo:
  Approximation algorithms for hitting objects with straight lines. 29-42
  Electronic Edition (link) BibTeX
• Ananth V. Iyer, H. Donald Ratliff, Gopalakrishnan Vijayan:
  On an edge ranking problem of trees and graphs. 43-52
  Electronic Edition (link) BibTeX
• Chung-Yee Lee:
  Parallel machines scheduling with nonsimultaneous machine available time. 53-61
  Electronic Edition (link) BibTeX
• Fuji Zhang, Rong-si Chen:
  When each hexagon of a hexagonal system covers it. 63-75
  Electronic Edition (link) BibTeX
• Zoltán Ésik:
  A note on isomorphic simulation of automata by networks of two-state automata. 77-82
  Electronic Edition (link) BibTeX
• F. K. Hwang, S. Papastavridis:
  Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. 83-86
  Electronic Edition (link) BibTeX
• Yohei Yamasaki:
  A difficulty in particular Shannon-like games. 87-90
  Electronic Edition (link) BibTeX
• Hosam M. Mahmoud, Boris Pittel:
  Corrigendum. 91
  Electronic Edition (link) BibTeX

Volume 30, Numbers 2-3, February 1991

• Peter L. Hammer, Pierre Hansen, Fred S. Roberts:
  Acknowledgement. 99
  Electronic Edition (link) BibTeX
• Stephen Bowser, Charles Cable:
  Some recent results on niche graphs. 101-108
  Electronic Edition (link) BibTeX
• Philippe Chrétienne:
  The basic cyclic scheduling problem with deadlines. 109-123
  Electronic Edition (link) BibTeX
• Margaret B. Cozzens, Mark D. Halsey:
  The relationship between the threshold dimension of split graphs and various dimensional parameters. 125-135
  Electronic Edition (link) BibTeX
• Dominique de Werra, F. S. Roberts:
  On the use of augmenting chains in chain packings. 137-149
  Electronic Edition (link) BibTeX
• Paul Erdös, Joel Spencer:
  Lopsided Lovász Local Lemma and Latin transversals. 151-154
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Edward R. Scheinerman:
  A deletion game on hypergraphs. 155-162
  Electronic Edition (link) BibTeX
• Peter L. Hammer, Frédéric Maffray, Maurice Queyranne:
  Cut-threshold graphs. 163-179
  Electronic Edition (link) BibTeX
• Pierre Hansen, Martine Labbé, Brigitte Nicolas:
  The continuous center set of a network. 181-195
  Electronic Edition (link) BibTeX
• Marek Libura:
  Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. 197-211
  Electronic Edition (link) BibTeX
• Tomasz Luczak:
  Holes in random graphs. 213-219
  Electronic Edition (link) BibTeX
• Colin McDiarmid, Zevi Miller:
  Lattice bandwidth of random graphs. 221-227
  Electronic Edition (link) BibTeX
• B. L. Piazza, Richard D. Ringeisen:
  Connectivity of generalized prisms over G. 229-233
  Electronic Edition (link) BibTeX
• Joel Spencer:
  Threshold spectra via the Ehrenfeucht game. 235-252
  Electronic Edition (link) BibTeX
• Gottfried Tinhofer:
  A note on compact graphs. 253-264
  Electronic Edition (link) BibTeX
• Dorothea Wagner, Frank Wagner:
  A generalization of the zero-one principle for sorting algorithms. 265-273
  Electronic Edition (link) BibTeX