1. Interval routing schemes

   • M. Flammini
   • G. Gambosi
   • S. Salomone

   OriginalPaper Pages: 549 - 568

2. A nearly optimal deterministic parallel Voronoi diagram algorithm

   • R. Cole
   • M. T. Goodrich
   • C. Ó. Dúnlaing

   OriginalPaper Pages: 569 - 617

3. Generating rooted triangulations without repetitions

   • D. Avis

   OriginalPaper Pages: 618 - 632

4. Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree

   • D. B. Johnson
   • P. Metaxas

   OriginalPaper Pages: 633 - 648

5. Shellsort with a constant number of increments

   • M. A. Weiss

   OriginalPaper Pages: 649 - 654