1. Editors' foreword

   • Takao Asano
   • Takao Nishizeki

   EditorialNotes Pages: 517 - 517

2. Computing the intersection-depth of polyhedra

   • David Dobkin
   • John Hershberger
   • Subhash Suri

   OriginalPaper Pages: 518 - 533

3. Constructing strongly convex approximate hulls with inaccurate primitives

   • Leonidas Guibas
   • David Salesin
   • Jorge Stolfi

   OriginalPaper Pages: 534 - 560

4. Weaving patterns of lines and line segments in space

   • Jànos Pach
   • Richard Pollack
   • Emo Welzl

   OriginalPaper Pages: 561 - 571

5. Algorithms for projecting points to give the most uniform distribution with applications to hashing

   • Tetsuo Asano
   • Takeshi Tokuyama

   OriginalPaper Pages: 572 - 590

6. Finding extrema with unary predicates

   • Feng Gao
   • Leonidas J. Guibas
   • James Sake

   OriginalPaper Pages: 591 - 600

7. Fast algorithms for the dominating set problem on permutation graphs

   • Kuo-Hui Tsai
   • Wen-Lian Hsu

   OriginalPaper Pages: 601 - 614

8. Finding least-weight subsequences with fewer processors

   • Tak Wah Lam
   • Kwong-fai Chan

   OriginalPaper Pages: 615 - 628

9. Sublinear merging and natural mergesort

   • Svante Carlsson
   • Christos Levcopoulos
   • Ola Petersson

   OriginalPaper Pages: 629 - 648

10. Splitting a configuration in a simplex

    • Kazumiti Numata
    • Takeshi Tokuyama

    OriginalPaper Pages: 649 - 668