Abstract is missing.
- The Shortest Separating Cycle ProblemEsther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng. 1-13 [doi]
- Dynamic Traveling Repair Problem with an Arbitrary Time WindowYossi Azar, Adi Vardi. 14-26 [doi]
- A PTAS for the Cluster Editing Problem on Planar GraphsAndré Berger, Alexander Grigoriev, Andrej Winokurow. 27-39 [doi]
- Bin Packing with ColocationsJean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos. 40-51 [doi]
- Batch Coloring of GraphsJoan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin. 52-64 [doi]
- New Integrality Gap Results for the Firefighters Problem on TreesParinya Chalermsook, Daniel Vaz. 65-77 [doi]
- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear ProgramsKhaled M. Elbassioni, Kazuhisa Makino, Waleed Najy. 78-91 [doi]
- Balanced Optimization with Vector CostsAnnette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger. 92-102 [doi]
- Vertex Sparsification in TreesGramoz Goranci, Harald Räcke. 103-115 [doi]
- Scenario Submodular CoverNathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin 0001. 116-128 [doi]
- Non-greedy Online Steiner Trees on Outerplanar GraphsAkira Matsubayashi. 129-141 [doi]
- A Refined Analysis of Online Path Coloring in TreesAstha Chauhan, N. S. Narayanaswamy. 142-154 [doi]
- Resource Allocation Games with Multiple Resource ClassesRoy B. Ofer, Tami Tamir. 155-169 [doi]
- Tight Approximation Bounds for the Seminar Assignment ProblemAmotz Bar-Noy, George Rabanca. 170-182 [doi]
- A priori TSP in the Scenario ModelMartijn van Ee, Leo van Iersel, Teun Janssen, René Sitters. 183-196 [doi]
- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location ProblemsFelix J. L. Willamowski, Andreas Bley. 197-209 [doi]