| 2025 | Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes. | Koppny Istvn Encz, Monaldo Mastrolilli, Eleonora Vercesi |
| 2025 | Faster All-Pairs Optimal Electric Car Routing. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
| 2025 | Tiling Random Regular Graphs Efficiently. | Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii |
| 2025 | Approximation Algorithms for Optimal Hopsets. | Michael Dinitz, Ama Koranteng, Yasamin Nazari |
| 2025 | Graph Exploration: The Impact of a Distance Constraint. | Stphane Devismes, Yoann Dieudonn, Arnaud Labourel |
| 2025 | Query Efficient Weighted Stochastic Matching. | Mahsa Derakhshan, Mohammad Saneian |
| 2025 | One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. | Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman |
| 2025 | Fully Scalable MPC Algorithms for Euclidean k-Center. | Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang |
| 2025 | Reachability in 3-VASS Is Elementary. | Wojciech Czerwinski, Ismal Jecker, Slawomir Lasota, Lukasz Orlikowski |
| 2025 | Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. | Lus Felipe I. Cunha, Ignasi Sau, Uverton S. Souza, Mario Valencia-Pabon |
| 2025 | Deterministic k-Median Clustering in Near-Optimal Time. | Martn Costa, Ermiya Farokhnejad |
| 2025 | How to Compute the Volume in Low Dimension? | Arjan Cornelissen, Simon Apers, Sander Gribling |
| 2025 | Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. | Roni Con, Zeyu Guo, Ray Li, Zihan Zhang |
| 2025 | Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. | Thomas Colcombet, Amina Doumane, Denis Kuperberg |
| 2025 | Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time. | Nathan Claudet, Simon Perdrix |
| 2025 | The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. | Miroslav Chodil, Antonn Kucera |
| 2025 | A New Impossibility Result for Online Bipartite Matching Problems. | Flavio Chierichetti, Mirko Giacchini, Alessandro Panconesi, Andrea Vattani |
| 2025 | Undirected 3-Fault Replacement Path in Nearly Cubic Time. | Shucheng Chi, Ran Duan, Benyu Wang, Tianle Xie |
| 2025 | Decay of Correlation for Edge Colorings When q > 3Δ. | Zejia Chen, Yulin Wang, Chihao Zhang, Zihan Zhang |
| 2025 | Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. | Antares Chen, Lorenzo Orecchia, Erasmo Tani |
| 2025 | Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge. | Jiaqi Cheng, Rishab Goyal |
| 2025 | Optimal Oblivious Subspace Embeddings with Near-Optimal Sparsity. | Shabarish Chenakkod, Michal Derezinski, Xiaoyu Dong |
| 2025 | New Results on a General Class of Minimum Norm Optimization Problems. | Kuowen Chen, Jian Li, Yuval Rabani, Yiran Zhang |
| 2025 | Improved Streaming Edge Coloring. | Shiri Chechik, Hongyi Chen, Tianyi Zhang |
| 2025 | Belief Propagation Guided Decimation on Random k-XORSAT. | Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, Gregory B. Sorkin |