| 1183 | -- | 1212 | Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron. Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity |
| 1213 | -- | 1231 | Adrian Dumitrescu, Csaba D. Tóth. Online Unit Clustering and Unit Covering in Higher Dimensions |
| 1232 | -- | 1251 | Yaqiao Li, Vishnu V. Narayan, Denis Pankratov. Online Coloring and a New Type of Adversary for Online Graph Problems |
| 1252 | -- | 1278 | Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li 0001, Daniel Vaz 0001, Jiayi Xian. On Approximating Degree-Bounded Network Design Problems |
| 1279 | -- | 1315 | Kazuya Haraguchi, Hiroshi Nagamochi. Enumeration of Support-Closed Subsets in Confluent Systems |
| 1316 | -- | 1340 | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen. Local Routing in Sparse and Lightweight Geometric Graphs |
| 1341 | -- | 1356 | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz. Faster Minimization of Tardy Processing Time on a Single Machine |
| 1357 | -- | 1384 | Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke. Randomized Online Computation with High Probability Guarantees |
| 1385 | -- | 1417 | Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle. Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width |
| 1418 | -- | 1440 | Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski. Efficient Computation of Sequence Mappability |
| 1441 | -- | 1465 | Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk. Metric Violation Distance: Hardness and Approximation |