| 2221 | -- | 2239 | Samuel Fiorini, R. Krithika 0001, N. S. Narayanaswamy, Venkatesh Raman 0001. Approximability of Clique Transversal in Perfect Graphs |
| 2240 | -- | 2259 | Magnus Bordewich, Charles Semple, Nihan Tokac. Constructing Tree-Child Networks from Distance Matrices |
| 2260 | -- | 2285 | Till Bruckdorfer, Stefan Felsner, Michael Kaufmann 0001. Planar Bus Graphs |
| 2286 | -- | 2323 | Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta. The Partial Visibility Representation Extension Problem |
| 2324 | -- | 2344 | Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer. Cliques in Hyperbolic Random Graphs |
| 2345 | -- | 2383 | Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath. Ortho-polygon Visibility Representations of Embedded Graphs |
| 2384 | -- | 2399 | Vadim E. Levit, David Tankus. Complexity Results for Generating Subgraphs |
| 2400 | -- | 2421 | Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis. Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms |
| 2422 | -- | 2452 | Sander P. A. Alewijnse, Kevin Buchin, Maike Buchin, Stef Sijben, Michel A. Westenberg. Model-Based Segmentation and Classification of Trajectories |
| 2453 | -- | 2477 | Yun Deng, David Fernández-Baca. Fast Compatibility Testing for Rooted Phylogenetic Trees |
| 2478 | -- | 2491 | Hiroshi Hirai, Hiroyuki Namba. Shortest (A+B)-Path Packing Via Hafnian |
| 2492 | -- | 2511 | Christopher S. Martin, Mohammad R. Salavatipour. Minimizing Latency of Capacitated k-Tours |