| 247 | -- | 260 | Ron M. Adin. Counting colorful multi-dimensional trees |
| 261 | -- | 274 | Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. The number of edges of many faces in a line segment arrangement |
| 275 | -- | 285 | Patrick Chiu. Cubic Ramanujan graphs |
| 287 | -- | 293 | Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely. Sharpening the LYM inequality |
| 295 | -- | 301 | Péter Hajnal, Mario Szegedy. On packing bipartite graphs |
| 303 | -- | 316 | Ron Holzman, Daniel J. Kleitman. Sign vectors and unit vectors |
| 317 | -- | 321 | Thomas Dale Porter. On a bottleneck bipartition conjecture of Erdös |
| 331 | -- | 350 | Wansoo T. Rhee, Michel Talagrand. Packing random items of three colors |
| 351 | -- | 361 | Attila Sali. Some intersection theorems |
| 363 | -- | 365 | Amha Tume Lisan. Multi-dimensional Ramsey theorems - an example |
| 367 | -- | 369 | Dezsö Miklós. Disproof of a conjecture in graph reconstruction theory |