| 2025 | The Value Problem for Multiple-Environment MDPs with Parity Objective. | Krishnendu Chatterjee, Laurent Doyen, Jean-Franois Raskin, Ocan Sankur |
| 2025 | Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. | Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi |
| 2025 | Scarf's Algorithm on Arborescence Hypergraphs. | Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, Jay Sethuraman |
| 2025 | Online Disjoint Spanning Trees and Polymatroid Bases. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu |
| 2025 | On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni |
| 2025 | The Memory of ω-Regular and BC(Σ⁰₂) Objectives. | Antonio Casares, Pierre Ohlmann |
| 2025 | Fitting Tree Metrics and Ultrametrics in Data Streams. | Amir Carmel, Debarati Das, Evangelos Kipouridis, Evangelos Pipis |
| 2025 | Randomized Binary and Tree Search Under Pressure. | Agustn Caracci, Christoph Drr, Jos Verschae |
| 2025 | Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering. | Nairen Cao, Shi Li, Jia Ye |
| 2025 | Holant* Dichotomy on Domain Size 3: A Geometric Perspective. | Jin-Yi Cai, Jin Soo Ihm |
| 2025 | Optimal Inapproximability of Promise Equations over Finite Groups. | Silvia Butti, Alberto Larrauri, Stanislav Zivn |
| 2025 | Satisfiability of Commutative vs. Non-Commutative CSPs. | Andrei A. Bulatov, Stanislav Zivn |
| 2025 | Faster Frchet Distance Under Transformations. | Kevin Buchin, Maike Buchin, Zijin Huang, Andr Nusser, Sampson Wong |
| 2025 | Near-Optimal Directed Low-Diameter Decompositions. | Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov |
| 2025 | On the Degree Automatability of Sum-Of-Squares Proofs. | Alex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas |
| 2025 | Separability Properties of Monadically Dependent Graph Classes. | douard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mhlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | Faster Construction of a Planar Distance Oracle with (1) Query Time. | Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann |
| 2025 | Saturation Problems for Families of Automata. | Len Bohn, Yong Li, Christof Lding, Sven Schewe |
| 2025 | Light Edge Fault Tolerant Graph Spanners. | Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang |
| 2025 | Reducing Stochastic Games to Semidefinite Programming. | Manuel Bodirsky, Georg Loho, Mateusz Skomra |
| 2025 | Probabilistic and Causal Satisfiability: Constraining the Model. | Markus Blser, Julian Drfler, Maciej Liskiewicz, Benito van der Zander |
| 2025 | Light Spanners with Small Hop-Diameter. | Sujoy Bhore, Lazar Milenkovic |
| 2025 | Guessing Efficiently for Constrained Subspace Approximation. | Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff |
| 2025 | Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition. | Vishwas Bhargava, Devansh Shringi |
| 2025 | Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s, t)-cut. | Koustav Bhanja |