| 2026 | Competitive Bundle Trading. | Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi |
| 2026 | Fully Dynamic Algorithms for Coloring Triangle-Free Graphs. | Sepehr Assadi, Helia Yazdanyar |
| 2026 | Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root Depth. | Vikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | Testing Sparse Functions over the Reals. | Vipul Arora, Arnab Bhattacharyya, Philips George John, Sayantan Sen |
| 2026 | Multiplicative Assignment with Upgrades. | Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang |
| 2026 | Recursion and Proof Theoretical Characterizations of Small Circuit Classes with Modulo Counting via Discrete Differential Equations. | Melissa Antonelli, Arnaud Durand, Rui Li |
| 2026 | Out-Of-Order Membership in Regular Languages. | Antoine Amarilli, Sbastien Labb, Charles Paperman |
| 2026 | Gray Codes with Constant Delay and Constant Auxiliary Space. | Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikal Monet, Yann Strozecki |
| 2026 | Unambiguisability and Register Minimisation of Min-Plus Models. | Shaull Almagor, Guy Arbel, Sarai Sheinvald |
| 2026 | Faster Triangulation Mixing via Transport Flows. | Vedat Levi Alev, Daniel Frishberg, Michail Sarantis, Prasad Tetali |
| 2026 | Node-Weighted Triangles: Faster and Simpler. | Shyan Akmal, Nick Fischer |
| 2026 | Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs. | Panagiotis Aivasiliotis, Andreas Gbel, Marc Roth |
| 2026 | Mind the Gap? Not for SVP Hardness Under ETH! | Divesh Aggarwal, Rishav Gupta, Aditya Morolia, Chuanqi Zhang |
| 2026 | Improved Tree Sparsifiers in Near-Linear Time. | Daniel Agassy, Dani Dorfman, Haim Kaplan |
| 2026 | Quantum Advantage in Proof Systems Without Entanglement. | Krishna Agaram, Nicholas Spooner, Yuxi Zheng |
| 2026 | The Impossibility of Simultaneous Time and I/O Optimality for the Planar Maxima and Convex Hull Problems. | Peyman Afshani, Gerth Stlting Brodal, Nodari Sitchinava |
| 2026 | Tight Algorithm and Hardness for Submodular Linear Ordering. | Evan Abboud, Roy Schwartz |
| 2026 | Pseudo-Deterministic Quantum Algorithms. | Hugo Aaronson, Tom Gur, Jiawei Li |
| 2025 | The Converse of the Real Orthogonal Holant Theorem. | Ben Young |
| 2025 | Deterministic Independent Sets in the Semi-Streaming Model. | Daniel Ye |
| 2025 | A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions. | Penghui Yao, Mingnan Zhao |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2025 | k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye, Adrian Vetta |
| 2025 | Near-Optimal Algorithm for Directed Expander Decompositions. | Aurelio L. Sulser, Maximilian Probst Gutenberg |
| 2025 | Deterministic Complexity Analysis of Hermitian Eigenproblems. | Aleksandros Sobczyk |