| 245 | -- | 273 | Jianer Chen, Iyad A. Kanj, Ge Xia. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems |
| 275 | -- | 292 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao. Representing Trees of Higher Degree |
| 293 | -- | 307 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung. Rooted Maximum Agreement Supertrees |
| 309 | -- | 343 | Mahesh Kallahalla, Peter J. Varman. Optimal Read-Once Parallel Disk Scheduling |