Abstract is missing.
- Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and TerrainsStav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban. 1-17 [doi]
- A New Lower Bound for Classic Online Bin PackingJános Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin. 18-28 [doi]
- Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-CutsPierre Bergé, Lou Salaün. 29-42 [doi]
- Robust Online Algorithms for Certain Dynamic Packing ProblemsSebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof. 43-59 [doi]
- Approximation Results for Makespan Minimization with Budgeted UncertaintyMarin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. 60-71 [doi]
- Streaming Algorithms for Bin Packing and Vector SchedulingGraham Cormode, Pavel Veselý. 72-88 [doi]
- An Improved Upper Bound for the Ring Loading ProblemKarl Däubel. 89-105 [doi]
- Parallel Online Algorithms for the Bin Packing ProblemSándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt 0001. 106-119 [doi]
- Managing Multiple Mobile ResourcesBjörn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide. 120-137 [doi]
- On the Cycle Augmentation Problem: Hardness and Approximation AlgorithmsWaldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Krzysztof Sornat. 138-153 [doi]
- Approximate Strong Edge-Colouring of Unit Disk GraphsNicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot. 154-169 [doi]
- Precedence-Constrained Scheduling and Min-Sum Set CoverFelix Happach, Andreas S. Schulz. 170-187 [doi]
- Fault Tolerant Clustering with OutliersTanmay Inamdar 0002, Kasturi Varadarajan. 188-201 [doi]
- Improved (In-)Approximability Bounds for d-Scattered SetIoannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos. 202-216 [doi]
- Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size JobsFu-Hong Liu, Hsiang Hsuan Liu, Prudence W. H. Wong. 217-231 [doi]
- Fair Coresets and Streaming Algorithms for Fair k-meansMelanie Schmidt 0001, Chris Schwiegelshohn, Christian Sohler. 232-251 [doi]