| 2026 | Derandomizing Pseudopolynomial Algorithms for Subset Sum. | Timothy M. Chan |
| 2026 | Braiding Vineyards. | Erin W. Chambers, Christopher Fillmore, Elizabeth Stephenson, Mathijs Wintraecken |
| 2026 | Shortcuts and Transitive-Closure Spanners Approximation. | Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2026 | Online Proportional Apportionment. | Javier Cembrano, Jos Correa, Svenja M. Griesbach, Victor Verdugo |
| 2026 | Augmenting to 4-vertex connectivity is fixed-parameter tractable. | Johannes Carmesin, M. S. Ramanujan |
| 2026 | Hardness of Approximation for Shortest Path with Vector Costs. | Charlie Carlson, Yury Makarychev, Ron Mosenzon |
| 2026 | The Erdős-Psa property for circle graphs as vertex-minors. | Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht |
| 2026 | The Power of Matching for Online Fractional Hedonic Games. | Martin Bullinger, Ren Romen, Alexander Schlenga |
| 2026 | Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching. | Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2026 | A near-optimal quadratic Goldreich-Levin algorithm (extended abstract). | Jop Brit, Davi Castro-Silva |
| 2026 | Quantum Advantage via Solving Multivariate Polynomials. | Pierre Briaud, Itai Dinur, Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai |
| 2026 | Traversing regions of supersolvable hyperplane arrangements and their lattice quotients. | Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mtze |
| 2026 | Online Learning with Limited Information in the Sliding Window Model. | Vladimir Braverman, Sumegha Garg, Chen Wang, David P. Woodruff, Samson Zhou |
| 2026 | New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. | Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivn |
| 2026 | MAX BISECTION might be harder to approximate than MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2026 | Faster Distributed Δ-Coloring via a Reduction to MIS. | Yann Bourreau, Sebastian Brandt, Alexandre Nolin |
| 2026 | The Complexity of Dynamic LZ77 is ?Θ(n | Itai Boneh, Shay Golan, Matan Kraus |
| 2026 | Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen |
| 2026 | A CSP approach to Graph Sandwich Problems. | Manuel Bodirsky, Santiago Guzmn-Pro |
| 2026 | Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz. | Markus Blser, Sagnik Dutta, Gorav Jindal |
| 2026 | Is nasty noise actually harder than malicious noise? | Guy Blanc, Yizhi Huang, Tal Malkin, Rocco A. Servedio |
| 2026 | Short circuit walks in fixed dimension. | Alexander E. Black, Christian Nbel, Raphael Steiner |
| 2026 | Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries. | Hadley Black, Christopher Ye |
| 2026 | Tree covers of size 2 for the Euclidean plane. | Artur Bikeev, Andrey Kupavskii, Maxim Turevskii |
| 2026 | Weighted k-Server Admits an Exponentially Competitive Algorithm. | Adithya Bijoy, Ankit Mondal, Ashish Chiplunkar |