| 2026 | The Parameterised Complexity of Counting Small Sub-Hypergraphs. | Marco Bressan, Julian Christoph Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz |
| 2026 | Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence. | Weiming Feng, Minji Yang |
| 2026 | Combinatorial Philosopher Inequalities. | Enze Sun, Zhihao Gavin Tang, Yifan Wang |
| 2026 | Persuasive Calibration. | Yiding Feng, Wei Tang |
| 2026 | Approximate Light Spanners in Planar Graphs. | Hung Le, Shay Solomon, Cuong Than, Csaba D. Tth, Tianyi Zhang |
| 2026 | Covering the Euclidean Plane by a Pair of Trees. | Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang |
| 2026 | Contextual Search in Principal-Agent Games: The Curse of Degeneracy. | Yiding Feng, Mengfan Ma, Bo Peng, Zongqi Wan |
| 2026 | Improved Additive Approximation Algorithms for APSP. | Ce Jin, Yael Kirkpatrick, Michal Stawarz, Virginia Vassilevska Williams |
| 2026 | Feature Selection and Junta Testing are Statistically Equivalent. | Lorenzo Beretta, Nathaniel Harms, Caleb Koch |
| 2026 | Halfspaces are hard to test with relative error. | Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang |
| 2026 | Efficiently Constructing Sparse Navigable Graphs. | Alex Conway, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen |
| 2026 | Combinatorial Selection with Costly Information. | Shuchi Chawla, Dimitrios Christou, Amit Harlev, Ziv Scully |
| 2026 | Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. | Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri |
| 2026 | Nearly Optimal Bounds for Stochastic Online Sorting. | Yang Hu |
| 2026 | Dynamic 3D Convex Hulls Revisited and Applications. | Haitao Wang |
| 2026 | On sampling two spin models using the local connective constant. | Charilaos Efthymiou |
| 2026 | An Optimal Online Algorithm for Robust Flow Time Scheduling. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi, Zhaozi Wang |
| 2026 | Learning Packing and Covering from Samples. | Anupam Gupta, Marco Molinaro |
| 2025 | All-Hops Shortest Paths. | Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick |
| 2025 | Tight Streaming Lower Bounds for Deterministic Approximate Counting. | Yichuan Wang |
| 2025 | Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. | Tijn de Vos, Aleksander B. G. Christiansen |
| 2025 | A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces. | ric Colin de Verdire, Vincent Despr, Loc Dubois |
| 2025 | (Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow. | Ohad Trabelsi |
| 2025 | Testing Approximate Stationarity Concepts for Piecewise Affine Functions. | Lai Tian, Anthony Man-Cho So |
| 2025 | Tight Sampling Bounds for Eigenvalue Approximation. | William Swartworth, David P. Woodruff |