| 1165 | -- | 1200 | Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés. The Inverse Voronoi Problem in Graphs II: Trees |
| 1201 | -- | 1221 | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001. Towards a Polynomial Kernel for Directed Feedback Vertex Set |
| 1222 | -- | 1237 | Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang. Budget Feasible Mechanisms on Matroids |
| 1238 | -- | 1255 | Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng. Matching Cut in Graphs with Large Minimum Degree |
| 1256 | -- | 1315 | Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis. The Price of Defense |
| 1316 | -- | 1351 | Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán. Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers |
| 1352 | -- | 1370 | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann. Travelling on Graphs with Small Highway Dimension |
| 1371 | -- | 1392 | Marc Bury, Michele Gentili, Chris Schwiegelshohn, Mara Sorella. Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities |
| 1393 | -- | 1420 | Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi. Packing Arc-Disjoint Cycles in Tournaments |
| 1421 | -- | 1458 | Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. Computing the Largest Bond and the Maximum Connected Cut of a Graph |
| 1459 | -- | 1492 | Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between |
| 1493 | -- | 1523 | Ágnes Cseh, Telikepalli Kavitha. Popular Matchings in Complete Graphs |
| 1524 | -- | 1543 | Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane. Approximating the Canadian Traveller Problem with Online Randomization |
| 1544 | -- | 1558 | Pat Morin. A Fast Algorithm for the Product Structure of Planar Graphs |
| 1559 | -- | 1603 | Britta Dorn, Ronald de Haan, Ildikó Schlotter. Obtaining a Proportional Allocation by Deleting Items |