Journal: Combinatorica

Volume 10, Issue 4

319 -- 324Noga Alon. The maximum number of Hamiltonian paths in tournaments
325 -- 331András Frank. Packing paths in planar graphs
333 -- 348J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
349 -- 365Nathan Linial, Noam Nisan. Approximate inclusion-exclusion
367 -- 377Brendan D. McKay. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
379 -- 392Paul D. Seymour. Colouring series-parallel graphs
393 -- 396Aart Blokhuis. Solution of an extremal problem for sets using resultants of polynomials

Volume 10, Issue 3

229 -- 249Bernard Chazelle, Joel Friedman. A deterministic view of random sampling and its use in geometry
251 -- 260Herbert Edelsbrunner. An acyclicity theorem for cell complexes in d dimension
261 -- 269Paul Erdös, János Pach. Variation on the theme of repeated distances
271 -- 280Gil Kalai. On low-dimensional faces that high-dimensional polytopes must have
281 -- 306M. Laczkovich. Tiling of polygons with similar triangles
307 -- 311Richard Pollack, Rephael Wenger. Necessary and sufficient conditions for hyperplane transversals
313 -- 317Valeriu Soltan, Mahn Hung Nguyên. Some notes about affine diameters of convex figures

Volume 10, Issue 2

113 -- 114Gábor Fejes Tóth, János Pach. Special issue dedicated to discrete and computational geometry
137 -- 173Boris Aronov, Micha Sharir. Triangles in space or building (and analyzing) castles in the air
175 -- 183Imre Bárány, Zoltán Füredi, László Lovász. On the number of halving planes
185 -- 194Imre Bárány, Micha Sharir. The Caratheodory number for the k-core
195 -- 202Tibor Bisztriczky, Gábor Fejes Tóth. Convexly independent sets
203 -- 225Hans Leo Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen. Computational complexity of norm-maximization

Volume 10, Issue 1

3 -- 25William Aiello, Shafi Goldwasser, Johan Håstad. On the power of interaction
27 -- 40Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi. Entropy splitting for antiblocking corners and perfect graphs
41 -- 51Hubert de Fraysseix, János Pach, Richard Pollack. How to draw a planar graph on a grid
53 -- 59Valerie King. A lower bound for the recognition of digraph properties
61 -- 65Michel Las Vergnas. An upper bound for the number of Eulerian orientations of a regular graph
67 -- 80Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito. On the fg-coloring of graphs
81 -- 93Alexander A. Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity
95 -- 102Joel Spencer. Infinite spectra in the first order theory of graphs
103 -- 106Pierre G. Bonneau. Weight distribution of translates of MDS codes
107 -- 109Christos H. Papadimitriou, Mihalis Yannakakis. On recognizing integer polyhedra