| 2026 | Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time. | Xiao Mao, Aviad Rubinstein |
| 2026 | Approximation Algorithms for Satisfiable and Nearly Satisfiable Ordering CSPs. | Yury Makarychev |
| 2026 | Private Learning of Littlestone Classes, Revisited. | Xin Lyu |
| 2026 | Fine-Grained Bounds for Courcelle's Theorem. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2026 | Zero-Free Regions and Concentration Inequalities for Hypergraph Colorings in the Local Lemma Regime. | Jingcheng Liu, Yixiao Yu |
| 2026 | Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method. | Yang P. Liu |
| 2026 | MIPᶜᵒ=coRE. | Junqiao (Randy) Lin |
| 2026 | Shortcutting for Negative-Weight Shortest Paths. | George Z. Li, Jason Li, Satish Rao, Junkai Zhang |
| 2026 | Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds. | Jiawei Li, Yuhao Li, Hanlin Ren |
| 2026 | Deterministic Padded Decompositions and Negative-Weight Shortest Paths. | Jason Li |
| 2026 | Smoothed Analysis of Learning from Positive Samples. | Jane H. Lee, Anay Mehrotra, Manolis Zampetakis |
| 2026 | The Sample Complexity of Replicable Realizable PAC Learning. | Kasper Green Larsen, Markus Engelund Mathiasen, Chirag Pabbaraju, Clement Svendsen |
| 2026 | Optimal and Efficient Partite Decompositions of Hypergraphs. | Andrew Krapivin, Benjamin Przybocki, Nicols Sanhueza-Matamala, Bernardo Subercaseaux |
| 2026 | The Natural Proofs Barrier against Data-Structure Lower-Bounds. | Michal Kouck, Bruno Loff, Tulasimohan Molli, Michael E. Saks |
| 2026 | No Exponential Quantum Speedup for SIS∞ Anymore. | Robin Kothari, Ryan O'Donnell, Kewen Wu |
| 2026 | Constructive Approximation under Carleman's Condition, with Applications to Smoothed Analysis. | Frederic Koehler, Beining Wu |
| 2026 | Language Generation and Identification from Partial Enumeration: Tight Density Bounds and Topological Characterizations. | Jon M. Kleinberg, Fan Wei |
| 2026 | Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Dniel Marx |
| 2026 | Breaking Barriers for Distributed MIS by Faster Degree Reduction. | Seri Khoury, Aaron Schild |
| 2026 | Average-Case Complexity of Quantum Stabilizer Decoding. | Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba, Akshar Ramkumar, Vinod Vaikuntanathan |
| 2026 | Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow. | Yotam Kenneth-Mordoch, Robert Krauthgamer |
| 2026 | Solving Matrix Games with Near-Optimal Matvec Complexity. | Ishani Karmarkar, Liam O'Carroll, Aaron Sidford |
| 2026 | Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2026 | Learning Mixture Models via Efficient High-Dimensional Sparse Fourier Transforms. | Alkis Kalavasis, Pravesh K. Kothari, Shuchen Li, Manolis Zampetakis |
| 2026 | Kolmogorov's Approach to P vs. NP: Chain Rules for Time-Bounded Kolmogorov Complexity. | Valentine Kabanets, Antonina Kolokolova |