1. A random 1-011-011-01algorithm for depth first search

   • A. Aggarwal
   • R. J. Anderson

   OriginalPaper Pages: 1 - 12

2. Optima of dual integer linear programs

   • R. Aharoni
   • P. Erdős
   • N. Linial

   OriginalPaper Pages: 13 - 20

3. On a lattice point problem of L. Moser. I

   • József Beck

   OriginalPaper Pages: 21 - 47

4. The chromatic number of random graphs

   • B. Bollobás

   OriginalPaper Pages: 49 - 55

5. A remark on partial linear spaces of girth 5 with an application to strongly regular graphs

   • A. E. Brouwer
   • A. Neumaier

   OriginalPaper Pages: 57 - 61

6. On multiplicative graphs and the product conjecture

   • R. Häggkvist
   • P. Hell
   • V. Neumann Lara

   OriginalPaper Pages: 63 - 74

7. Dual vectors and lower bounds for the nearest lattice point problem

   • J. Hastad

   OriginalPaper Pages: 75 - 81

8. Small topological complete subgraphs of “dense” graphs

   • A. Kostochka
   • L. Pyber

   OriginalPaper Pages: 83 - 86

9. A generalization of the ingleton—Main lemma and a class of non-algebraic matroids

   • B. Lindström

   OriginalPaper Pages: 87 - 90

10. Rubber bands, convex embeddings and graph connectivity

    • N. Linial
    • L. Lovász
    • A. Wigderson

    OriginalPaper Pages: 91 - 102

11. The Schrijver system of odd join polyhedra

    • A. Sebő

    OriginalPaper Pages: 103 - 116

12. Improved lower bounds on the length of Davenport-Schinzel sequences

    • Micha Sharir

    OriginalPaper Pages: 117 - 124

13. The classification of distance-regular graphs of type IIB

    • P. Terwilliger

    OriginalPaper Pages: 125 - 132

    

14. A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality

    • L. Babai

    Notes Pages: 133 - 135

    

15. The edge-density of 4-critical planar graphs

    • B. Grünbaum

    Notes Pages: 137 - 139

16. The gap between monotone and non-monotone circuit complexity is exponential

    • É. Tardos

    Notes Pages: 141 - 142