| 180 | -- | 196 | Ravi B. Boppana, Magnús M. Halldórsson. Approximating Maximum Independent Sets by Excluding Subgraphs |
| 197 | -- | 214 | Stefan Arnborg, Andrzej Proskurowski. Canonical Representations of Partial 2- and 3-Trees |
| 215 | -- | 236 | Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs |
| 237 | -- | 248 | David Eppstein. Finding the ::::k:::: Smallest Spanning Trees |
| 249 | -- | 267 | John Hershberger, Subhash Suri. Applications of a Semi-Dynamic Convex Hull Algorithm |
| 268 | -- | 279 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal. Intersection Queries in Sets of Disks |
| 280 | -- | 296 | Christos Levcopoulos, Andrzej Lingas. Fast Algorithms for Greedy Triangulation |
| 297 | -- | 315 | Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani. Improved Bounds for the Expected Behaviour of AVL Trees |
| 316 | -- | 332 | Thomas Papadakis, J. Ian Munro, Patricio V. Poblete. Average Search and Update Costs in Skip Lists |