| 2025 | Connected k-Median with Disjoint and Non-Disjoint Clusters. | Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Rglin, Melanie Schmidt |
| 2025 | Generalized Graph Packing Problems Parameterized by Treewidth. | Baris Can Esmer, Dniel Marx |
| 2025 | Recognizing and Realizing Temporal Reachability Graphs. | Thomas Erlebach, Othon Michail, Nils Morawietz |
| 2025 | Online Makespan Scheduling Under Scenarios. | Ekin Ergen |
| 2025 | Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. | David Eppstein, Michael T. Goodrich, Songyu Liu |
| 2025 | Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted Topology. | Henrique Ennes, Clment Maria |
| 2025 | Fine-Grained Classification of Detecting Dominating Patterns. | Jonathan Dransfeld, Marvin Knnemann, Mirza Redzic |
| 2025 | Incremental Maximization for a Broad Class of Objectives. | Yann Disser, David Weckbecker |
| 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 | ε-Net Algorithm Implementation on Hyperbolic Surfaces. | Vincent Despr, Camille Lanuel, Marc Pouget, Monique Teillaud |
| 2025 | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms. | Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan |
| 2025 | Online Hitting Sets for Disks of Bounded Radii. | Minati De, Satyam Singh, Csaba D. Tth |
| 2025 | Parameterized Approximability for Modular Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2025 | Testing Depth First Search Numbering. | Artur Czumaj, Christian Sohler, Stefan Walzer |
| 2025 | Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. | Radu Curticapean, Simon Dring, Daniel Neuen |
| 2025 | Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better. | Jacobus Conradi, Anne Driemel |
| 2025 | Smoothed Analysis of Online Metric Problems. | Christian Coester, Jack Umenberger |
| 2025 | Compact Representation of Semilinear and Terrain-Like Graphs. | Jean Cardinal, Yelena Yuditsky |
| 2025 | On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses. | Ioannis Caragiannis, Nick Gravin, Zhile Jiang |
| 2025 | Min-Max Correlation Clustering via Neighborhood Similarity. | Nairen Cao, Steven Roche, Hsin-Hao Su |
| 2025 | Buffered Partially-Persistent External-Memory Search Trees. | Gerth Stlting Brodal, Casper Moldrup Rysgaard, Rolf Svenning |
| 2025 | External-Memory Priority Queues with Optimal Insertions. | Gerth Stlting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2025 | An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs. | Bruce W. Brewer, Haitao Wang |
| 2025 | Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. | Itai Boneh, Egor Gorbachev, Tomasz Kociumaka |
| 2025 | Tight Bounds for Some Classical Problems Parameterized by Cutwidth. | Narek Bojikian, Vera Chekan, Stefan Kratsch |