| 225 | -- | 248 | Adrian Dumitrescu, Minghui Jiang. n Points |
| 249 | -- | 286 | Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. Improved Bounds for Finger Search on a RAM |
| 287 | -- | 309 | Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen. List Factoring and Relative Worst Order Analysis |
| 310 | -- | 328 | Vladimir Pestov. Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions |
| 329 | -- | 345 | Jesper Jansson, Wing-Kin Sung. Constructing the R* Consensus Tree of Two Trees in Subcubic Time |
| 346 | -- | 368 | Satoru Iwata, Mizuyo Takamatsu. Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation |
| 369 | -- | 396 | Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang. A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs |
| 397 | -- | 418 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao. Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals |
| 419 | -- | 449 | Radu Mihaescu, Cameron Hill, Satish Rao. Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences |
| 450 | -- | 478 | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh. PASS Approximation: A Framework for Analyzing and Designing Heuristics |