| 1 | -- | 12 | Alok Aggarwal, Richard J. Anderson. A random NC algorithm for depth first search |
| 13 | -- | 20 | Ron Aharoni, Paul Erdös, Nathan Linial. Optima of dual integer linear programs |
| 21 | -- | 47 | József Beck. On a lattice point problem of L. Moser I |
| 49 | -- | 55 | Béla Bollobás. The chromatic number of random graphs |
| 57 | -- | 61 | Andries E. Brouwer, Arnold Neumaier. A remark on partial linear spaces of girth 5 with an application to strongly regular graphs |
| 63 | -- | 74 | Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara. On multiplicative graphs and the product conjecture |
| 75 | -- | 81 | Johan Håstad. Dual vectors and lower bounds for the nearest lattice point problem |
| 83 | -- | 86 | Alexandr V. Kostochka, László Pyber. Samll topological complete subgraphs of dense graphs |
| 87 | -- | 90 | Bernt Lindström. A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids |
| 91 | -- | 102 | Nathan Linial, László Lovász, Avi Wigderson. Rubber bands, convex embeddings and graph connectivity |
| 103 | -- | 116 | András Sebö. The Schrijver system of odd join polyhedra |
| 117 | -- | 124 | Micha Sharir. Improved lower bounds on the length of Davenport - Schinzel sequences |
| 125 | -- | 132 | Paul Terwilliger. The classification of distance-regular graphs of type IIB |
| 133 | -- | 135 | László Babai. A short proof of the non-uniform Ray Chauhuri - Wilson inequality |
| 137 | -- | 139 | Branko Grünbaum. The edge-density of 4-critical planar graphs |
| 141 | -- | 142 | Éva Tardos. The gap between monotone and non-monotone circuit complexity is exponential |