| 401 | -- | 419 | Michael Thomas. The Complexity of Circumscriptive Inference in Post's Lattice |
| 420 | -- | 432 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos. A Note on Exact Algorithms for Vertex Ordering Problems on Graphs |
| 433 | -- | 445 | Shukai Cai, Taisuke Izumi, Koichi Wada. How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model |
| 446 | -- | 491 | Arnaud Durand, Miki Hermann, Gustav Nordh. Trichotomies in the Complexity of Minimal Inference |
| 492 | -- | 515 | Philip Bille. Faster Approximate String Matching for Short Patterns |
| 516 | -- | 536 | Anna Gál, Vladimir Trifonov. On the Correlation Between Parity and Modular Polynomials |
| 537 | -- | 544 | Khandoker Mohammed Mominul Haque. Irregular Total Labellings of Generalized Petersen Graphs |
| 545 | -- | 558 | Hossein Ghasemalizadeh, Mohammadreza Razzazi. An Improved Approximation Algorithm for the Most Points Covering Problem |
| 559 | -- | 578 | Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis. The Impact of Social Ignorance on Weighted Congestion Games |