| 0 | -- | 0 | JiaFu He, Haiyu Zeng, Yanbo Zhang. Ramsey goodness of stars and fans for the Hajós graph |
| 0 | -- | 0 | Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong 0001, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter. The Price of Upwardness |
| 0 | -- | 0 | Anuj Dawar. Homomorphism Counts to Trees |
| 0 | -- | 0 | Pascal Ochem, Matthieu Rosenfeld. Words avoiding the morphic images of most of their factors |
| 0 | -- | 0 | Nicolas Bousquet 0001, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek. Shallow brambles |
| 0 | -- | 0 | Konstantinos Georgiou, Somnath Kundu, Pawel Pralat. The Fagnano Triangle Patrolling Problem |
| 0 | -- | 0 | Noah Kaufmann. A Diamond Structure in the Transducer Hierarchy |
| 0 | -- | 0 | Sagnik Sen 0001, Éric Sopena, S. Taruni. Homomorphisms of (n,m)-graphs with respect to generalised switch |
| 0 | -- | 0 | Markus Lohrey, Andreas Rosowski. Parameterized Complexity of Factorization Problems |
| 0 | -- | 0 | Pham Hoang Ha, Nguyen Gia Hien. Spanning trees of claw-free graphs with few leaves and branch vertices |
| 0 | -- | 0 | Michael Joseph, James Propp, Tom Roby. Whirling injections, surjections, and other functions between finite sets |
| 0 | -- | 0 | Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis. Parameterised distance to local irregularity |
| 0 | -- | 0 | Bostjan Bresar, Sandi Klavzar, Babak Samadi. Total $k$-coalition: bounds, exact values and an application to double coalition |
| 0 | -- | 0 | Bostjan Bresar, Csilla Bujtás, Pakanun Dokyeesun, Tanja Dravec. Thresholds for the biased Maker-Breaker domination games |
| 0 | -- | 0 | Alberto Dennunzio, Enrico Formenti, Luciano Margara, Sara Riva. On solving basic equations over the semiring of functional digraphs |
| 0 | -- | 0 | Lajos Gyõrffy, András London, Gábor V. Nagy, András Pluhár. Partitions of Graphs into Special Bipartite Graphs |
| 0 | -- | 0 | M. Utkan Gezer, A. C. Cem Say. $\rm P$ has polynomial-time finite-state verifiers |
| 0 | -- | 0 | Moussa Barro, K. Ernest Bognini, Boucaré Kientéga. On the study of cellular automata on modulo-recurrent words |
| 0 | -- | 0 | Yann Bugeaud, Christophe Reutenauer. On the conjugates of Christoffel words |
| 0 | -- | 0 | Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi. Orientation of good covers |
| 0 | -- | 0 | James D. Currie, Narad Rampersad. Low complexity binary words avoiding $(5/2)^+$-powers |
| 0 | -- | 0 | Benedikt Stufler. Probabilistic enumeration and equivalence of nonisomorphic trees |
| 0 | -- | 0 | Pascal Ochem, Théo Pierron. 4-tangrams are 4-avoidable |
| 0 | -- | 0 | Carla Groenland, Tom Johnston, Jamie Radcliffe, Alex D. Scott. Short reachability networks |
| 0 | -- | 0 | R. Krithika 0001, Roohani Sharma, Prafullkumar Tale. The Complexity of Contracting Bipartite Graphs into Small Cycles |
| 0 | -- | 0 | Carole Porrier, Alain Goupil, Alexandre Blondin Massé. The Leaf Function of Penrose P2 Graphs |
| 0 | -- | 0 | Julien Bensmail, Clara Marcille, Mano Orenga. Pushing Vertices to Make Graphs Irregular |
| 0 | -- | 0 | Thomas C. Hull, Adham Ibrahim, Jacob Paltrowitz, Natalya Ter-Saakov, Grace Wang. The Stamp Folding Problem From a Mountain-Valley Perspective |
| 0 | -- | 0 | Kalpana Mahalingam, Anuran Maity. Watson-Crick conjugates of words and languages |