| 2395 | -- | 2414 | Manouchehr Zaker. A New Vertex Coloring Heuristic and Corresponding Chromatic Number |
| 2415 | -- | 2431 | Ziyun Huang, Jinhui Xu 0001. An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions |
| 2432 | -- | 2473 | Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond. On the Tractability of Optimization Problems on H-Graphs |
| 2474 | -- | 2501 | Refael Hassin, R. Ravi 0001, F. Sibel Salman, Danny Segev. The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures |
| 2502 | -- | 2534 | Yuichi Nagata, Shinji Imahori. An Efficient Exhaustive Search Algorithm for the Escherization Problem |
| 2535 | -- | 2563 | Akira Matsubayashi. A $3+\varOmega (1)$ Lower Bound for Page Migration |
| 2564 | -- | 2585 | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev. Queue Layouts of Planar 3-Trees |
| 2586 | -- | 2605 | Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi. Independent Set Reconfiguration Parameterized by Modular-Width |
| 2606 | -- | 2643 | Zhao An, Qilong Feng, Iyad Kanj, Ge Xia. The Complexity of Tree Partitioning |
| 2644 | -- | 2667 | Danny Hermelin, George Manoussakis, Michael Pinedo, Dvir Shabtay, Liron Yedidsion. Parameterized Multi-Scenario Single-Machine Scheduling Problems |
| 2668 | -- | 2686 | Robert Chiang, Kanstantsin Pashkovich. On the Approximability of the Stable Matching Problem with Ties of Size Two |
| 2687 | -- | 2707 | Krzysztof Turowski, Abram Magner, Wojciech Szpankowski. Compression of Dynamic Graphs Generated by a Duplication Model |