| 325 | -- | 351 | Matthias Bentert, André Nichterlein. Parameterized Complexity of Diameter |
| 352 | -- | 383 | Deniz Agaoglu Çagirici, Petr Hlinený. d-Graphs and T-Graphs |
| 384 | -- | 405 | Ivan Bliznets, Danil Sagunov. n |
| 406 | -- | 443 | Thomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries |
| 444 | -- | 491 | Júlio Araújo 0001, Marin Bougeret, Victor A. Campos, Ignasi Sau. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets |
| 492 | -- | 508 | Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller. Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series |
| 509 | -- | 543 | Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev. Succinct Permutation Graphs |
| 544 | -- | 562 | Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou. An Improved Upper Bound on the Queue Number of Planar Graphs |
| 563 | -- | 583 | Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman. Improved Algorithms for Scheduling Unsplittable Flows on Paths |
| 584 | -- | 609 | Serge Gaspers, Edward J. Lee. Faster Graph Coloring in Polynomial Space |
| 610 | -- | 637 | K. Subramani, Piotr Wojciechowski 0002. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling |