| 2026 | Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting. | Tatiana Rocha Avila, Lars Rohwedder, Leo Wennmann |
| 2026 | Exact Ratio Preservation via Outliers for Fair k-Center Clustering. | Anna Arutyunova, Irina Fast, Annika Hennes, Carsten Krollmann, Daniel R. Schmidt, Melanie Schmidt |
| 2026 | A 0.8395-Approximation Algorithm for the EPR Problem. | Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, Lennart Sinjorgo, James Sud |
| 2026 | String Matching in (Block) Graphs: A Full Classification by Walk Length. | Sebastian Angrick, Ben Bals, Pawel Gawrychowski, Solon P. Pissis, Yuki Yonemoto |
| 2026 | Symmetry-Preserving Graph Compression. | Markus Anders, Manuel Penschuck, Pascal Schweitzer |
| 2026 | Sliding Cubes in Parallel. | Hugo A. Akitaya, Joseph Dorfer, Peter Kramer, Christian Rieck, Gabriel Shahrouzi, Frederick Stock |
| 2026 | Computational Boundaries for Escaping Rectangles. | Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia |
| 2026 | Fast Algorithms for Continuous Optimal Transport Between Histograms. | Pankaj K. Agarwal, Sharath Raghvendra, Keegan Yao |
| 2026 | Triangle Nearest-Neighbor Searching in 3-Space. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2026 | A General Reduction from Near-Additive Emulators to Near-Exact Hopsets. | Julian Aeri, Sebastian Forster, Mara Grilnberger |
| 2026 | Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs. | Amir Abboud, Ron Safier, Nathan Wallheimer |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | A Simple yet Exact Analysis of the MultiQueue. | Stefan Walzer, Marvin Williams |
| 2025 | A Unified FPT Framework for Crossing Number Problems. | ric Colin de Verdire, Petr Hlinen |
| 2025 | Weighted Matching in a Poly-Streaming Model. | Ahammed Ullah, S. M. Ferdous, Alex Pothen |
| 2025 | Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. | Jack Spalding-Jamieson, Anurag Murty Naredla |
| 2025 | Safe Sequences via Dominators in DAGs for Path-Covering Problems. | Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu |
| 2025 | On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms. | Jens Schlter |
| 2025 | PLS-Completeness of String Permutations. | Dominik Scheder, Johannes Tantow |
| 2025 | Semi-Streaming Algorithms for Hypergraph Matching. | Henrik Reinstdtler, S. M. Ferdous, Alex Pothen, Bora Uar, Christian Schulz |
| 2025 | Computing Largest Subsets of Points Whose Convex Hulls Have Bounded Area and Diameter. | Gianmarco Picarella, Marc J. van Kreveld, Frank Staals, Sjoerd de Vries |
| 2025 | Fast and Memory-Efficient BWT Construction of Repetitive Texts Using Lyndon Grammars. | Jannik Olbrich |
| 2025 | Bicriteria Approximation for k-Edge-Connectivity. | Zeev Nutov, Reut Cohen |
| 2025 | Connected Partitions via Connected Dominating Sets. | Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif |
| 2025 | Polynomial-Time Constant-Approximation for Fair Sum-Of-Radii Clustering. | Sina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen |