A random 1-011-011-01algorithm for depth first search A. AggarwalR. J. Anderson OriginalPaper Pages: 1 - 12
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs A. E. BrouwerA. Neumaier OriginalPaper Pages: 57 - 61
On multiplicative graphs and the product conjecture R. HäggkvistP. HellV. Neumann Lara OriginalPaper Pages: 63 - 74
Dual vectors and lower bounds for the nearest lattice point problem J. Hastad OriginalPaper Pages: 75 - 81
Small topological complete subgraphs of “dense” graphs A. KostochkaL. Pyber OriginalPaper Pages: 83 - 86
A generalization of the ingleton—Main lemma and a class of non-algebraic matroids B. Lindström OriginalPaper Pages: 87 - 90
Rubber bands, convex embeddings and graph connectivity N. LinialL. LovászA. Wigderson OriginalPaper Pages: 91 - 102
Improved lower bounds on the length of Davenport-Schinzel sequences Micha Sharir OriginalPaper Pages: 117 - 124
The classification of distance-regular graphs of type IIB P. Terwilliger OriginalPaper Pages: 125 - 132
The gap between monotone and non-monotone circuit complexity is exponential É. Tardos Notes Pages: 141 - 142
