| 1 | -- | 12 | Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan. Partitioning Graphs of Bounded Tree-Width |
| 13 | -- | 25 | György Elekes. On Linear Combinatorics II. Structure Theorems via Additive Number Theory |
| 27 | -- | 35 | Ehud Friedgut. Boolean Functions With Low Average Sensitivity Depend On Few Coordinates |
| 37 | -- | 59 | Michel X. Goemans, David P. Williamson. Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs |
| 61 | -- | 83 | Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi. A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations |
| 85 | -- | 99 | Jeff Kahn, Yang Yu. Log-Concave Functions And Poset Probabilities |
| 101 | -- | 120 | Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger. An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth |
| 121 | -- | 132 | Nathan Linial, Ori Sasson. Non-Expansive Hashing |
| 133 | -- | 137 | Pompeo Polito, Olga Polverino. On Small Blocking Sets |
| 139 | -- | 149 | Yonutz Stanchescu. On the Simplest Inverse Problem for Sums of Sets in Several Dimensions |