| 149 | -- | 0 | . Editor's Note |
| 150 | -- | 189 | Thomas Brihaye, Véronique Bruyère, Julie De Pril. On Equilibria in Quantitative Games with Reachability/Safety Objectives |
| 190 | -- | 210 | Junhua Yu. Prehistoric Graph in Modal Derivations and Self-Referentiality |
| 211 | -- | 223 | Mikhail V. Berlinkov. Approximating the Minimum Length of Synchronizing Words Is Hard |
| 224 | -- | 243 | Arseny M. Shur. Growth of Power-Free Languages over Large Alphabets |
| 244 | -- | 260 | Matthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck. Obtaining Online Ecological Colourings by Generalizing First-Fit |
| 261 | -- | 276 | Dmitry Itsykson. Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms |
| 277 | -- | 292 | Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou. Quotient Complexity of Closed Languages |
| 293 | -- | 304 | Pavel Martyugin. Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata |
| 305 | -- | 317 | Nikolay K. Vereshchagin. Encoding Invariance in Average Case Complexity |
| 318 | -- | 336 | Maurice Jansen, Jayalal Sarma. Balancing Bounded Treewidth Circuits |
| 337 | -- | 372 | Pawel Gawrychowski, Artur Jez, Lukasz Jez. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online |