| 273 | -- | 303 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip. Structural Parameterizations of Clique Coloring |
| 304 | -- | 324 | Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson. Tight Bounds for Online Weighted Tree Augmentation |
| 325 | -- | 343 | Asaf Levin. Approximation Schemes for the Generalized Extensible Bin Packing Problem |
| 344 | -- | 378 | Jon M. Kleinberg, Sigal Oren. Mechanisms for (Mis)allocating Scientific Credit |
| 379 | -- | 404 | Julian Dörfler, Marc Roth, Johannes Schmitt 0002, Philip Wellnitz. Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness |
| 405 | -- | 435 | Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Complexity of Maximum Degree Contraction Problem |
| 436 | -- | 463 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. Fast Exact Algorithms Using Hadamard Product of Polynomials |
| 464 | -- | 481 | Noga Alon, Clara Shikhelman. Additive Approximation of Generalized Turán Questions |
| 482 | -- | 509 | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz. On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets |
| 510 | -- | 531 | Julien Baste, Dimitrios M. Thilikos. Contraction Bidimensionality of Geometric Intersection Graphs |
| 532 | -- | 564 | José Arturo Gil, Simone Santini. Matching Regular Expressions on uncertain data |