| 2025 | Online Matching with Delays and Size-Based Costs. | Yasushi Kawase, Tomohiro Nakayoshi |
| 2025 | Violating Constant Degree Hypothesis Requires Breaking Symmetry. | Piotr Kawalek, Armin Wei |
| 2025 | Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. | Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Rglin |
| 2025 | Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs. | Julia Katheder, Michael Kaufmann, Sergey Pupyrev, Torsten Ueckerdt |
| 2025 | Modal Separation of Fixpoint Formulae. | Jean Christoph Jung, Jedrzej Kolodziejski |
| 2025 | Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer. | Stacey Jeffery, Galina Pass |
| 2025 | On Read-k Projections of the Determinant. | Pavel Hrubes, Pushkar S. Joglekar |
| 2025 | Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. | Shane Bel Houari-Durand, Eduard Eiben, Magnus Wahlstrm |
| 2025 | Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures. | Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang |
| 2025 | Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs. | Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya |
| 2025 | Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. | Klaus Heeger, Hendrik Molter |
| 2025 | Sampling Unlabeled Chordal Graphs in Expected Polynomial Time. | rsula Hbert-Johnson, Daniel Lokshtanov |
| 2025 | Forbidden Patterns in Mixed Linear Layouts. | Deborah Haun, Laura Merker, Sergey Pupyrev |
| 2025 | Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances. | Tim A. Hartmann, Dniel Marx |
| 2025 | Approximating Densest Subgraph in Geometric Intersection Graphs. | Sariel Har-Peled, Saladi Rahul |
| 2025 | Local Enumeration: The Not-All-Equal Case. | Mohit Gurumukhani, Ramamohan Paturi, Michael Saks, Navid Talebanfard |
| 2025 | Residue Domination in Bounded-Treewidth Graphs. | Jakob Greilhuber, Philipp Schepper, Philip Wellnitz |
| 2025 | A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs. | Ebrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich |
| 2025 | On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number. | Jorge Gallego-Hernndez, Alessio Mansutti |
| 2025 | MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma |
| 2025 | Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. | Ameet Gadekar, Tanmay Inamdar |
| 2025 | Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. | Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz |
| 2025 | Metric Dimension and Geodetic Set Parameterized by Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2025 | A Faster Algorithm for Constrained Correlation Clustering. | Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup |
| 2025 | Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines. | Leah Epstein, Asaf Levin |