WAOA 2006 Special Issue of TOCS Thomas ErlebachChristos Kaklamanis EditorialNotes 29 January 2009 Pages: 427 - 428
Online Dynamic Programming Speedups Amotz Bar-NoyMordecai J. GolinYan Zhang OriginalPaper 21 January 2009 Pages: 429 - 445
Covering Many or Few Points with Unit Disks Mark de BergSergio CabelloSariel Har-Peled OriginalPaper 30 July 2008 Pages: 446 - 469
Online k-Server Routing Problems Vincenzo BonifaciLeen Stougie OriginalPaper 14 February 2008 Pages: 470 - 485
A Randomized Algorithm for Online Unit Clustering Timothy M. ChanHamid Zarrabi-Zadeh OriginalPaper 13 October 2007 Pages: 486 - 496
On Hierarchical Diameter-Clustering and the Supplier Problem Aparna DasClaire Kenyon-Mathieu OriginalPaper 27 January 2009 Pages: 497 - 511
Network Design with Edge-Connectivity and Degree Constraints Takuro FukunagaHiroshi Nagamochi OriginalPaper 15 October 2008 Pages: 512 - 532
Competitive Online Multicommodity Routing Tobias HarksStefan HeinzMarc E. Pfetsch OriginalPaper 12 February 2009 Pages: 533 - 554
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs Stavros AthanassopoulosIoannis CaragiannisChristos Kaklamanis OriginalPaper 15 April 2008 Pages: 555 - 576
The Complexity of Finding SUBSEQ(A) Stephen FennerWilliam GasarchBrian Postow OriginalPaper 19 April 2008 Pages: 577 - 612
On the Black-Box Complexity of Sperner’s Lemma Katalin FriedlGábor IvanyosYves F. Verhoeven OriginalPaper 05 June 2008 Pages: 629 - 646