Abstract is missing.
- Improved Approximations for the Max k-Colored Clustering ProblemAlexander A. Ageev, Alexander V. Kononov. 1-10 [doi]
- A o(n) -Competitive Deterministic Algorithm for Online Matching on a LineAntonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato. 11-22 [doi]
- Better Algorithms for Online Bin StretchingMartin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý. 23-34 [doi]
- Online Colored Bin PackingMartin Böhm, Jirí Sgall, Pavel Veselý. 35-46 [doi]
- Improved Bound for Online Square-into-Square PackingBrian Brubach. 47-58 [doi]
- Improved Approximation Algorithm for Fault-Tolerant Facility PlacementBartosz Rybicki, Jaroslaw Byrka. 59-70 [doi]
- The Submodular Facility Location Problem and the Submodular Joint Replenishment ProblemSin-Shuen Cheung. 71-82 [doi]
- Online Multi-Coloring with AdviceMarie G. Christ, Lene M. Favrholdt, Kim S. Larsen. 83-94 [doi]
- Approximating Steiner Trees and Forests with Minimum Number of Steiner PointsNachshon Cohen, Zeev Nutov. 95-106 [doi]
- Energy-Efficient Algorithms for Non-preemptive Speed-ScalingVincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis. 107-118 [doi]
- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier CoverageJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny. 119-131 [doi]
- Linear-Time Approximation Algorithms for Unit Disk GraphsGuilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. Herrera de Figueiredo. 132-143 [doi]
- The Minimum Feasible Tileset ProblemYann Disser, Stefan Kratsch, Manuel Sorge. 144-155 [doi]
- Online Ad Assignment with an Ad ExchangeWolfgang Dvorák, Monika Henzinger. 156-167 [doi]
- Minimum Linear Arrangement of Series-Parallel GraphsMartina Eikel, Christian Scheideler, Alexander Setzer. 168-180 [doi]
- Online Dual Edge Coloring of Paths and TreesLene M. Favrholdt, Jesper W. Mikkelsen. 181-192 [doi]
- Online Packet Scheduling Under Adversarial JammingTomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys. 193-206 [doi]
- Generalized Hypergraph Matching via Iterated Packing and Local RatioOjas Parekh, David Pritchard. 207-223 [doi]
- Steiner Trees with Bounded RC-DelayRudolf Scheifele. 224-235 [doi]
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online AlgorithmsJirí Sgall, Gerhard J. Woeginger. 236-247 [doi]
- Routing Under Uncertainty: The a priori Traveling Repairman ProblemMartijn van Ee, René Sitters. 248-259 [doi]
- Primal-Dual Algorithms for Precedence Constrained Covering ProblemsAndreas Wierz, Britta Peis, S. Thomas McCormick. 260-272 [doi]