| 427 | -- | 428 | Thomas Erlebach, Christos Kaklamanis. WAOA 2006 Special Issue of TOCS |
| 429 | -- | 445 | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang. Online Dynamic Programming Speedups |
| 446 | -- | 469 | Mark de Berg, Sergio Cabello, Sariel Har-Peled. Covering Many or Few Points with Unit Disks |
| 470 | -- | 485 | Vincenzo Bonifaci, Leen Stougie. Online ::::k::::-Server Routing Problems |
| 486 | -- | 496 | Timothy M. Chan, Hamid Zarrabi-Zadeh. A Randomized Algorithm for Online Unit Clustering |
| 497 | -- | 511 | Aparna Das, Claire Kenyon-Mathieu. On Hierarchical Diameter-Clustering and the Supplier Problem |
| 512 | -- | 532 | Takuro Fukunaga, Hiroshi Nagamochi. Network Design with Edge-Connectivity and Degree Constraints |
| 533 | -- | 554 | Tobias Harks, Stefan Heinz, Marc E. Pfetsch. Competitive Online Multicommodity Routing |
| 555 | -- | 576 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis. Analysis of Approximation Algorithms for ::::k::::-Set Cover Using Factor-Revealing Linear Programs |
| 577 | -- | 612 | Stephen A. Fenner, William I. Gasarch, Brian Postow. The Complexity of Finding SUBSEQ(::::A::::) |
| 613 | -- | 628 | Sebastian Dörn. Quantum Algorithms for Matching Problems |
| 629 | -- | 646 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. On the Black-Box Complexity of Sperner s Lemma |