1. Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

   • Y. C. Wee
   • S. Chaiken
   • S. S. Ravi

   OriginalPaper Pages: 421 - 435

2. Polynomial algorithms for linear programming over the algebraic numbers

   • I. Adler
   • P. A. Beling

   OriginalPaper Pages: 436 - 457

3. Heuristic sampling on DAGs

   • Pang -Chieh Chen

   OriginalPaper Pages: 458 - 475

4. Upward drawings of triconnected digraphs

   • P. Bertolazzi
   • G. Di Battista
   • C. Mannino

   OriginalPaper Pages: 476 - 497

5. External segment trees

   • G. Blankenagel
   • R. H. Güting

   OriginalPaper Pages: 498 - 532

6. New results for the minimum weight triangulation problem

   • L. S. Heath
   • S. V. Pemmaraju

   OriginalPaper Pages: 533 - 552