| 0 | -- | 0 | Israel R. Curbelo, Hannah R. Malko. On the on-line coloring of unit interval graphs with proper interval representation |
| 0 | -- | 0 | Margaret-Ellen Messinger, Amanda Porter. Eulerian $k$-dominating reconfiguration graphs |
| 0 | -- | 0 | Maël Dumas, Anthony Perez 0001, Mathis Rocton, Ioan Todinca. Polynomial kernels for edge modification problems towards block and strictly chordal graphs |
| 0 | -- | 0 | France Gheeraert, Julien Leroy 0002. $\mathcal{S}$-adic characterization of minimal dendric shifts |
| 0 | -- | 0 | Katharina T. Huber, Simone Linz, Vincent Moulton. Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees |
| 0 | -- | 0 | Robert Hickingbotham. Cop-width, flip-width and strong colouring numbers |
| 0 | -- | 0 | Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, Jung Hon Yip. Treewidth 2 in the Planar Graph Product Structure Theorem |
| 0 | -- | 0 | Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari. Planar cycle-extendable graphs |
| 0 | -- | 0 | Marcin Pilipczuk, Pawel Rzazewski. A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number |
| 0 | -- | 0 | Luisa Gargano, Adele A. Rescigno. Spanning Trees Minimizing Branching Costs |
| 0 | -- | 0 | Oksana Firman, Joachim Spoerhase. Hypergraph Representation via Axis-Aligned Point-Subspace Cover |
| 0 | -- | 0 | Mojtaba Ostovari, Alireza Zarei. Improved Combinatorial Approximations for Weighted Correlation Clustering |
| 0 | -- | 0 | Giuseppe Di Battista, Fabrizio Frati. From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs |
| 0 | -- | 0 | Lorenzo Balzotti. Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs |
| 0 | -- | 0 | Tobias Mömke, Alexandru Popa 0001, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze. Approximating Maximum Edge 2-Coloring by Normalizing Graphs |
| 0 | -- | 0 | Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky. On Separating Path and Tree Systems in Graphs |