1. Computing the volume is difficult

   • Imre Bárány
   • Zoltán Füredi

   OriginalPaper 01 December 1987 Pages: 319 - 326

2. A lower bound for the optimal crossing-free Hamiltonian cycle problem

   • Ryan B. Hayward

   OriginalPaper 01 December 1987 Pages: 327 - 343

3. A power law for the distortion of planar sets

   • Michael H. Freedman

   OriginalPaper 01 December 1987 Pages: 345 - 351

4. Finite coverings by translates of centrally symmetric convex domains

   • G. Fejes Tóth

   OriginalPaper 01 December 1987 Pages: 353 - 363

5. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments

   • Chee K. Yap

   OriginalPaper 01 December 1987 Pages: 365 - 393

6. Invertible relations on polytopes

   • G. T. Sallee

   OriginalPaper 01 December 1987 Pages: 395 - 399

7. Steiner minimal trees on sets of four points

   • D. Z. Du
   • F. K. Hwang
   • G. Y. Ting

   OriginalPaper 01 December 1987 Pages: 401 - 414