Discrete & Computational Geometry, Volume 41

Volume 41, Number 1, January 2009

• Konrad J. Swanepoel:
  Unit Distances and Diameters in Euclidean Spaces. 1-27
  
• T.-H. Hubert Chan, Anupam Gupta:
  Small Hop-diameter Sparse Spanners for Doubling Metrics. 28-44
  
• Charles Audet, Pierre Hansen, Frédéric Messine:
  Isoperimetric Polygons of Maximum Width. 45-60
  
• Gabriele Bianchi:
  Geometric Tomography of Convex Cones. 61-76
  
• Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
  Matching Points with Squares. 77-95
  
• Marian Mrozek, Bogdan Batko:
  Coreduction Homology Algorithm. 96-118
  
• Grant Cairns, Yury Nikolayevsky:
  Generalized Thrackle Drawings of Non-bipartite Graphs. 119-134
  
• Rade T. Zivaljevic:
  Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture. 135-161
  
• Ishay Haviv, Vadim Lyubashevsky, Oded Regev:
  A Note on the Distribution of the Distance from a Lattice. 162-176
  
• Pablo Suárez-Serrato:
  Affine Configurations and Pure Braids. 177-181
  

Volume 41, Number 2, March 2009

• Raman Sanyal, Axel Werner, Günter M. Ziegler:
  On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. 183-198
  
• Michael Navon, Alex Samorodnitsky:
  Linear Programming Bounds for Codes via a Covering Argument. 199-207
  
• Charles Audet, Pierre Hansen, Frédéric Messine:
  Simple Polygons of Maximum Perimeter Contained in a Unit Disk. 208-215
  
• Esther Ezra, János Pach, Micha Sharir:
  On Regular Vertices of the Union of Planar Convex Objects. 216-231
  
• N. J. A. Sloane, Vinay A. Vaishampayan:
  Generalizations of Schöbi's Tetrahedral Dissection. 232-248
  
• Eric J. Friedman:
  Finding a Simple Polytope from Its Graph in Polynomial Time. 249-256
  
• Piotr Mankiewicz, Nicole Tomczak-Jaegermann:
  Stability Properties of Neighbourly Random Polytopes. 257-272
  
• Gideon Schechtman, Adi Shraibman:
  Lower Bounds for Local Versions of Dimension Reductions. 273-283
  
• Vincent Pilaud, Francisco Santos:
  Multitriangulations as Complexes of Star Polygons. 284-317
  
• Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
  A Continuous d -Step Conjecture for Polytopes. 318-327
  
• Michelle Bucher-Karlsson:
  On Minimal Triangulations of Products of Convex Polygons. 328-347
  
• Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
  Coloring Geometric Range Spaces. 348-362
  

Volume 41, Number 3, April 2009

• Nina Amenta, Otfried Cheong:
  Guest Editors' Foreword. 363-364
  
• Eyal Ackerman:
  On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. 365-375
  
• János Pach, Géza Tóth:
  Degenerate Crossing Numbers. 376-384
  
• Vladlen Koltun, Micha Sharir:
  On Overlays and Minimization Diagrams. 385-397
  
• Sunil Arya, Theocharis Malamatos, David M. Mount:
  The Effect of Corners on the Complexity of Approximate Range Searching. 398-443
  
• Hayley N. Iben, James F. O'Brien, Erik D. Demaine:
  Refolding Planar Polygons. 444-460
  
• Frédéric Chazal, David Cohen-Steiner, André Lieutier:
  A Sampling Theory for Compact Sets in Euclidean Space. 461-479
  

Volume 41, Number 4, June 2009

• Richard Ehrenborg, Margaret Readdy, Michael Slone:
  Affine and Toric Hyperplane Arrangements. 481-512
  
• Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
  Traversing a Set of Points with a Minimum Number of Turns. 513-532
  
• Leonid Gurvits:
  A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor. 533-555
  
• Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
  Region-Fault Tolerant Geometric Spanners. 556-582
  
• Dan Ismailescu:
  Circumscribed Polygons of Small Area. 583-589
  
• James R. Lee:
  Volume Distortion for Subsets of Euclidean Spaces. 590-615
  
• Benoit Loridant, Jun Luo:
  On a Theorem of Bandt and Wang and Its Extension to p 2-tiles. 616-642
  
• Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
  Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. 643-670