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