| 2025 | Engineering Minimal k-Perfect Hash Functions. | Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2025 | MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing. | Stefan Hermann |
| 2025 | Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk). | Monika Henzinger, Roodabeh Safavi |
| 2025 | Efficient Contractions of Dynamic Graphs - With Applications. | Monika Henzinger, Evangelos Kosinas, Robin Mnk, Harald Rcke |
| 2025 | Streaming Diameter of High-Dimensional Points. | Magns M. Halldrsson, Nicolaos Matsakis, Pavel Vesel |
| 2025 | Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | Graph Decompositions and Length-Constrained Expanders (Invited Talk). | Bernhard Haeupler |
| 2025 | Fast and Lightweight Distributed Suffix Array Construction. | Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek |
| 2025 | From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. | Ernestine Gromann, Henrik Reinstdtler, Eva Rotenberg, Christian Schulz, Ivor van der Hoog, Juliette Vlieghe |
| 2025 | Linear-Time Multilevel Graph Partitioning via Edge Sparsification. | Lars Gottesbren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier |
| 2025 | (Multivariate) k-SUM as Barrier to Succinct Computation. | Geri Gokaj, Marvin Knnemann, Sabine Storandt, Carina Truschel |
| 2025 | Courcelle's Theorem for Lipschitz Continuity. | Tatsuya Gima, Soh Kumabe, Yuichi Yoshida |
| 2025 | Improved Parallel Derandomization via Finite Automata with Applications. | Jeff Giliberti, David G. Harris |
| 2025 | Faster Dynamic 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano |
| 2025 | Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. | Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka |
| 2025 | Better Indexing for Rectangular Pattern Matching. | Pawel Gawrychowski, Adam Grkiewicz |
| 2025 | Beeping Deterministic CONGEST Algorithms in Graphs. | Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro |
| 2025 | Quantum Approximate k-Minimum Finding. | Minbo Gao, Zhengfeng Ji, Qisheng Wang |
| 2025 | Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians. | Franois Le Gall |
| 2025 | Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. | Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi |
| 2025 | A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees. | Emil Toftegaard Gde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen |
| 2025 | Fast Gaussian Elimination for Low Treewidth Matrices. | Martin Frer, Carlos Hoppen, Vilmar Trevisan |
| 2025 | Edge Clique Partition and Cover Beyond Independence. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2025 | A Simple Algorithm for Trimmed Multipoint Evaluation. | Nick Fischer, Melvin Kallmayer, Leo Wennmann |
| 2025 | Hardness of Median and Center in the Ulam Metric. | Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S. |