| 2022 | Hardness of Token Swapping on Trees. | Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masrov, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries. | Raghavendra Addanki, Andrew McGregor, Cameron Musco |
| 2022 | Enumerating Minimal Connected Dominating Sets. | Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann |
| 2022 | Optimizing Safe Flow Decompositions in DAGs. | Shahbaz Khan, Alexandru I. Tomescu |
| 2022 | Distinct Elements in Streams: An Algorithm for the (Text) Book. | Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel |
| 2022 | Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. | Jiehua Chen, Sanjukta Roy |
| 2022 | Online Metric Allocation and Time-Varying Regularization. | Nikhil Bansal, Christian Coester |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2021 | Evidence for Long-Tails in SLS Algorithms. | Florian Wrz, Jan-Hendrik Lorenz |
| 2021 | Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. | Marvin Williams, Peter Sanders, Roman Dementiev |
| 2021 | A General Framework for Enumerating Equivalence Classes of Solutions. | Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri |
| 2021 | An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. | ric Colin de Verdire, Thomas Magnard |
| 2021 | Restricted Adaptivity in Stochastic Scheduling. | Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt |
| 2021 | Hardness of Detecting Abelian and Additive Square Factors in Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2021 | Faster Deterministic Modular Subset Sum. | Krzysztof Potepa |
| 2021 | Additive Sparsification of CSPs. | Eden Pelleg, Stanislav Zivn |
| 2021 | Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. | Ojas Parekh, Kevin Thompson |
| 2021 | Isomorphism Testing Parameterized by Genus and Beyond. | Daniel Neuen |
| 2021 | Determining 4-Edge-Connected Components in Linear Time. | Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski |
| 2021 | Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. | J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild |
| 2021 | Generalized Max-Flows and Min-Cuts in Simplicial Complexes. | William Maxwell, Amir Nayyeri |
| 2021 | A Simple Algorithm for Graph Reconstruction. | Claire Mathieu, Hang Zhou |
| 2021 | FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. | Toms Martnez-Muoz, Andreas Wiese |
| 2021 | Extension of Additive Valuations to General Valuations on the Existence of EFX. | Ryoga Mahara |
| 2021 | The Visibility Center of a Simple Polygon. | Anna Lubiw, Anurag Murty Naredla |