| 2026 | Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs. | Yibin Zhao |
| 2026 | Decidability and Complexity Borders of Reachability Problems (Invited Talk). | Georg Zetzsche |
| 2026 | Edge-Weighted Online Stochastic Matching Under Jaillet-Lu LP. | Shuyi Yan |
| 2026 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2026 | A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity. | Xudong Wu, Guangxu Yang, Penghui Yao |
| 2026 | Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer. | Qisheng Wang, Zhicheng Zhang |
| 2026 | Faster and Simpler Greedy Algorithm for k-Median and k-Means. | Max Dupr la Tour, David Saulpic |
| 2026 | On the Hardness of Recognizing Graphs of Small Mim-Width and Its Variants. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2026 | Deciding DFA-Primality Is NP-Hard. | Daniel Alexander Spenner |
| 2026 | Dynamic Set Cover with Worst-Case Recourse. | Shay Solomon, Amitai Uzrad |
| 2026 | Partial Derivative Complexity of a Product of Linearly Independent Quadratics. | Nir Shalmon, Amir Shpilka |
| 2026 | Infinite-State Games with Energy Objectives Beyond Counters. | Irmak Saglam, Georg Zetzsche |
| 2026 | A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes. | Wojciech Rozowski, Robin Piedeleu, Alexandra Silva, Fabio Zanasi |
| 2026 | Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity. | Susanna F. de Rezende, David Engstrm, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov |
| 2026 | From Sets to Points: Simplifying MSO Interpretations via Reparameterizations. | Alexander Rabinovich |
| 2026 | Optimal k-Secretary with Logarithmic Memory. | Mingda Qiao, Wei Zhang |
| 2026 | Colorful Minors. | Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2026 | Alternation Depth of Threshold Decision Lists. | Vladimir Podolskii, Morgan E. Prior |
| 2026 | Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words. | Radoslaw Pirkowski |
| 2026 | Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs. | Pan Peng, Yuyang Wang |
| 2026 | Color Fault-Tolerant Distance Preservers: ptimal Size in Conditionally ptimal Time. | Merav Parter, Asaf Petruschka |
| 2026 | Optimal Lower Bounds for Symmetric Modular Circuits. | Benedikt Pago |
| 2026 | Inapproximability of Counting Permutation Patterns. | Michal Opler |
| 2026 | Undirected Replacement Paths: Dual Fault Reduces to Single Source. | Jakob Nogler, Virginia Vassilevska Williams |
| 2026 | From Worst-Case Hardness of NP to Quantum Cryptography via Quantum Indistinguishability Obfuscation. | Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa |