Online Clustering with Variable Sized Clusters János CsirikLeah EpsteinAsaf Levin OriginalPaper 12 November 2011 Pages: 251 - 274
Route-Enabling Graph Orientation Problems Takehiro ItoYuichiro MiyamotoRyuhei Uehara OriginalPaper 19 November 2011 Pages: 317 - 338
Unified Compression-Based Acceleration of Edit-Distance Computation Danny HermelinGad M. LandauOren Weimann OriginalPaper 17 November 2011 Pages: 339 - 353
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings Kuan-Yu ChenKun-Mao Chao OriginalPaper 12 November 2011 Pages: 354 - 370
I/O Efficient Dynamic Data Structures for Longest Prefix Queries Moshe HershcovitchHaim Kaplan OriginalPaper 23 November 2011 Pages: 371 - 390
Two-stage Robust Network Design with Exponential Scenarios Rohit KhandekarGuy KortsarzMohammad R. Salavatipour OriginalPaper 19 November 2011 Pages: 391 - 408
Streaming Graph Computations with a Helpful Advisor Graham CormodeMichael MitzenmacherJustin Thaler OriginalPaper 30 November 2011 Pages: 409 - 442
Power Domination in Circular-Arc Graphs Chung-Shou LiaoD. T. Lee OriginalPaper 30 November 2011 Pages: 443 - 466
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem Bang Ye Wu OriginalPaper 02 December 2011 Pages: 467 - 479