1. A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs

   • Heather Booth
   • Jeffery Westbrook

   OriginalPaper Pages: 341 - 352

2. On the complexity of preflow-push algorithms for maximum-flow problems

   • Levent Tunçel

   OriginalPaper Pages: 353 - 359

3. Visibility with a moving point of view

   • Marshall Bern
   • David Dobkin
   • Robert Grossman

   OriginalPaper Pages: 360 - 378

4. Edge crossings in drawings of bipartite graphs

   • Peter Eades
   • Nicholas C. Wormald

   OriginalPaper Pages: 379 - 403

5. A workbench for computational geometry

   • P. Epstein
   • J. Kavanagh
   • J. -R. Sack

   OriginalPaper Pages: 404 - 428