| 2025 | A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words. | Philippe Schnoebelen, Julien Veron, Isa Vialard |
| 2025 | An Upper Bound on the Weisfeiler-Leman Dimension. | Thomas Schneider, Pascal Schweitzer |
| 2025 | Let's Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk). | Dana Ron |
| 2025 | 3.415-Approximation for Coflow Scheduling via Iterated Rounding. | Lars Rohwedder, Leander Schnaars |
| 2025 | Cost Preserving Dependent Rounding for Allocation Problems. | Lars Rohwedder, Arman Rouhani, Leo Wennmann |
| 2025 | ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines. | Lars Rohwedder |
| 2025 | First-Order Intuitionistic Linear Logic and Hypergraph Languages. | Tikhon Pshenitsyn |
| 2025 | Unbalanced Random Matching Markets with Partial Preferences. | Aditya Potukuchi, Shikha Singh |
| 2025 | Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2025 | New and Improved Bounds for Markov Paging. | Chirag Pabbaraju, Ali Vakilian |
| 2025 | Yet Another Simple Proof of the PCRP Theorem. | Naoto Ohsaka |
| 2025 | Maximum Bipartite vs. Triangle-Free Subgraph. | Tamio-Vesa Nakajima, Stanislav Zivn |
| 2025 | Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. | Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivn |
| 2025 | Treewidth Parameterized by Feedback Vertex Number. | Hendrik Molter, Meirav Zehavi, Amit Zivan |
| 2025 | Faster Semi-Streaming Matchings via Alternating Trees. | Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu |
| 2025 | P-Time Algorithms for Typical #EO Problems. | Boning Meng, Juqiu Wang, Mingji Xia |
| 2025 | Incremental Approximate Single-Source Shortest Paths with Predictions. | Samuel McCauley, Benjamin Moseley, Aidin Niaparast, Helia Niaparast, Shikha Singh |
| 2025 | Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications. | Gianluca De Marco, Dariusz R. Kowalski |
| 2025 | Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO. | Nikolas Mhlmann |
| 2025 | A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. | Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski |
| 2025 | Nearly Optimal Circuit Size for Sparse Quantum State Preparation. | Lvzhou Li, Jingquan Luo |
| 2025 | Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. | Moritz Lichter, Benedikt Pago |
| 2025 | Optimal Static Fully Indexable Dictionaries. | Jingxun Liang, Renfei Zhou |
| 2025 | Algebraic Language Theory with Effects. | Fabian Lenke, Stefan Milius, Henning Urbat, Thorsten Wimann |
| 2025 | A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks. | Karoliina Lehtinen, Nathan Lhote |