1. The Nature and Meaning of Perturbations in Geometric Computing

   • R. Seidel

   Pages: 1 - 17

2. Counting d -Step Paths in Extremal Dantzig Figures

   • J. C. Lagarias
   • N. Prabhu

   Pages: 19 - 31

3. Counterexamples to the Strong d -Step Conjecture for d≥5

   • F. Holt
   • V. Klee

   Pages: 33 - 46

4. The Complexity of Stratification Computation

   • E. Rannou

   Pages: 47 - 78

5. Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

   • Y. Rabinovich
   • R. Raz

   Pages: 79 - 94

6. Largest Placement of One Convex Polygon Inside Another

   • P. K. Agarwal
   • N. Amenta
   • M. Sharir

   Pages: 95 - 104

7. On Functional Separately Convex Hulls

   • J. Matoušek
   • P. Plecháč

   Pages: 105 - 130

8. Fast Algorithms for Complete Linkage Clustering

   • D. Krznaric
   • C. Levcopoulos

   Pages: 131 - 145