| 2025 | From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. | Simon Dring, Dniel Marx, Philip Wellnitz |
| 2025 | Almost Tight Bounds for Differentially Private Densest Subgraph. | Michael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii |
| 2025 | Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation. | Ilias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Thanasis Pittas |
| 2025 | A Fast Algorithm for Computing Zigzag Representatives. | Tamal K. Dey, Tao Hou, Dmitriy Morozov |
| 2025 | Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning. | Michal Derezinski, Christopher Musco, Jiaming Yang |
| 2025 | Solving Polynomial Equations Over Finite Fields. | Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann |
| 2025 | A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. | Varsha Dani, Thomas P. Hayes |
| 2025 | Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More. | Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams |
| 2025 | Counting Small Induced Subgraphs: Hardness via Fourier Analysis. | Radu Curticapean, Daniel Neuen |
| 2025 | Asynchronous 3-Majority Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2025 | A Tight VC-Dimension Analysis of Clustering Coresets with Applications. | Vincent Cohen-Addad, Andrew Draganov, Matteo Russo, David Saulpic, Chris Schwiegelshohn |
| 2025 | Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement. | Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi |
| 2025 | Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition. | Julia Chuzhoy, Merav Parter |
| 2025 | Tree Independence Number IV. Even-hole-free graphs. | Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl |
| 2025 | Spectral Independence Beyond Total Influence on Trees and Related Graphs. | Xiaoyu Chen, Xiongxin Yang, Yitong Yin, Xinyuan Zhang |
| 2025 | Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares. | Hongjie Chen, Deepak Narayanan Sridharan, David Steurer |
| 2025 | Exact Thresholds for Noisy Non-Adaptive Group Testing. | Junren Chen, Jonathan Scarlett |
| 2025 | Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. | Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2025 | Near-optimal hierarchical matrix approximation from matrix-vector products. | Tyler Chen, Feyza Duman Keles, Diana Halikias, Cameron Musco, Christopher Musco, David Persson |
| 2025 | Online Scheduling via Gradient Descent for Weighted Flow Time Minimization. | Qingyun Chen, Sungjin Im, Aditya Petety |
| 2025 | A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. | Yanlin Chen, Andrs Gilyn, Ronald de Wolf |
| 2025 | Frchet Distance in Subquadratic Time. | Siu-Wing Cheng, Haoqiang Huang |
| 2025 | Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets. | Yeyuan Chen |
| 2025 | Prophet Secretary and Matching: the Significance of the Largest Item. | Ziyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin Tang |
| 2025 | A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. | Chandra Chekuri, Rhea Jain |