| 2025 | New Approximation Algorithms and Reductions for | Shiri Chechik, Itay Hoch, Gur Lifshitz |
| 2025 | The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction. | Moses Charikar, Erik Waingarten |
| 2025 | Embedding Probability Distributions into Low Dimensional ℓ | Moses Charikar, Spencer Compton, Chirag Pabbaraju |
| 2025 | Embedding Planar Graphs into Graphs of Treewidth | Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | New Combinatorial Insights for Monotone Apportionment. | Javier Cembrano, Jos Correa, Ulrike Schmidt-Kraepelin, Alexandros Tsigonias-Dimitriadis, Victor Verdugo |
| 2025 | A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design. | Matteo Castiglioni, Junjie Chen, Minming Li, Haifeng Xu, Song Zuo |
| 2025 | Hiring for An Uncertain Task: Joint Design of Information and Contracts. | Matteo Castiglioni, Junjie Chen |
| 2025 | Flip Dynamics for Sampling Colorings: Improving (11/6 - ε) Using A Simple Metric. | Charlie Carlson, Eric Vigoda |
| 2025 | Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. | Charlie Carlson, Xiaoyu Chen, Weiming Feng, Eric Vigoda |
| 2025 | Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- | Anton Bukov, Shay Solomon, Tianyi Zhang |
| 2025 | Beating Bellman's Algorithm for Subset Sum. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2025 | New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. | Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc |
| 2025 | Bounding | Romain Bourneuf, Marcin Pilipczuk |
| 2025 | Stronger adversaries grow cheaper forests: online node-weighted Steiner problems. | Sander Borst, Marek Elis, Moritz Venzin |
| 2025 | Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths. | Greg Bodwin, Lily Wang |
| 2025 | Improved Online Reachability Preservers. | Greg Bodwin, Tuong Le |
| 2025 | A Lower Bound for Light Spanners in General Graphs. | Greg Bodwin, Jeremy Flics |
| 2025 | Competitive strategies to use "warm start" algorithms with predictions. | Avrim Blum, Vaidehi Srinivas |
| 2025 | Deterministic Online Bipartite Edge Coloring. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2025 | Mean-field Potts and random-cluster dynamics from high-entropy initializations. | Antonio Blanca, Reza Gheissari, Xusheng Zhang |
| 2025 | Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. | Andreas Bjrklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt |
| 2025 | Flipping Non-Crossing Spanning Trees. | Hvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber |
| 2025 | Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. | Sujoy Bhore, Balzs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dmtr Plvlgyi, Csaba D. Tth |
| 2025 | Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. | Sujoy Bhore, Timothy M. Chan |
| 2025 | Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. | Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |