| 185 | -- | 203 | Guantao Chen, Ronald J. Gould, Xingxing Yu. Graph Connectivity After Path Removal |
| 205 | -- | 243 | Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard |
| 245 | -- | 261 | Friedrich Eisenbrand, Andreas S. Schulz. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube |
| 263 | -- | 281 | Kevin Ford. Maximal Collections of Intersecting Arithmetic Progressions |
| 283 | -- | 302 | Grigor Gasparyan, Myriam Preissmann, András Sebö. Imperfect and Nonideal Clutters: A Common Approach |
| 303 | -- | 310 | André E. Kézdy, Jenö Lehel, Robert C. Powers. Heavy Transversals and Indecomposable Hypergraphs |
| 311 | -- | 363 | Jeong Han Kim, Van H. Vu. Small Complete Arcs in Projective Planes |