| 2025 | Quasi-Monte Carlo Beyond Hardy-Krause. | Nikhil Bansal, Haotian Jiang |
| 2025 | Tolls for Dynamic Equilibrium Flows. | Lukas Graf, Tobias Harks, Julian Schwarz |
| 2025 | Approximating Traveling Salesman Problems Using a Bridge Lemma. | Martin Bhm, Zachary Friggstad, Tobias Mmke, Joachim Spoerhase |
| 2025 | Lower Bounds for Convexity Testing. | Xi Chen, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten |
| 2025 | Relative-error monotonicity testing. | Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang |
| 2025 | A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization. | Shuchi Chawla, Dimitris Christou, Trung Dang, Zhiyi Huang, Gregory Kehne, Rojin Rezvan |
| 2025 | Losing Treewidth In The Presence Of Weights. | Michal Wlodarczyk |
| 2025 | Linear equations with monomial constraints and decision problems in abelian-by-cyclic groups. | Ruiwen Dong |
| 2025 | Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs. | Shi Li |
| 2025 | Approximately Counting Knapsack Solutions in Subquadratic Time. | Weiming Feng, Ce Jin |
| 2024 | Edge-weighted Online Stochastic Matching: Beating. | Shuyi Yan |
| 2024 | New Bounds for Matrix Multiplication: from Alpha to Omega. | Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou |
| 2024 | Simpler and Higher Lower Bounds for Shortcut Sets. | Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu |
| 2024 | Representative set statements for delta-matroids and the Mader delta-matroid. | Magnus Wahlstrm |
| 2024 | On Supermodular Contracts and Dense Subgraphs. | Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad |
| 2024 | Untangling Graphs on Surfaces. | ric Colin de Verdire, Vincent Despr, Loc Dubois |
| 2024 | Sorting and Selection in Rounds with Adversarial Comparisons. | Christopher Trevisan |
| 2024 | Single-Source Unsplittable Flows in Planar Graphs. | Vera Traub, Laura Vargas Koch, Rico Zenklusen |
| 2024 | Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. | Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys |
| 2024 | A Tight Bound for Testing Partition Properties. | Asaf Shapira, Henrique Stagni |
| 2024 | Faster Approximate All Pairs Shortest Paths. | Barna Saha, Christopher Ye |
| 2024 | How Many Neurons Does it Take to Approximate the Maximum? | Itay Safran, Daniel Reichman, Paul Valiant |
| 2024 | Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. | Natan Rubin |
| 2024 | Efficient Quantum State Synthesis with One Query. | Gregory Rosenthal |
| 2024 | Impossibilities for Obviously Strategy-Proof Mechanisms. | Shiri Ron |