| 2333 | -- | 2350 | Florian Hörsch, Zoltán Szigeti. The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects |
| 2351 | -- | 2373 | Rémy Belmonte, Ignasi Sau. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings |
| 2374 | -- | 2399 | Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller. Online Multistage Subset Maximization Problems |
| 2400 | -- | 2426 | Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza 0001. KDMDGP Subclass of Distance Geometry Problems with Exact Distances |
| 2427 | -- | 2468 | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem |
| 2469 | -- | 2470 | Bart M. P. Jansen, Jan Arne Telle. Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation |
| 2471 | -- | 2502 | Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002. C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width |
| 2503 | -- | 2520 | Yoichi Iwata, Yusuke Kobayashi 0001. Improved Analysis of Highest-Degree Branching for Feedback Vertex Set |
| 2521 | -- | 2551 | Gregory Rosenthal. Beating Treewidth for Average-Case Subgraph Isomorphism |
| 2552 | -- | 2577 | Benjamin Aram Berendsohn, László Kozma 0002, Dániel Marx. Finding and Counting Permutations via CSPs |
| 2578 | -- | 2605 | Marco Bressan 0002. Faster algorithms for counting subgraphs in sparse graphs |
| 2606 | -- | 2633 | Édouard Bonnet, Nidhi Purohit. Metric Dimension Parameterized By Treewidth |
| 2634 | -- | 2650 | Jana Novotná 0001, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs |