An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem Jianer ChenYang LiuSongjian Lu OriginalPaper 21 November 2007 Pages: 1 - 13
A Separation Bound for Real Algebraic Expressions Christoph BurnikelStefan FunkeSusanne Schmitt OriginalPaper Open access 04 December 2007 Pages: 14 - 28
A Fast Algorithm for Adaptive Prefix Coding Marek KarpinskiYakov Nekrich OriginalPaper 14 December 2007 Pages: 29 - 41
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs Benjamin BirnbaumKenneth J. Goldman OriginalPaper 14 December 2007 Pages: 42 - 59
Indexing Factors with Gaps Costas S. IliopoulosM. Sohel Rahman OriginalPaper 05 December 2007 Pages: 60 - 70
The Network as a Storage Device: Dynamic Routing with Bounded Buffers Stanislav AngelovSanjeev KhannaKeshav Kunal OriginalPaper 07 December 2007 Pages: 71 - 94
Incremental Construction of Minimal Tree Automata Rafael C. CarrascoJan DaciukMikel L. Forcada OriginalPaper 06 February 2008 Pages: 95 - 110
Derandomized Constructions of k-Wise (Almost) Independent Permutations Eyal KaplanMoni NaorOmer Reingold OriginalPaper 25 December 2008 Pages: 113 - 133
Reconstructive Dispersers and Hitting Set Generators Christopher Umans OriginalPaper 19 December 2008 Pages: 134 - 156
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs Kamalika ChaudhuriSatish RaoKunal Talwar OriginalPaper 10 November 2007 Pages: 157 - 189
Approximating the Bandwidth of Caterpillars Uriel FeigeKunal Talwar OriginalPaper 13 October 2007 Pages: 190 - 204
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints V. S. Anil KumarMadhav V. MaratheAravind Srinivasan OriginalPaper 15 September 2007 Pages: 205 - 226
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses Julián Mestre OriginalPaper 13 October 2007 Pages: 227 - 239
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems Jan RemyAngelika Steger OriginalPaper 31 October 2007 Pages: 240 - 267
