| 1 | -- | 7 | Jorge L. Ramírez Alfonsín. On Variations of the Subset Sum Problem |
| 9 | -- | 17 | Frank E. Bennett, Lisheng Wu. Minimum Matrix Representation of Sperner Systems |
| 19 | -- | 39 | Catherine Z. W. Hassell Sweatman, Gavin J. Gibson, Bernard Mulgrew. Exact Classification with Two-layer Neural Nets in N Dimensions |
| 41 | -- | 57 | Dih Jiun Guan. Routing a Vehicle of Capacity Greater than one |
| 59 | -- | 68 | Petr Hlinený. The Maximal Clique and Colourability of Curve Contact Graphs |
| 69 | -- | 91 | Yanpei Liu, Aurora Morgana, Bruno Simeone. A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid |
| 93 | -- | 108 | Claire Hanen, Alix Munier Kordon. Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays |
| 109 | -- | 122 | James G. Oxley, Don Row. Panelling Planar Graphs |
| 123 | -- | 131 | Maria Grazia Scutellà. A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem |
| 133 | -- | 139 | Charles R. Blair. Sensitivity Analysis for Knapsack Problems: A Negative Result |
| 141 | -- | 154 | Dasong Cao, George L. Nemhauser. Polyhedral Characterizations, Perfection of Line Graphs |
| 155 | -- | 167 | Arturo Carpi. On the Number of Abelian Square-free Words on Four Letters |
| 169 | -- | 180 | Lenwood S. Heath, John Paul C. Vergara. Edge-packing Planar Graphs by Cyclic Graphs |
| 181 | -- | 190 | Ewa Kubicka, Grzegorz Kubicki, Ortrud Oellermann. Steiner Intervals in Graphs |
| 191 | -- | 215 | Rong Lin, Stephan Olariu. A Fast Parallel Algorithm to Recognize P4-sparse Graphs |
| 217 | -- | 224 | Gerard Sierksma. Interchange Graphs and the Hamiltonian Cycle Polytope |
| 225 | -- | 237 | Roberto Conti, Pierluigi Contucci, Corrado Falcolini. Polynomial Invariants for Trees a Statistical Mechanics Approach |
| 239 | -- | 261 | Kazuo Iwama, Eiji Miyano. Better Approximations of Non-Hamiltonian Graphs |