| 2025 | Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions. | Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan |
| 2025 | The Primal Pathwidth SETH. | Michael Lampis |
| 2025 | Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. | William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou |
| 2025 | Efficient | William Kuszmaul, Michael Mitzenmacher |
| 2025 | Lipschitz Continuous Algorithms for Covering Problems. | Soh Kumabe, Yuichi Yoshida |
| 2025 | Rnyi-infinity constrained sampling with | Yunbum Kook, Matthew S. Zhang |
| 2025 | An Efficient Uniqueness Theorem for Overcomplete Tensor Decomposition. | Pascal Koiran |
| 2025 | Having Hope in Missing Spanners: New Distance Preservers and Light Hopsets. | Shimon Kogan, Merav Parter |
| 2025 | Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. | Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz |
| 2025 | Triply efficient shadow tomography. | Robbie King, David Gosset, Robin Kothari, Ryan Babbush |
| 2025 | An analogue of Reed's conjecture for digraphs. | Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta |
| 2025 | On the Decidability of Presburger Arithmetic Expanded with Powers. | Toghrul Karimov, Florian Luca, Joris Nieuwveld, Jol Ouaknine, James Worrell |
| 2025 | Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more. | Adam Karczmarz, Da Wei Zheng |
| 2025 | Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes. | Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn |
| 2025 | Potential Hessian Ascent: The Sherrington-Kirkpatrick Model. | David Jekel, Juspreet Singh Sandhu, Jonathan Shi |
| 2025 | Eulerian Graph Sparsification by Effective Resistance Decomposition. | Arun Jambulapati, Sushant Sachdeva, Aaron Sidford, Kevin Tian, Yibin Zhao |
| 2025 | Faster single-source shortest paths with negative real weights via proper hop distance. | Yufan Huang, Peter Jin, Kent Quanrud |
| 2025 | Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds. | Lingxiao Huang, Jian Li, Pinyan Lu, Xuan Wu |
| 2025 | Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint. | Prommy Sultana Hossain, Xintong Wang, Fang-Yi Yu |
| 2025 | New Separations and Reductions for Directed Hopsets and Preservers. | Gary Hoppenworth, Yinzhan Xu, Zixuan Xu |
| 2025 | Weak coloring numbers of minor-closed graph classes. | Jedrzej Hodor, Hoang La, Piotr Micek, Clment Rambaud |
| 2025 | Clustering to Minimize Cluster-Aware Norm Objectives. | Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase |
| 2025 | Improved Differentially Private Continual Observation Using Group Algebra. | Monika Henzinger, Jalaj Upadhyay |
| 2025 | FPTAS for Holant Problems with Log-Concave Signatures. | Kun He, Zhidan Li, Guoliang Qiu, Chihao Zhang |
| 2025 | New Prophet Inequalities via Poissonization and Sharding. | Elfarouk Harb |