WAOA 2014 Accepted Papers

• Andreas Wierz, Britta Peis and Tom Mccormick
  Primal-Dual Algorithms for Precedence Constrained Covering Problems
• Jaroslaw Byrka and Bartosz Rybicki
  Improved approximation algorithm for Fault-Tolerant Facility Placement
• Nachshon Cohen and Zeev Nutov
  Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
• Sin-Shuen Cheung
  The submodular facility location problem and the submodular joint replenishment problem
• Yann Disser, Stefan Kratsch and Manuel Sorge
  The Minimum Feasible Tileset problem
• Martijn van Ee and Rene Sitters
  Routing under Uncertainty: the a priori Traveling Repairman Problem
• Lene Favrholdt and Jesper With Mikkelsen
  Online Dual Edge Coloring of Paths and Trees
• Marie G. Christ, Lene Favrholdt and Kim S. Larsen
  Online Multi-Coloring with Advice
• Alexander Ageev and Alexander Kononov
  Improved Approximations for the Max k-Colored Clustering Problem
• Martina Eikel, Christian Scheideler and Alexander Setzer
  Minimum Linear Arrangement of Series-Parallel Graphs
• Vincent Cohen-Addad, Zhentao Li, Claire Mathieu and Ioannis Milis
  Energy-efficient algorithms for non-preemptive speed-scaling
• Brian Brubach
  Online square-into-square packing with fixed and variable height shelves
• Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan and Jaroslav Opatrny
  Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
• Jiří Sgall and Gerhard J. Woeginger
  Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
• Martin Böhm, Jiří Sgall and Pavel Veselý
  Online Colored Bin Packing
• Wolfgang Dvořák and Monika Henzinger
  Online Ad Assignment with an Ad Exchange
• Tomasz Jurdzinski, Dariusz Kowalski and Krzysztof Lorys
  Online Packet Scheduling under Adversarial Jamming
• Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs and Michele Scquizzato
  A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
• Rudolf Scheifele
  Steiner Trees with Bounded RC-Delay
• Martin Böhm, Jiří Sgall, Rob van Stee and Pavel Veselý
  Better Algorithms for Online Bin Stretching
• Guilherme D. Da Fonseca, Vinícius G. Pereira de Sá and Celina M. H. de Figueiredo
  Linear-Time Approximation Algorithms for Unit Disk Graphs
• Ojas Parekh and David Pritchard
  Generalized Hypergraph Matching via Iterated Packing and Local Ratio