Discrete Applied Mathematics, Volume 68

Volume 68, Number 1-2, 1996

• Jean-Claude Bermond, Fahir Ö. Ergincan:
  Bus Interconnection Networks. 1-15
  Electronic Edition (link) BibTeX
• Igor Averbakh, Oded Berman:
  A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. 17-32
  Electronic Edition (link) BibTeX
• Francine Blanchet-Sadri:
  Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy. 33-71
  Electronic Edition (link) BibTeX
• Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
  The Algorithmic Complexity of Minus Domination in Graphs. 73-84
  Electronic Edition (link) BibTeX
• Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart:
  An Algorithm to Find Two Distance Domination Parameters in a Graph. 85-91
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Janez Zerovnik:
  Algebraic Approach to Fasciagraphs and Rotagraphs. 93-100
  Electronic Edition (link) BibTeX
• Chung-Yee Lee, Chung-Lun Li:
  On the Fixed Interval Due-date Scheduling Problem. 101-117
  Electronic Edition (link) BibTeX
• Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte:
  Degree-constrained Spanners for Multidimensional Grids. 119-144
  Electronic Edition (link) BibTeX
• Dragos Radu Popescu, Ioan Tomescu:
  Negative Cycles in Complete Signed Graphs. 145-152
  Electronic Edition (link) BibTeX
• Hanif D. Sherali, Youngho Lee:
  Tighter Representations for Set Partitioning Problems. 153-167
  Electronic Edition (link) BibTeX
• Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled:
  Restrictions and Preassignments in Preemptive open Shop Scheduling. 169-188
  Electronic Edition (link) BibTeX
• Wenci Yu:
  Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem. 189-202
  Electronic Edition (link) BibTeX
• Brian Aldershof, Olivia M. Carducci:
  Stable Matchings with Couples. 203-207
  Electronic Edition (link) BibTeX

Volume 68, Number 3, 1996

• Peter C. Fishburn:
  Decision Theory and Discrete Mathematics. 209-221
  Electronic Edition (link) BibTeX
• Iain A. Stewart:
  Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. 223-235
  Electronic Edition (link) BibTeX
• Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto:
  Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. 237-248
  Electronic Edition (link) BibTeX
• Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
  on the Steiner Median of a Tree. 249-258
  Electronic Edition (link) BibTeX
• Feodor F. Dragan, Vitaly I. Voloshin:
  Incidence Graphs of Biacyclic Hypergraphs. 259-266
  Electronic Edition (link) BibTeX
• Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
  Maximal Irredundant Functions. 267-277
  Electronic Edition (link) BibTeX
• Yannis Manoussakis, Zsolt Tuza:
  The Forwarding Index of Directed Networks. 279-291
  Electronic Edition (link) BibTeX
• Satyan R. Coorg, C. Pandu Rangan:
  The Parity Path Problem on Some Subclasses of Perfect Graphs. 293-302
  Electronic Edition (link) BibTeX