| 223 | -- | 240 | Charles E. Leiserson, Tao B. Schardl, Warut Suksompong. Upper Bounds on Number of Steals in Rooted Trees |
| 241 | -- | 272 | Mingyu Xiao, Hiroshi Nagamochi. An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 |
| 273 | -- | 286 | Hans L. Bodlaender, Johan M. M. van Rooij. Exact Algorithms for Intervalizing Coloured Graphs |
| 287 | -- | 303 | Ali Mashreghi, Alireza Zarei. When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem |
| 304 | -- | 321 | Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois. Speed Scaling for Maximum Lateness |
| 322 | -- | 344 | Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin. Online Scheduling FIFO Policies with Admission and Push-Out |
| 345 | -- | 356 | Shun-Chieh Chang, Jia Jie Liu, Yue-Li Wang. The Outer-connected Domination Number of Sierpiński-like Graphs |
| 357 | -- | 376 | Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk. A Fast Branching Algorithm for Cluster Vertex Deletion |
| 377 | -- | 379 | Joost Engelfriet. Erratum to: "Top-down Tree Transducers with Regular Look-ahead" |