| 2026 | Optimal randomized clustering for subsets of L | Assaf Naor, Kevin Ren |
| 2026 | An Optimal Density Bound for Discretized Point Patrolling. | Ahan Mishra |
| 2026 | Hallucinating Flows for Optimal Mechanisms. | Marios Mertzanidis, Athina Terzoglou |
| 2026 | Streaming and Massively Parallel Algorithms for Euclidean Max-Cut. | Nicolas Menand, Erik Waingarten |
| 2026 | Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. | Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time. | Simon Meierhans, Maximilian Probst Gutenberg |
| 2026 | #CFG and #DNNF admit FPRAS. | Kuldeep S. Meel, Alexis de Colnet |
| 2026 | On Distributed Colouring of Hyperbolic Random Graphs. | Yannic Maus, Janosch Ruff |
| 2026 | Algebraic Closure of Matrix Sets Recognized by 1-VASS. | Rida Ait El Manssour, Mahsa Naraghi, Mahsa Shirmohammadi, James Worrell |
| 2026 | Existence of Fair and Efficient Allocation of Indivisible Chores. | Ryoga Mahara |
| 2026 | Sublinear Metric Steiner Forest via Maximal Independent Set. | Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian |
| 2026 | Better Regret Rates in Bilateral Trade via Sublinear Budget Violation. | Anna Lunghi, Matteo Castiglioni, Alberto Marchesi |
| 2026 | Near-Optimal Four-Cycle Counting in Graph Streams. | Sebastian Lderssen, Stefan Neumann, Pan Peng |
| 2026 | Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time. | Bowie Liu, Dennis Wong, Chan-Tong Lam, Sio-Kei Im |
| 2026 | Numerical Linear Algebra in Linear Space. | Yiping Liu, Hoai-An Nguyen, Junzhao Yang |
| 2026 | Local Gibbs sampling beyond local uniformity. | Hongyang Liu, Chunyang Wang, Yitong Yin |
| 2026 | Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem. | David X. Lin, Siddhartha Banerjee, Giannis Fikioris, va Tardos |
| 2026 | L | Honghao Lin, Zhao Song, David P. Woodruff, Shenghao Xie, Samson Zhou |
| 2026 | Evasive sets, twisted varieties, and container-clique trees. | Jeck Lim, Jiaxi Nie, Ji Zeng |
| 2026 | Circuits and Backdoors: Five Shades of the SETH. | Michael Lampis |
| 2026 | k-SUM Hardness Implies Treewidth-SETH. | Michael Lampis |
| 2026 | Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck. | William Kuszmaul, Jingxun Liang, Renfei Zhou |
| 2026 | A Tutte-type canonical decomposition of 3- and 4-connected graphs. | Jan Kurkofka, Tim Planken |
| 2026 | Dichotomy for orderings? | Gbor Kun, Jaroslav Nesetril |
| 2026 | Lower bounds for the universal TSP on the plane. | Cosmas Kravaris |