| 2023 | Faster Detours in Undirected Graphs. | Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu |
| 2023 | Reconfiguration of Polygonal Subdivisions via Recombination. | Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tth, Thomas Weighill |
| 2023 | Smooth Distance Approximation. | Ahmed Abdelkader, David M. Mount |
| 2023 | What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? | Amir Abboud, Shay Mozes, Oren Weimann |
| 2023 | Can You Solve Closest String Faster Than Exhaustive Search? | Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier |
| 2023 | On Diameter Approximation in Directed Graphs. | Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2023 | Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences. | Ming Ding, Peng Zhang |
| 2023 | Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). | Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | Improved Algorithms for Distance Selection and Related Problems. | Haitao Wang, Yiming Zhao |
| 2023 | Threshold Testing and Semi-Online Prophet Inequalities. | Martin Hoefer, Kevin Schewior |
| 2023 | Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. | Eunjin Oh, Seunghyeok Oh |
| 2023 | Enumerating Maximal Induced Subgraphs. | Yixin Cao |
| 2023 | Simple Deterministic Approximation for Submodular Multiple Knapsack Problem. | Xiaoming Sun, Jialin Zhang, Zhijie Zhang |
| 2023 | Canonization of a Random Graph by Two Matrix-Vector Multiplications. | Oleg Verbitsky, Maksim Zhukovskii |
| 2022 | Faster Algorithm for Unique (k, 2)-CSP. | Or Zamir |
| 2022 | Correlated Stochastic Knapsack with a Submodular Objective. | Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik |
| 2022 | Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. | Zoe Xi, William Kuszmaul |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2022 | Combining Predicted and Live Traffic with Time-Dependent A* Potentials. | Nils Werner, Tim Zeitz |
| 2022 | ParGeo: A Library for Parallel Computational Geometry. | Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun |
| 2022 | Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. | Stefan Walzer |
| 2022 | Fast RSK Correspondence by Doubling Search. | Alexander Tiskin |
| 2022 | An Improved Algorithm for Finding the Shortest Synchronizing Words. | Marek Szykula, Adam Zyzik |
| 2022 | An Empirical Evaluation of k-Means Coresets. | Chris Schwiegelshohn, Omar Ali Sheikh-Omar |
| 2022 | Improved Bounds for Online Balanced Graph Re-Partitioning. | Rajmohan Rajaraman, Omer Wasim |