| 2026 | Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules. | Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, Kevin Schewior |
| 2026 | Edit Distance of Finite-Valued Transducers. | Prince Mathew, Saina Sunny |
| 2026 | Revisiting Finiteness of Matrix Monoids. | Rida Ait El Manssour, Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James B. Worrell |
| 2026 | Persistent Amortised Analysis, Operationally. | Anton Lorenzen |
| 2026 | Online Steiner Forest with Recourse. | Yaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski |
| 2026 | Streaming Complexity Separations for Dense and Sparse Graphs. | Yang P. Liu, Hoai-An Nguyen, Noah G. Singer, David P. Woodruff |
| 2026 | Algebraic Proof Systems: An Algebraic Approach to Analysing Proofs (Invited Talk). | Nutan Limaye |
| 2026 | Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition. | Xizhe Li, Yaowei Long, David Pidugu, Thatchaphol Saranurak, Benyu Wang |
| 2026 | Counting Perfect Matchings and Hamiltonian Cycles Faster. | Baitian Li |
| 2026 | Determining the Outerthickness of Graphs Is NP-Hard. | Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai |
| 2026 | Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow. | Rasmus Kyng, Aurelio L. Sulser |
| 2026 | On the Complexity of the Matching Problem of Regular Expressions with Backreferences. | Soh Kumabe, Yuya Uezato |
| 2026 | Sampling Colorings with Fixed Color Class Sizes. | Aiya Kuchukova, Will Perkins, Xavier Povill |
| 2026 | Approximating 1-In-3 SAT by Linearly Ordered Hypergraph 3-Colouring Is NP-Hard. | Andrei A. Krokhin, Danny Vagnozzi |
| 2026 | Partially-Dynamic Maximum Flow in Dense Graphs. | Egor Kravchenko, Maximilian Probst Gutenberg |
| 2026 | On the Constructive Dimension Spectrum of Polynomials. | Prajval Koul, Satyadev Nandakumar |
| 2026 | Witnesses for Fixpoint Games on Lattices. | Barbara Knig, Karla Messing |
| 2026 | VP, VNP and Algebraic Branching Programs over Min-Plus Semirings. | Balagopal Komarath, Harshil Mittal, Jayalal Sarma |
| 2026 | Persistence Meets Resistance: Doubling down on Hardness. | Benedikt Kolbe, Tim Mayr |
| 2026 | Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-Width. | Kacper Kluk, Jesper Nederlof |
| 2026 | Thin Trees for near Minimum Cuts. | Nathan Klein, Neil Olver, Zi Song Yeoh |
| 2026 | Online Preemptive Matching Revisited. | Peter Kiss, Mohammad Sharifi |
| 2026 | New Diameter Approximations via Distance Oracle Techniques. | Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams |
| 2026 | Preprocessed 3SUM for Unknown Universes with Subquadratic Space. | Yael Kirkpatrick, John Kuszmaul, Surya Mathialagan, Virginia Vassilevska Williams |
| 2026 | Optimal Parallel Basis Finding in Graphic and Related Matroids. | Sanjeev Khanna, Aaron Putterman, Junkai Song |