| 1 | -- | 2 | Thore Husfeldt, Iyad A. Kanj. Guest Editorial: Special Issue on Parameterized and Exact Computation |
| 3 | -- | 28 | Bart M. P. Jansen, Astrid Pieterse. Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT |
| 29 | -- | 41 | Ilario Bonacina, Navid Talebanfard. Strong ETH and Resolution via Games and the Multiplicity of Strategies |
| 42 | -- | 65 | Hanna Sumita, Naonori Kakimura, Kazuhisa Makino. Parameterized Complexity of Sparse Linear Complementarity Problems |
| 66 | -- | 95 | Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion |
| 96 | -- | 138 | Stefan Kratsch, Manuel Sorge. On Kernelization and Approximation for the Vector Connectivity Problem |
| 139 | -- | 158 | Jannis Bulian, Anuj Dawar. Fixed-Parameter Tractable Distances to Sparse Graph Classes |
| 159 | -- | 188 | Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala. Linear Kernels for Outbranching Problems in Sparse Digraphs |
| 189 | -- | 210 | Ondrej Suchý. Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices |
| 211 | -- | 229 | Florian Barbero, Gregory Gutin, Mark Jones, Bin Sheng. Parameterized and Approximation Algorithms for the Load Coloring Problem |
| 230 | -- | 250 | Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke. Complexity and Approximability of Parameterized MAX-CSPs |
| 251 | -- | 270 | Eun Jung Kim 0002, O-joung Kwon. A Polynomial Kernel for Block Graph Deletion |
| 271 | -- | 290 | Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. Quick but Odd Growth of Cacti |