| 2021 | Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers Christos Kaklamanis, Asaf Levin |
| 2020 | 2-Node-Connectivity Network Design. Zeev Nutov |
| 2020 | A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. Raghunath Reddy Madireddy, Apurva Mudgal |
| 2020 | A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. Stav Ashur, Omrit Filtser, Matthew J. Katz |
| 2020 | A Faster FPTAS for Knapsack Problem with Cardinality Constraint. Wenxin Li, Joohyun Lee, Ness B. Shroff |
| 2020 | An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. Ardalan Khazraei, Stephan Held |
| 2020 | Concave Connection Cost Facility Location and the Star Inventory Routing Problem. Jaroslaw Byrka, Mateusz Lewandowski |
| 2020 | Distributed Algorithms for Matching in Hypergraphs. Oussama Hanguir, Clifford Stein |
| 2020 | Explorable Uncertainty in Scheduling with Non-uniform Testing Times. Susanne Albers, Alexander Eckl |
| 2020 | LP-Based Algorithms for Multistage Minimization Problems. Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov |
| 2020 | Lasserre Integrality Gaps for Graph Spanners and Related Problems. Michael Dinitz, Yasamin Nazari, Zeyu Zhang |
| 2020 | Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. Guido Schäfer, Bernard G. Zweers |
| 2020 | Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos |
| 2020 | Online Coloring and a New Type of Adversary for Online Graph Problems. Yaqiao Li, Vishnu V. Narayan, Denis Pankratov |
| 2020 | Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan |
| 2020 | To Close Is Easier Than To Open: Dual Parameterization To k-Median. Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk |