| 129 | -- | 149 | Béchir el Ayeb. Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n:::2:::sqrt(tau/log n) Algorithm |
| 150 | -- | 167 | Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink. Efficiently Approximating Polygonal Paths in Three and Higher Dimensions |
| 168 | -- | 182 | Madhukar R. Korupolu, Vijaya Ramachandran. Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence |
| 183 | -- | 200 | Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato. Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP |
| 201 | -- | 226 | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. Exact and Approximation Algorithms for Clustering |
| 227 | -- | 242 | Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Computing Approximate Shortest Paths on Convex Polytopes |
| 243 | -- | 262 | Victor Chepoi, Yann Vaxès. Augmenting Trees to Meet Biconnectivity and Diameter Constraints |
| 263 | -- | 269 | Sergei Bespamyatnikh, Michael Segal. Fast Algorithms for Approximating Distances |