| 0 | -- | 0 | Stephan Dominique Andres, Wai Lam Fong. Line game-perfect graphs |
| 0 | -- | 0 | Michal Dvorák, Dusan Knop, Simon Schierreich. On the Complexity of Target Set Selection in Simple Geometric Networks |
| 0 | -- | 0 | Julien Baste. Composing dynamic programming tree-decomposition-based algorithms |
| 0 | -- | 0 | David Coudert, Samuel Coulomb, Guillaume Ducoffe . Leanness Computation: Small Values and Special Graph Classes |
| 0 | -- | 0 | Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Silvia B. Tondato. Weakly toll convexity and proper interval graphs |
| 0 | -- | 0 | Sebastian Czerwinski. On harmonious coloring of hypergraphs |
| 0 | -- | 0 | Mercè Claverol, Andrea de las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer, David Orden. On polynomials associated to Voronoi diagrams of point sets and crossing numbers |
| 0 | -- | 0 | Samvel Kh. Darbinyan. A new sufficient condition for a 2-strong digraph to be Hamiltonian |
| 0 | -- | 0 | Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros. Extending partial edge colorings of iterated cartesian products of cycles and paths |
| 0 | -- | 0 | Nadia Lafrenière, Yan Zhuang. rix statistic and valley-hopping |
| 0 | -- | 0 | Ben Adenbaum, Alexander Wilson. Coloring Groups |
| 0 | -- | 0 | Wenjie Fang. Bijective proof of a conjecture on unit interval posets |
| 0 | -- | 0 | Eun Jung Kim 0002, Arnaud de Mesmay, Tillmann Miltzow. Representing Matroids over the Reals is ∃ℝ-complete |
| 0 | -- | 0 | Deyu Wu, Yipei Zhang, Xiumei Wang. A note on removable edges in near-bricks |