| 2026 | Low-Sensitivity Matching via Sampling from Gibbs Distributions. | Yuichi Yoshida, Zihan Zhang |
| 2026 | Improving Algorithmic Efficiency using Cryptography: Trapdoored Matrices and Applications. | Vinod Vaikuntanathan, Or Zamir |
| 2026 | Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2026 | PageRank Centrality in Directed Graphs with Bounded In-Degree. | Mikkel Thorup, Hanzhi Wang, Zhewei Wei, Mingji Yang |
| 2026 | Online Conformal Prediction with Efficiency Guarantees. | Vaidehi Srinivas |
| 2026 | A Few Good Choices. | Haoyu Song, Thnh Nguyen, Young-San Lin |
| 2026 | Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General. | David B. Shmoys, Varun Suriyanarayana, Seeun William Umboh |
| 2026 | Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries. | Vihan Shah |
| 2026 | Space-efficient population protocols for exact majority on general graphs. | Joel Rybicki, Jakob Solnerzik, Olivier Stietel, Robin Vacus |
| 2026 | On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions. | Natan Rubin |
| 2026 | The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders. | Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang |
| 2026 | Helly-Type Theorems for Splitting Point Sets. | Lidor Portal, Natan Rubin |
| 2026 | Optimal Rounding for Two-Stage Bipartite Matching. | Tristan Pollner, Amin Saberi, Anders Wikum |
| 2026 | Computational Complexity in Property Testing. | Renato Ferreira Pinto Jr., Diptaksho Palit, Sofya Raskhodnikova |
| 2026 | Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. | Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk |
| 2026 | On a Clique Game and the Erdős-Hajnal Problem on High-Chromatic High-Girth Subgraphs. | Seth Pettie, Gbor Tardos, Bartosz Walczak |
| 2026 | Beating full state tomography for unentangled spectrum estimation. | Angelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright |
| 2026 | Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. | Daniel Paul-Pena, C. Seshadhri |
| 2026 | Online Resource Allocation with Concave, Diminishing-Returns Objectives. | Kalen Patton |
| 2026 | On Deterministically Finding an Element of High Order Modulo a Composite. | Ziv Oznovich, Ben Lee Volk |
| 2026 | Time-Biased Random Walks and Robustness of Expanders. | Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester |
| 2026 | Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems. | Kobbi Nissim, Eliad Tsfadia, Chao Yan |
| 2026 | The Division Barrier: Optimal Bounds and Structural Limits in Toom-Cook Interpolation. | Roy Nissim, Oded Schwartz, Yuval Spiizer |
| 2026 | A Better-Than-2 Approximation for the Directed Tree Augmentation Problem. | Meike Neuwohner, Olha Silina, Michael Zlatin |
| 2026 | Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates. | Jon Nelson, Joel Rajakumar, Dominik Hangleiter, Michael J. Gullans |