| 151 | -- | 158 | Timothy Y. Chow. Penny-Packings with Minimal Second Moments |
| 159 | -- | 165 | Guoli Ding. Bounding the Number of Bases of a Matroid |
| 167 | -- | 174 | György Elekes. Circle Grids and Bipartite Graphs of Distances |
| 175 | -- | 185 | David A. Grable, Kevin T. Phelps, Vojtech Rödl. The Minimum Independence Number for Designs |
| 187 | -- | 202 | Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi. An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications |
| 204 | -- | 214 | Dror Lapidot, Adi Shamir. A One-Round, Two-Prover, Zero-Knowledge Protocol for NP |
| 215 | -- | 245 | Nathan Linial, Eran London, Yuri Rabinovich. The Geometry of Graphs and Some of its Algorithmic Applications |
| 247 | -- | 254 | Xiaoyun Lu. Hamiltonian Cycles in Bipartite Graphs |
| 255 | -- | 280 | Alessandro Panconesi, Aravind Srinivasan. The Local Natur of Delta-Coloring and its Algorithmic Applications |
| 281 | -- | 288 | Paul D. Seymour. Packing Directed Circuits Fractionally |
| 289 | -- | 295 | D. A. Youngs. Minimal Orientations of Colour Critical Graphs |
| 297 | -- | 299 | David Rubinstein. Sensitivity vs. Block Sensitivity of Boolean Functions |