Abstract is missing.
- Almost Stable Matchings in the Roommates ProblemDavid J. Abraham, Péter Biró, David Manlove. 1-14 [doi]
- On the Minimum Load Coloring ProblemNitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav. 15-26 [doi]
- Improved Approximation Algorithms for MAX NAE-SAT and MAX SATAdi Avidor, Ido Berkovitch, Uri Zwick. 27-40 [doi]
- The Hardness of Network Design for Unsplittable Flow with Selfish UsersYossi Azar, Amir Epstein. 41-54 [doi]
- Improved Approximation Algorithm for Convex Recoloring of TreesReuven Bar-Yehuda, Ido Feldman, Dror Rawitz. 55-68 [doi]
- Exploiting Locality: Approximating Sorting BuffersReuven Bar-Yehuda, Jonathan Laserson. 69-81 [doi]
- Approximate Fair Cost Allocation in Metric Traveling Salesman GamesMarkus Bläser, L. Shankar Ram. 82-95 [doi]
- Rounding of Sequences and Matrices, with ApplicationsBenjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild. 96-109 [doi]
- A Note on Semi-online Machine CoveringTomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger. 110-118 [doi]
- SONET ADMs Minimization with Divisible PathsLeah Epstein, Asaf Levin. 119-132 [doi]
- The Conference Call Search Problem in Wireless NetworksLeah Epstein, Asaf Levin. 133-146 [doi]
- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish AgentsAlessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre. 147-160 [doi]
- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy CostDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. 161-175 [doi]
- A Better-Than-Greedy Algorithm for ::::k::::-Set MulticoverToshihiro Fujito, Hidekazu Kurahashi. 176-189 [doi]
- Deterministic Online Optical Call Admission RevisitedElisabeth Gassner, Sven Oliver Krumke. 190-202 [doi]
- Scheduling Parallel Jobs with Linear SpeedupAlexander Grigoriev, Marc Uetz. 203-215 [doi]
- Online Removable Square PackingXin Han, Kazuo Iwama, Guochuan Zhang. 216-229 [doi]
- The Online Target Date Assignment ProblemStefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld. 230-243 [doi]
- Approximation and Complexity of ::::k::::-Splittable FlowsRonald Koch, Martin Skutella, Ines Spenke. 244-257 [doi]
- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride ProblemSven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie. 258-269 [doi]
- Tighter Approximations for Maximum Induced Matchings in Regular GraphsZvi Gotthilf, Moshe Lewenstein. 270-281 [doi]
- On Approximating Restricted Cycle CoversBodo Manthey. 282-295 [doi]
- A PTAS for the Minimum Dominating Set Problem in Unit Disk GraphsTim Nieberg, Johann Hurink. 296-306 [doi]
- Speed Scaling of Tasks with Precedence ConstraintsKirk Pruhs, Rob van Stee, Patchrawat Uthaisombut. 307-319 [doi]
- Partial Multicuts in TreesAsaf Levin, Danny Segev. 320-333 [doi]
- Approximation Schemes for Packing with Item FragmentationHadas Shachnai, Tami Tamir, Omer Yehezkely. 334-347 [doi]