| 539 | -- | 540 | Gregory Z. Gutin, Stefan Szeider. Guest Editorial: Special Issue on Parameterized and Exact Computation |
| 541 | -- | 565 | Edouard Bonnet, Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos. On Subexponential and FPT-Time Inapproximability |
| 566 | -- | 580 | Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization |
| 581 | -- | 604 | Antonis Thomas, Jan van Leeuwen. Pure Nash Equilibria in Graphical Games and Treewidth |
| 605 | -- | 635 | Bart M. P. Jansen. On Sparsification for Computing Treewidth |
| 636 | -- | 660 | Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof. Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions |
| 661 | -- | 701 | Michael Elberfeld, Christoph Stockhusen, Till Tantau. On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness |
| 702 | -- | 730 | Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu. A Completeness Theory for Polynomial (Turing) Kernelization |
| 731 | -- | 757 | Leizhen Cai, Yufei Cai. Incompressibility of H-Free Edge Modification Problems |
| 758 | -- | 773 | N. S. Narayanaswamy, R. Subashini. Obtaining Matrices with the Consecutive Ones Property by Row Deletions |