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