| | | | |
| | | | | | |
- Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik and Patrick Lin. Scenario Submodular Cover
| | | | | |
| | |
- Gramoz Goranci and Harald Räcke. Vertex Sparsification in Trees
| | | | | | | | |
- Khaled Elbassioni, Kazuhisa Makino and Waleed Najy. A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs
| |
| | | | | |
- Esther Arkin, Jie Gao, Adam Hesterberg, Joseph Mitchell and Jiemin Zeng. The Shortest Separating Cycle Problem
| | | | |
- André Berger, Alexander Grigoriev and Andrej Winokurow. A PTAS for the Cluster Editing Problem on Planar Graphs
| | | | |
- Joan Boyar, Leah Epstein, Lene Favrholdt, Kim S. Larsen and Asaf Levin. Batch Coloring of Graphs
| | | | | |
- Akira Matsubayashi. Non-Greedy Online Steiner Trees on Outerplanar Graphs
| | | | | | | |
- Parinya Chalermsook and Daniel Vaz. New Integrality Gap Results for the Firefighters Problem on Trees
| | | | | |
- Martijn van Ee, Leo van Iersel, Teun Janssen and Rene Sitters. A priori TSP in the scenario model
| | | | | | |
| | | | | | |
- Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes and Vassilis Zissimopoulos. Bin packing with colocations
|
- N.S. Narayanaswamy and Astha Chauhan. A Refined Analysis of Online Path Coloring in Trees
| | | | | | |
