| 2135 | -- | 2153 | Markus Chimani, Niklas Troost, Tilo Wiedera. Approximating Multistage Matching Problems |
| 2154 | -- | 2185 | Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew. Conflict-Free Coloring Bounds on Open Neighborhoods |
| 2186 | -- | 2221 | Dimitris Fotakis 0001, Alkis Kalavasis, Christos Tzamos. Efficient Parameter Estimation of Truncated Boolean Product Distributions |
| 2222 | -- | 2239 | Marinus Gottschau, Marilena Leichter. Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability |
| 2240 | -- | 2241 | Yixin Cao 0001, Marcin Pilipczuk. Preface to the Special Issue on Parameterized and Exact Computation |
| 2242 | -- | 2270 | Tuukka Korhonen. Finding Optimal Triangulations Parameterized by Edge Clique Cover |
| 2271 | -- | 2291 | Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná 0001, Karolina Okrasa. Vertex Deletion into Bipartite Permutation Graphs |
| 2292 | -- | 2308 | Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma. Parameterized Complexity of Directed Spanner Problems |
| 2309 | -- | 2334 | Jesper Nederlof, CĂ©line M. F. Swennenhuis. On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan |
| 2335 | -- | 2357 | Ashwin Jacob, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot. Structural Parameterizations with Modulator Oblivion |
| 2358 | -- | 2378 | Marcelo Garlet Milani. A Polynomial Kernel for Funnel Arc Deletion Set |
| 2379 | -- | 2393 | Yasuaki Kobayashi, Yota Otachi. Parameterized Complexity of Graph Burning |