: On a lattice point problem of L. Moser I.
: Dual vectors and lower bounds for the nearest lattice point problem.
: A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids.
: The Schrijver system of odd join polyhedra.
: Improved lower bounds on the length of Davenport - Schinzel sequences.
: The classification of distance-regular graphs of type IIB.
: A short proof of the non-uniform Ray Chauhuri - Wilson inequality.
: The gap between monotone and non-monotone circuit complexity is exponential.
: On a lattice point problem of L. Moser II.
: A lower bound on strictly non-block networks.
: How big can the circuits of a bridge of a maximal circuit be?
: On a relation between a cyclic relative difference set associated with the quadratic extensions of a finite field and the Szekeres differences sets.
Günter M. Ziegler
: Branchings in rooted graphs and the diameter of greedoids.
: A lower bound for finding predecessors in Yao's call probe model.
Paul A. Catlin
: Contractions of graphs with no spanning eulerian subgraphs.
C. D. Godsil
: Bouding the diameter of distance-regular graphs.