| 2022 | Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter |
| 2022 | An Improved Algorithm for Open Online Dial-a-Ride. Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker |
| 2022 | Approximating Length-Restricted Means Under Dynamic Time Warping. Maike Buchin, Anne Driemel, Koen van Greevenbroek, Ioannis Psarros, Dennis Rohde |
| 2022 | Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings Parinya Chalermsook, Bundit Laekhanukit |
| 2022 | Canadian Traveller Problem with Predictions. Evripidis Bampis, Bruno Escoffier, Michalis Xefteris |
| 2022 | Graph Burning and Non-uniform k-centers for Small Treewidth. Matej Lieskovský, Jirí Sgall |
| 2022 | Knapsack Secretary Through Boosting. Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer |
| 2022 | Locating Service and Charging Stations. Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur |
| 2022 | On Streaming Algorithms for Geometric Independent Set and Clique. Sujoy Bhore, Fabian Klute, Jelle J. Oostveen |
| 2022 | Scheduling Appointments Online: The Power of Deferred Decision-Making. Devin Smedira, David B. Shmoys |
| 2022 | Scheduling with Machine Conflicts. Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt |
| 2022 | Stochastic Graph Exploration with Limited Resources. Ilan Reuven Cohen |
| 2022 | The Power of Amortized Recourse for Online Graph Problems. Alison Hsiang-Hsuan Liu, Jonathan Toole-Charignon |