| 115 | -- | 119 | Luca Trevisan. Erratum: A Correction to Parallel Approximation Algorithms by Positive Linear Programming |
| 120 | -- | 130 | Sanjiv Kapoor, H. Ramesh. An Algorithm for Enumerating All Spanning Trees of a Directed Graph |
| 131 | -- | 144 | Reuven Bar-Yehuda. One for the Price of Two: a Unified Approach for Approximating Covering Problems |
| 145 | -- | 169 | Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto. Binary Searching with Nonuniform Costs and Its Application to Text Retrieval |
| 170 | -- | 186 | Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. Smallest Enclosing Cylinders |
| 187 | -- | 197 | G. Sajith, Sanjeev Saxena. Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests |
| 198 | -- | 207 | Nili Guttmann-Beck, Refael Hassin. Approximation Algorithms for Minimum ::::K::::-Cut |