Volume 19, Number 1, 1998

• 
  Raimund Seidel: The Nature and Meaning of Perturbations in Geometric Computing. 1-17
• 
  J. C. Lagarias, N. Prabhu: Counting d -Step Paths in Extremal Dantzig Figures. 19-31
• 
  F. B. Holt, Victor Klee: Counterexamples to the Strong d -Step Conjecture for d ge 5. 33-46
• 
  E. Rannou: The Complexity of Stratification Computation. 47-78
• 
  Yuri Rabinovich, Ran Raz: Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. 79-94
• 
  Pankaj K. Agarwal, Nina Amenta, Micha Sharir: Largest Placement of One Convex Polygon Inside Another. 95-104
• 
  Jirí Matousek, Petr Plechác: On Functional Separately Convex Hulls. 105-130
• 
  Drago Krznaric, Christos Levcopoulos: Fast Algorithms for Complete Linkage Clustering. 131-145

Volume 19, Number 2, 1998

• 
  H. S. M. Coxeter: Seven Cubes and Ten 24-Cells. 151-157
• 
  Günter M. Ziegler: Shelling Polyhedral 3-Balls and 4-Polytopes. 159-174
• 
  Sergei Bespamyatnikh: An Optimal Algorithm for Closest-Pair Maintenance. 175-195
• 
  Ulrich Betke, Martin Henk: Finite Packings of Spheres. 197-227
• 
  E. Lutwak: Containment and Circumscribing Simplices. 229-235
• 
  Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Intersection of Curves and Crossing Number of C_m x C_n on Surfaces. 237-247
• 
  Bojan Mohar, Pierre Rosenstiehl: Tessellation and Visibility Representations of Maps on the Torus. 249-263
• 
  Hisao Tamaki, Takeshi Tokuyama: How to Cut Pseudoparabolas into Segments. 265-290
• 
  Horst Martini, Valeriu Soltan: Minimum Convex Partition of Polygonal Domains by Guillotine Cuts. 291-305

Volume 19, Number 3, 1998

• 
  János Pach: Guest Editor's Foreword. 311-313
• 
  Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. 315-331
• 
  Noga Alon: Piercing d -Intervals. 333-334
• 
  Imre Bárány, Pavel Valtr: A Positive Fraction Erdos - Szekeres Theorem. 335-342
• 
  Yuri F. Bilu, Vsevolod F. Lev, Imre Z. Ruzsa: Rectification Principles in Additive Number Theory. 343-354
• 
  Peter Braß: On Point Sets with Many Unit Distances in Few Directions. 355-366
• 
  Fan R. K. Chung, Ronald L. Graham: Forced Convex n -Gons in the Plane. 367-371
• 
  Tamal K. Dey: Improved Bounds for Planar k -Sets and Related Problems. 373-382
• 
  György Elekes: A Combinatorial Problem on Polynomials. 383-389
• 
  Peter C. Fishburn: Isosceles Planar Subsets. 390-398
• 
  Meir Katchalski, Hagit Last: On Geometric Graphs with No Two Edges in Convex Position. 399-404
• 
  Daniel J. Kleitman, Lior Pachter: Finding Convex Sets Among Points in the Plane. 405-410
• 
  M. Laczkovich: Tilings of Polygons with Similar Triangles, II. 411-425
• 
  János Pach, József Solymosi: Canonical Theorems for Convex Sets. 427-435
• 
  János Pach, Géza Tóth: A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. 437-445
• 
  István Talata: Exponential Lower Bound for the Translative Kissing Numbers of d -Dimensional Convex Bodies. 447-455
• 
  Géza Tóth, Pavel Valtr: Note on the Erdos - Szekeres Theorem. 457-459
• 
  Pavel Valtr: On Geometric Graphs with No k Pairwise Parallel Edges. 461-469

Volume 19, Number 4, 1998

• 
  Tamal K. Dey, János Pach: Extremal Problems for Geometric Hypergraphs. 473-484
• 
  Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec: Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. 485-519
• 
  Harald Günzel: On the Universal Partition Theorem for 4-Polytopes. 521-551
• 
  Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with One Reflection. 553-574
• 
  E. Sparla: An Upper and a Lower Bound Theorem for Combinatorial 4-Manifolds. 575-593
• 
  Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent: Embedding into Rectilinear Spaces. 595-604
• 
  Andrei Gabrielov: Frontier and Closure of a Semi-Pfaffian Set. 605-617

last updated on Thu May 23 04:08:26 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page