| 447 | -- | 459 | Sanjiv Kapoor, Prakash V. Ramanan. Lower Bounds for Maximal and Convex Layers Problems |
| 461 | -- | 469 | Kenneth L. Clarkson. An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time |
| 471 | -- | 501 | Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito. Algorithms for Multicommodity Flows in Planar Graphs |
| 501 | -- | 517 | Nimrod Megiddo. Extending NC and RNC Algorithms |
| 503 | -- | 510 | Daniel S. Hirschberg, Lawrence L. Larmore. The Set-Set LCS Problem |
| 519 | -- | 533 | Prakash V. Ramanan, Kazuhiro Tsuga. Average-Case Analysis of the Modified Harmonic Algorithm |
| 535 | -- | 550 | Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. A Dynamic Fixed Windowing Problem |
| 551 | -- | 567 | Michael Luby, Prabhakar Ragde. A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior |
| 569 | -- | 583 | Pravin M. Vaidya. Approximate Minimum Weight Matching on Points in k-Dimensional Space |
| 585 | -- | 597 | Elena Lodi, Fabrizio Luccio, Linda Pagli. A Preliminary Study of a Diagonal Channel-Routing Model |
| 599 | -- | 605 | Steven Skiena. Problems in Geometric Probing |