| 1547 | -- | 1573 | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari. Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs |
| 1574 | -- | 1600 | Guillaume Ducoffe , Sylvain Legay, Nicolas Nisse. On the Complexity of Computing Treebreadth |
| 1601 | -- | 1615 | Charles Maske, Jaime Cohen, Elias P. Duarte. Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions |
| 1616 | -- | 1639 | Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths |
| 1640 | -- | 1653 | Nikhil Bansal, Martin Böhm, Marek Eliás 0001, Grigorios Koumoutsos, Seeun William Umboh. Nested Convex Bodies are Chaseable |
| 1654 | -- | 1674 | Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width |
| 1675 | -- | 1702 | Zeta Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros. High-Dimensional Approximate r-Nets |
| 1703 | -- | 1739 | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |