A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs Heather BoothJeffery Westbrook OriginalPaper Pages: 341 - 352
On the complexity of preflow-push algorithms for maximum-flow problems Levent Tunçel OriginalPaper Pages: 353 - 359
Visibility with a moving point of view Marshall BernDavid DobkinRobert Grossman OriginalPaper Pages: 360 - 378
Edge crossings in drawings of bipartite graphs Peter EadesNicholas C. Wormald OriginalPaper Pages: 379 - 403
A workbench for computational geometry P. EpsteinJ. KavanaghJ. -R. Sack OriginalPaper Pages: 404 - 428