| 2025 | (Multivariate) k-SUM as Barrier to Succinct Computation. Geri Gokaj, Marvin Künnemann, Sabine Storandt, Carina Truschel |
| 2025 | 33rd Annual European Symposium on Algorithms, ESA 2025, Warsaw, Poland, September 15-17, 2025 Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman |
| 2025 | A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs. Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk |
| 2025 | A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann |
| 2025 | A Deterministic Partition Tree and Applications. Haitao Wang |
| 2025 | A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees. Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen |
| 2025 | A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem. Saman Ahmadi, Andrea Raith, Mahdi Jalili |
| 2025 | A Faster Parametric Search for the Integral Quickest Transshipment Problem. Mariia Anapolska, Dario van den Boom, Christina Büsing, Timo Gersing |
| 2025 | A Simple Algorithm for Trimmed Multipoint Evaluation. Nick Fischer, Melvin Kallmayer, Leo Wennmann |
| 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 Verdière, Petr Hlinený |
| 2025 | An Improved Bound for Plane Covering Paths. Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous |
| 2025 | An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk Graphs. Mark de Berg, Sergio Cabello |
| 2025 | An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs. Bruce W. Brewer, Haitao Wang |
| 2025 | Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. David Eppstein, Michael T. Goodrich, Songyu Liu |
| 2025 | Beating Competitive Ratio 4 for Graphic Matroid Secretary. Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski |
| 2025 | Beeping Deterministic CONGEST Algorithms in Graphs. Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro |
| 2025 | Better Indexing for Rectangular Pattern Matching. Pawel Gawrychowski, Adam Górkiewicz |
| 2025 | Bicriteria Approximation for k-Edge-Connectivity. Zeev Nutov, Reut Cohen |
| 2025 | Bootstrapping Dynamic APSP via Sparsification. Rasmus Kyng, Simon Meierhans, Gernot Zöcklein |
| 2025 | Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. Itai Boneh, Egor Gorbachev, Tomasz Kociumaka |
| 2025 | Buffered Partially-Persistent External-Memory Search Trees. Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning |
| 2025 | Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians. François Le Gall |
| 2025 | Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions. Noam Horowicz, Tsvi Kopelowitz |
| 2025 | Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler |
| 2025 | Compact Representation of Semilinear and Terrain-Like Graphs. Jean Cardinal, Yelena Yuditsky |
| 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 | Connected Partitions via Connected Dominating Sets. Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, Ziena Zeif |
| 2025 | Connected k-Median with Disjoint and Non-Disjoint Clusters. Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt |
| 2025 | Constructing Long Paths in Graph Streams. Christian Konrad, Chhaya Trehan |
| 2025 | Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka |
| 2025 | Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. Radu Curticapean, Simon Döring, Daniel Neuen |
| 2025 | Courcelle's Theorem for Lipschitz Continuity. Tatsuya Gima, Soh Kumabe, Yuichi Yoshida |
| 2025 | Cut-Query Algorithms with Few Rounds. Yotam Kenneth-Mordoch, Robert Krauthgamer |
| 2025 | Deterministic Approximation Algorithm for Graph Burning. Matej Lieskovský |
| 2025 | Edge Clique Partition and Cover Beyond Independence. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2025 | Efficiency of Learned Indexes on Genome Spectra. Md. Hasin Abrar, Paul Medvedev, Giorgio Vinciguerra |
| 2025 | Efficient Contractions of Dynamic Graphs - With Applications. Monika Henzinger, Evangelos Kosinas, Robin Münk, Harald Räcke |
| 2025 | Efficient Top-Down Updates in AVL Trees. Vincent Jugé |
| 2025 | Engineering Minimal k-Perfect Hash Functions. Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2025 | External-Memory Priority Queues with Optimal Insertions. Gerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2025 | Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares. Yuto Nakashima, Jakub Radoszewski, Tomasz Walen |
| 2025 | Fast Gaussian Elimination for Low Treewidth Matrices. Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
| 2025 | Fast and Lightweight Distributed Suffix Array Construction. Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek |
| 2025 | Fast and Memory-Efficient BWT Construction of Repetitive Texts Using Lyndon Grammars. Jannik Olbrich |
| 2025 | Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. Tomasz Kociumaka, Ali Shahali |
| 2025 | Faster Algorithm for Second (s, t)-Mincut and Breaking Quadratic Barrier for Dual Edge Sensitivity for (s, t)-Mincut. Surender Baswana, Koustav Bhanja, Anupam Roy |
| 2025 | Faster Dynamic 2-Edge Connectivity in Directed Graphs. Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano |
| 2025 | Faster Exponential Algorithms for Cut Problems via Geometric Data Structures. László Kozma, Junqi Tan |
| 2025 | Fault-Tolerant Matroid Bases. Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2025 | Fine-Grained Classification of Detecting Dominating Patterns. Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic |
| 2025 | From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. Ernestine Großmann, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Ivor van der Hoog, Juliette Vlieghe |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Fréchet Distance in Unweighted Planar Graphs. Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf |
| 2025 | Generalized Graph Packing Problems Parameterized by Treewidth. Baris Can Esmer, Dániel Marx |
| 2025 | Going Beyond Surfaces in Diameter Approximation. Michal Wlodarczyk |
| 2025 | Graph Decompositions and Length-Constrained Expanders (Invited Talk). Bernhard Haeupler |
| 2025 | Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
| 2025 | Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted Topology. Henrique Ennes, Clément Maria |
| 2025 | Hardness of Median and Center in the Ulam Metric. Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S. |
| 2025 | Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings. Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud |
| 2025 | Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets. Konstantinos Karathanasis, Spyros C. Kontogiannis, Christos D. Zaroliagis |
| 2025 | Improved Hardness-Of-Approximation for Token-Swapping. Sam Hiken, Nicole Wein |
| 2025 | Improved Parallel Derandomization via Finite Automata with Applications. Jeff Giliberti, David G. Harris |
| 2025 | Incremental Maximization for a Broad Class of Objectives. Yann Disser, David Weckbecker |
| 2025 | Instance-Optimal Imprecise Convex Hull. Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong |
| 2025 | Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms. Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan |
| 2025 | Linear-Time Multilevel Graph Partitioning via Edge Sparsification. Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier |
| 2025 | Max-Distance Sparsification for Diversification and Clustering. Soh Kumabe |
| 2025 | Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi |
| 2025 | Min-Max Correlation Clustering via Neighborhood Similarity. Nairen Cao, Steven Roche, Hsin-Hao Su |
| 2025 | MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing. Stefan Hermann |
| 2025 | Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern. Florian Hörsch, Dániel Marx |
| 2025 | Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism. Laxman Dhulipala, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, Leqi Zhu |
| 2025 | Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity. Koustav Bhanja, Asaf Petruschka |
| 2025 | New Algorithms for Pigeonhole Equal Subset Sum. Ce Jin, Ryan Williams, Stan Zhang |
| 2025 | Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. Bingbing Hu, Adam Polak |
| 2025 | On Algorithmic Applications of ℱ-Branchwidth. Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima |
| 2025 | On Estimating the Quantum 𝓁 Yupan Liu, Qisheng Wang |
| 2025 | On Finding 𝓁-Th Smallest Perfect Matchings. Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf |
| 2025 | On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. Umang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, Britta Peis, Laura Vargas Koch |
| 2025 | On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms. Jens Schlöter |
| 2025 | On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses. Ioannis Caragiannis, Nick Gravin, Zhile Jiang |
| 2025 | Online Hitting Sets for Disks of Bounded Radii. Minati De, Satyam Singh, Csaba D. Tóth |
| 2025 | Online Makespan Scheduling Under Scenarios. Ekin Ergen |
| 2025 | Online Metric TSP. Christian Bertram |
| 2025 | Optimal Antimatroid Sorting. Benjamin Aram Berendsohn |
| 2025 | Optimal Quantum Algorithm for Estimating Fidelity to a Pure State. Wang Fang, Qisheng Wang |
| 2025 | PLS-Completeness of String Permutations. Dominik Scheder, Johannes Tantow |
| 2025 | Parameterized Algorithms for Computing Pareto Sets. Joshua Könen, Heiko Röglin, Tarek Stuck |
| 2025 | Parameterized Approximability for Modular Linear Equations. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström |
| 2025 | Polynomial-Time Constant-Approximation for Fair Sum-Of-Radii Clustering. Sina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen |
| 2025 | Property Testing of Curve Similarity. Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter, Sampson Wong |
| 2025 | Quantum Approximate k-Minimum Finding. Minbo Gao, Zhengfeng Ji, Qisheng Wang |
| 2025 | Recognizing and Realizing Temporal Reachability Graphs. Thomas Erlebach, Othon Michail, Nils Morawietz |
| 2025 | Reconstructing Random Graphs from Distance Queries. Michael Krivelevich, Maksim Zhukovskii |
| 2025 | Safe Sequences via Dominators in DAGs for Path-Covering Problems. Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu |
| 2025 | Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk). Monika Henzinger, Roodabeh Safavi |
| 2025 | Semi-Streaming Algorithms for Hypergraph Matching. Henrik Reinstädtler, S. M. Ferdous, Alex Pothen, Bora Uçar, Christian Schulz |
| 2025 | Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. Jack Spalding-Jamieson, Anurag Murty Naredla |
| 2025 | Simpler Universally Optimal Dijkstra. Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann |
| 2025 | Sliding Squares in Parallel. Hugo A. Akitaya, Sándor P. Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock, Tobias Wallner |
| 2025 | Smoothed Analysis of Online Metric Problems. Christian Coester, Jack Umenberger |
| 2025 | Streaming Diameter of High-Dimensional Points. Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý |
| 2025 | Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better. Jacobus Conradi, Anne Driemel |
| 2025 | Testing Depth First Search Numbering. Artur Czumaj, Christian Sohler, Stefan Walzer |
| 2025 | Testing Sumsets Is Hard. Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir |
| 2025 | The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon. Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann |
| 2025 | The Planted Orthogonal Vectors Problem. David Kühnemann, Adam Polak, Alon Rosen |
| 2025 | The Support of Bin Packing Is Exponential. Klaus Jansen, Lis Pirotton, Malte Tutas |
| 2025 | The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration. Nicolas Bousquet, Quentin Deschamps, Arnaud Mary, Amer E. Mouawad, Théo Pierron |
| 2025 | Tight Bounds for Some Classical Problems Parameterized by Cutwidth. Narek Bojikian, Vera Chekan, Stefan Kratsch |
| 2025 | Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. Nikhil Kumar, J. J. Nan, Chaitanya Swamy |
| 2025 | Tolerant Testers for Subgraph-Freeness. Reut Levi, Jonathan Meiri |
| 2025 | Weighted Matching in a Poly-Streaming Model. Ahammed Ullah, S. M. Ferdous, Alex Pothen |
| 2025 | When Is String Reconstruction Using de Bruijn Graphs Hard? Ben Bals, Sebastiaan van Krieken, Solon P. Pissis, Leen Stougie, Hilde Verbeek |
| 2025 | ε-Net Algorithm Implementation on Hyperbolic Surfaces. Vincent Despré, Camille Lanuel, Marc Pouget, Monique Teillaud |