| 2133 | -- | 2134 | Christophe Paul, Michal Pilipczuk. Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation |
| 2135 | -- | 2155 | Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström. Multi-budgeted Directed Cuts |
| 2156 | -- | 2173 | Kustaa Kangas, Mikko Koivisto, Sami Salonen. A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions |
| 2174 | -- | 2199 | Kitty Meeks, Fiona Skerman. The Parameterised Complexity of Computing the Maximum Modularity of a Graph |
| 2200 | -- | 2242 | Hubie Chen, Bart M. P. Jansen, Astrid Pieterse. Best-Case and Worst-Case Sparsifiability of Boolean CSPs |
| 2243 | -- | 2266 | Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut. On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs |
| 2267 | -- | 2291 | Marc Roth, Johannes Schmitt 0002. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness |
| 2292 | -- | 2315 | Karl Bringmann, Thore Husfeldt, Måns Magnusson. Multivariate Analysis of Orthogonal Range Searching and Graph Distances |
| 2316 | -- | 2336 | Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva. Dual Parameterization of Weighted Coloring |
| 2337 | -- | 2359 | David Eppstein, Elham Havvaei. Parameterized Leaf Power Recognition via Embedding into Graph Products |
| 2360 | -- | 2394 | Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant. Parameterized Complexity of Independent Set in H-Free Graphs |