| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2026 | Logics for Context-Free Hyperproperties. | Sarah Winter, Martin Zimmermann |
| 2026 | Some Recent Developments in Space Complexity (Invited Talk). | R. Ryan Williams |
| 2026 | Fast Rational Search via Stern-Brocot Tree. | Connor Weyers, N. V. Vinodchandran |
| 2026 | Randomized and Quantum Lifting for One-Way Conservative NOF Model. | Haoyu Wang, Pei Wu |
| 2026 | The Art of Balance: Many Facets of Dyck Recognition (Invited Talk). | Tatiana Starikovskaya |
| 2026 | Towards a Universal Gateset for QMA₁. | Dorian Rudolph |
| 2026 | Highly-Efficient Local Proofs and Codes (Invited Talk). | Noga Ron-Zewi |
| 2026 | On the Parameterized Complexity of Bounded-Density Vertex Deletion. | Jakob Raupach, Tom-Lukas Breitkopf, Anton Herrmann, Andr Nichterlein |
| 2026 | Diagrammatic Reasoning, Formally (Invited Talk). | Damien Pous |
| 2026 | Beating Trivial Time for Tricky Triangle Tasks. | Neha Pant, Ryan Williams |
| 2026 | Homotopy Theory in Complexity of the Graph Homomorphism Problem (Invited Talk). | Jakub Oprsal |
| 2026 | Finite-State Dimension for Continued Fractions: Betting, Entropy and Normality. | Satyadev Nandakumar, Subin Pulari, Akhil S |
| 2026 | En Route to a Standard QMA₁ vs. QCMA Oracle Separation. | David Miloschewsky, Supartha Podder, Dorian Rudolph |
| 2026 | Bi-Criteria Approximations for Vertex Deletion Problems and d-Hitting Set. | Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2026 | Distinguishing Elements in Semigroups. | Markus Lohrey, Alexander Thumm, Julio Xochitemol |
| 2026 | Product-State Approximation Algorithms for the Transverse Field Ising Model. | Vincenzo Lipardi, David Mestel, Georgios Stamoulis |
| 2026 | Boolean Combinations of ω-Rational Trace Languages: Emptiness, Rationality, Regularity. | Dietrich Kuske |
| 2026 | On the Tension Between Full-Rankness and Self-Reducibility for Set-Multilinear Polynomials. | Deepanshu Kush |
| 2026 | The Parameterized Complexity of Maximum Span on Natural Matroid Classes. | Madhumita Kundu, Ashutosh Rai, Sahiba, Saket Saurabh |
| 2026 | On CC⁰ Lower Bounds for AND via Torus Polynomials. | Vaibhav Krishan, Jayalal Sarma |
| 2026 | Smallest Suffixient Set Maintenance in Near-Real-Time. | Dominik Kppl, Gregory Kucherov |
| 2026 | Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials. | Balagopal Komarath, Rohit Narayanan |
| 2026 | Counting Patterns in Degenerate Graphs in Constant Space. | Balagopal Komarath, Anant Kumar, Akash Pareek |
| 2026 | On Equivalent Characterizations of the Polynomial Hierarchy in Abstract Models of Computation. | Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow, Hans L. Bodlaender |