| 1 | -- | 2 | Gérard Cornuéjols, William R. Pulleyblank. Foreword |
| 3 | -- | 44 | Egon Balas. Disjunctive Programming: Properties of the Convex Hull of Feasible Points |
| 45 | -- | 57 | Luitpold Babel. Triangulating Graphs with Few P::4:: s |
| 59 | -- | 73 | Andreas Brandstädt, Van Bang Le, Thomas Szymczak. The Complexity of some Problems Related to Graph 3-colorability |
| 75 | -- | 97 | Helen Cameron. Fringe Thickness and Maximum Path Length of Binary Trees |
| 99 | -- | 105 | Krzysztof Ciebiera, Adam Malinowski. Efficient Broadcasting with Linearly Bounded Faults |
| 107 | -- | 123 | José Gómez, Carles Padró, Stephane Perennes. Large Generalized Cycles |
| 125 | -- | 142 | Nili Guttmann-Beck, Refael Hassin. Approximation Algorithms for Min-sum p-clustering |
| 143 | -- | 153 | David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan. Partial and Perfect Path Covers of Cographs |
| 155 | -- | 168 | P. Sreenivasa Kumar, C. E. Veni Madhavan. Minimal Vertex Separators of Chordal Graphs |
| 169 | -- | 180 | Burkhard Lenze. Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type |
| 181 | -- | 195 | Horst Martini, Anita Schöbel. Median Hyperplanes in Normed Spaces - A Survey |
| 197 | -- | 212 | David Pisinger. A Fast Algorithm for Strongly Correlated Knapsack Problems |
| 213 | -- | 242 | Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jef L. van Meerbergen, Albert van der Werf. The Complexity of Multidimensional Periodic Scheduling |
| 243 | -- | 262 | S. S. Yu. d-minimal Languages |
| 263 | -- | 267 | Alain Hertz. On Perfect Switching Classes |
| 269 | -- | 276 | Shutao Xia, Fangwei Fu. On the Average Hamming Distance for Binary Codes |
| 277 | -- | 279 | Jing Huang. A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs |
| 281 | -- | 286 | Ming Ouyang. How Good Are Branching Rules in DPLL? |