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