| 261 | -- | 262 | Andrei A. Bulatov, Edward A. Hirsch, Jean-Éric Pin. Preface |
| 263 | -- | 282 | Konrad W. Schwerdtfeger. The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits |
| 283 | -- | 304 | Martin Fürer, Huiwen Yu. Space Saving by Dynamic Algebraization Based on Tree-Depth |
| 305 | -- | 321 | Akinori Kawachi, Benjamin Rossman, Osamu Watanabe 0001. The Query Complexity of Witness Finding |
| 322 | -- | 351 | Markus Lohrey, Manfred Schmidt-Schauß. Processing Succinct Matrices and Vectors |
| 352 | -- | 370 | Lukas Fleischer, Manfred Kufleitner, Alexander Lauser. The Half-Levels of the FO2 Alternation Hierarchy |
| 371 | -- | 461 | Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry. Separation Logic with One Quantified Variable |
| 462 | -- | 463 | Lev D. Beklemishev. Guest Editorial: Computer Science Symposium in Russia |
| 464 | -- | 493 | Vladimir V. Podolskii. Bounds in Ontology-Based Data Access via Circuit Complexity |
| 494 | -- | 520 | Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva. Equations Over Free Inverse Monoids with Idempotent Variables |
| 521 | -- | 535 | Alexey Milovanov. Some Properties of Antistochastic Strings |
| 536 | -- | 580 | Vincent Penelle. Rewriting Higher-Order Stack Trees |
| 581 | -- | 605 | Mikhail Barash, Alexander Okhotin. Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts |
| 606 | -- | 636 | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen. Optimizing Binary Heaps |
| 637 | -- | 655 | Simone Bova, Friedrich Slivovsky. On Compiling Structured CNFs to OBDDs |
| 656 | -- | 688 | Mateus de Oliveira Oliveira. On the Satisfiability of Quantum Circuits of Small Treewidth |
| 689 | -- | 720 | Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey. Satisfiability of ECTL∗ with Local Tree Constraints |