| 2025 | Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. | Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
| 2025 | On Finding 𝓁-Th Smallest Perfect Matchings. | Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf |
| 2025 | On Estimating the Quantum 𝓁 | Yupan Liu, Qisheng Wang |
| 2025 | Deterministic Approximation Algorithm for Graph Burning. | Matej Lieskovsk |
| 2025 | Tolerant Testers for Subgraph-Freeness. | Reut Levi, Jonathan Meiri |
| 2025 | Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler |
| 2025 | Bootstrapping Dynamic APSP via Sparsification. | Rasmus Kyng, Simon Meierhans, Gernot Zcklein |
| 2025 | Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. | Nikhil Kumar, J. J. Nan, Chaitanya Swamy |
| 2025 | Max-Distance Sparsification for Diversification and Clustering. | Soh Kumabe |
| 2025 | The Planted Orthogonal Vectors Problem. | David Khnemann, Adam Polak, Alon Rosen |
| 2025 | Reconstructing Random Graphs from Distance Queries. | Michael Krivelevich, Maksim Zhukovskii |
| 2025 | Parameterized Algorithms for Computing Pareto Sets. | Joshua Knen, Heiko Rglin, Tarek Stuck |
| 2025 | Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. | Tomasz Kociumaka, Ali Shahali |
| 2025 | Cut-Query Algorithms with Few Rounds. | Yotam Kenneth-Mordoch, Robert Krauthgamer |
| 2025 | Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets. | Konstantinos Karathanasis, Spyros C. Kontogiannis, Christos D. Zaroliagis |
| 2025 | Efficient Top-Down Updates in AVL Trees. | Vincent Jug |
| 2025 | The Support of Bin Packing Is Exponential. | Klaus Jansen, Lis Pirotton, Malte Tutas |
| 2025 | Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. | Bingbing Hu, Adam Polak |
| 2025 | The Geodesic Frchet Distance Between Two Curves Bounding a Simple Polygon. | Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann |
| 2025 | Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern. | Florian Hrsch, Dniel Marx |
| 2025 | Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions. | Noam Horowicz, Tsvi Kopelowitz |
| 2025 | A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. | Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann |
| 2025 | Simpler Universally Optimal Dijkstra. | Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann |
| 2025 | Frchet Distance in Unweighted Planar Graphs. | Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf |
| 2025 | Improved Hardness-Of-Approximation for Token-Swapping. | Sam Hiken, Nicole Wein |