Discrete Applied Mathematics, Volume 28

Volume 28, Number 1, July 1990

• Toshihide Ibaraki:
  Preface. 1
  Electronic Edition (link) BibTeX
• Annelie von Arnim, Ulrich Faigle, Rainer Schrader:
  The permutahedron of series-parallel posets. 3-9
  Electronic Edition (link) BibTeX
• Jacek Blazewicz, Maciej Drozdowski, G. Schmidt, Dominique de Werra:
  Scheduling independent two processor tasks on a uniform duo-processor system. 11-20
  Electronic Edition (link) BibTeX
• Rainer E. Burkard, En-Yu Yao:
  Constrained partitioning problems. 21-34
  Electronic Edition (link) BibTeX
• Peter L. Hammer, Uri N. Peled, Xiaorong Sun:
  Difference graphs. 35-44
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Ron Shamir:
  Minimizing the number of tardy job units under release time constraints. 45-57
  Electronic Edition (link) BibTeX
• Silvano Martello, Paolo Toth:
  Lower bounds and reduction procedures for the bin packing problem. 59-70
  Electronic Edition (link) BibTeX
• Feng Yang, Ding-Zhu Du:
  The complexity of determinacy problem on group testing. 71-81
  Electronic Edition (link) BibTeX

Volume 28, Number 2, August 1990

• Franz Aurenhammer:
  A relationship between Gale transforms and Voronoi diagrams. 83-91
  Electronic Edition (link) BibTeX
• Ruay Shiung Chang, Richard C. T. Lee:
  On the continuous working problem. 93-109
  Electronic Edition (link) BibTeX
• Peter Eades, Nicholas C. Wormald:
  Fixed edge-length graph drawing is NP-hard. 111-134
  Electronic Edition (link) BibTeX
• Michael A. Langston, Michael P. Morford:
  Resource allocation under limited sharing. 135-147
  Electronic Edition (link) BibTeX
• Charles T. Ryan, Kevin M. Ryan:
  The minimum weight of the Grassmann codes C(k, n), . 149-156
  Electronic Edition (link) BibTeX
• Zhuocheng Yang:
  On optimal strategies for a betting game. 157-169
  Electronic Edition (link) BibTeX
• Zoltán Füredi:
  Perfect error-correcting databases. 171-176
  Electronic Edition (link) BibTeX
• Zhixiong Wang:
  The solution of a nonlinear partial difference equation. 177-181
  Electronic Edition (link) BibTeX
• Toshimasa Watanabe, Akira Nakamura:
  A smallest augmentation to 3-connect a graph. 183-186
  Electronic Edition (link) BibTeX

Volume 28, Number 3, September 1990

• Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
  Recognizing tough graphs is NP-hard. 191-195
  Electronic Edition (link) BibTeX
• E. Andrew Boyd, Ulrich Faigle:
  An algorithmic characterization of antimatroids. 197-205
  Electronic Edition (link) BibTeX
• Jon Lee:
  Canonical equation sets for classes of concordant polytopes. 207-221
  Electronic Edition (link) BibTeX
• John W. Mamer, Kenneth Schilling:
  On the growth of random knapsacks. 223-230
  Electronic Edition (link) BibTeX
• Masahiro Miyakawa, Ivo G. Rosenberg, Ivan Stojmenovic:
  Classification of three-valued logical functions preserving 0. 231-249
  Electronic Edition (link) BibTeX
• Jennifer Ryan:
  The structure of an integral monoid and integer programming feasibility. 251-263
  Electronic Edition (link) BibTeX
• Suzanne M. Seager:
  The double competition number of some triangle-free graphs. 265-269
  Electronic Edition (link) BibTeX
• Marcelo J. Weinberger, Abraham Lempel:
  Factorization of symmetric circulant matrices in finite fields. 271-285
  Electronic Edition (link) BibTeX
• Heiko Wittenberg:
  Local medians in chordal graphs. 287-296
  Electronic Edition (link) BibTeX
• Adam Idzik:
  Communication in m-connected graphs. 297-301
  Electronic Edition (link) BibTeX
• Moni Naor:
  Succinct representation of general unlabeled graphs. 303-307
  Electronic Edition (link) BibTeX
• Gérald E. Séguin:
  Low complexity normal bases for F_2^mn. 309-312
  Electronic Edition (link) BibTeX