| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Fast Algorithm for Adaptive Prefix Coding
|
Karpinski, Marek
|
|
2007
|
55 |
1 |
p. 29-41
|
article
|
| 2 |
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
|
Birnbaum, Benjamin
|
|
2007
|
55 |
1 |
p. 42-59
|
article
|
| 3 |
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
|
Chen, Jianer
|
|
2007
|
55 |
1 |
p. 1-13
|
article
|
| 4 |
Approximating the Bandwidth of Caterpillars
|
Feige, Uriel
|
|
2007
|
55 |
1 |
p. 190-204
|
article
|
| 5 |
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
|
Remy, Jan
|
|
2007
|
55 |
1 |
p. 240-267
|
article
|
| 6 |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
|
Mestre, Julián
|
|
2007
|
55 |
1 |
p. 227-239
|
article
|
| 7 |
A Separation Bound for Real Algebraic Expressions
|
Burnikel, Christoph
|
|
2007
|
55 |
1 |
p. 14-28
|
article
|
| 8 |
Derandomized Constructions of k-Wise (Almost) Independent Permutations
|
Kaplan, Eyal
|
|
2008
|
55 |
1 |
p. 113-133
|
article
|
| 9 |
Foreword
|
Chekuri, Chandra
|
|
2009
|
55 |
1 |
p. 111-112
|
article
|
| 10 |
Incremental Construction of Minimal Tree Automata
|
Carrasco, Rafael C.
|
|
2008
|
55 |
1 |
p. 95-110
|
article
|
| 11 |
Indexing Factors with Gaps
|
Iliopoulos, Costas S.
|
|
2007
|
55 |
1 |
p. 60-70
|
article
|
| 12 |
Reconstructive Dispersers and Hitting Set Generators
|
Umans, Christopher
|
|
2008
|
55 |
1 |
p. 134-156
|
article
|
| 13 |
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
|
Anil Kumar, V. S.
|
|
2007
|
55 |
1 |
p. 205-226
|
article
|
| 14 |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers
|
Angelov, Stanislav
|
|
2007
|
55 |
1 |
p. 71-94
|
article
|
| 15 |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
|
Chaudhuri, Kamalika
|
|
2007
|
55 |
1 |
p. 157-189
|
article
|
Journal description