Combinatorica, Volume 10

Volume 10, Number 1, 1990

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

• Pierre G. Bonneau:
  Weight distribution of translates of MDS codes. 103-106
  
• Christos H. Papadimitriou, Mihalis Yannakakis:
  On recognizing integer polyhedra. 107-109
  

Volume 10, Number 2, 1990

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

Volume 10, Number 3, 1990

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

Volume 10, Number 4, 1990

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

• Aart Blokhuis:
  Solution of an extremal problem for sets using resultants of polynomials. 393-396
  

Last update Sat May 25 15:39:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page