| 0 | -- | 0 | Mehri Javanian, Rafik Aguech. On the protected nodes in exponential recursive trees |
| 0 | -- | 0 | Toufik Mansour, Gökhan Yildirim 0002. Inversion sequences avoiding 021 and another pattern of length four |
| 0 | -- | 0 | Jovana Forcan, Jiayue Qi. n |
| 0 | -- | 0 | Geoffrey Exoo. On Mixed Cages |
| 0 | -- | 0 | Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor. Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly |
| 0 | -- | 0 | Robert Schwieger, Elisa Tonello. Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components |
| 0 | -- | 0 | Christof Löding, Sarah Winter. Resynchronized Uniformization and Definability Problems for Rational Relations |
| 0 | -- | 0 | Benjamin Braun, Kaitlin Bruegge, Matthew Kahle. Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering |
| 0 | -- | 0 | Matthias Beck, Sampada Kolhatkar. Bivariate Chromatic Polynomials of Mixed Graphs |
| 0 | -- | 0 | Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan. Pseudoperiodic Words and a Question of Shevelev |
| 0 | -- | 0 | Jie Zhang, Zhilan Wang, Jin Yan. A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| 0 | -- | 0 | Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold. Proving exact values for the 2-limited broadcast domination number on grid graphs |
| 0 | -- | 0 | Josef Rukavicka. Dissecting power of intersection of two context-free languages |
| 0 | -- | 0 | Leo van Iersel, Mark Jones 0001, Mathias Weller. Embedding phylogenetic trees in networks of low treewidth |
| 0 | -- | 0 | Pierre Lescanne. Holonomic equations and efficient random generation of binary trees |
| 0 | -- | 0 | Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit. Antisquares and Critical Exponents |
| 0 | -- | 0 | Gary MacGillivray, Shahla Nasserasr, Feiran Yang 0003. Colourings of (m, n)-coloured mixed graphs |
| 0 | -- | 0 | Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavzar. Maker-Breaker domination game on trees when Staller wins |
| 0 | -- | 0 | Thomas Bellitto, Christopher Duffy 0001, Gary MacGillivray. Homomorphically Full Oriented Graphs |
| 0 | -- | 0 | Václav Blazej, Pavel Dvorák, Michal Opler. Bears with Hats and Independence Polynomials |
| 0 | -- | 0 | Mitre Costa Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva. Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3] |
| 0 | -- | 0 | Jean-Claude Bermond, Takako Kodate, Joseph Yu. Gossiping with interference in radio ring networks |
| 0 | -- | 0 | Janis Iraids, Juris Smotrovs. Representing polynomial of ST-CONNECTIVITY |
| 0 | -- | 0 | Simon B. Hengeveld, Tillmann Miltzow. A Practical Algorithm with Performance Guarantees for the Art Gallery Problem |
| 0 | -- | 0 | Daniel Chen, Sebastian Ohlig. Associated Permutations of Complete Non-Ambiguous Trees |
| 0 | -- | 0 | Guy Louchard, Werner Schachinger, Mark Daniel Ward. The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis |
| 0 | -- | 0 | Mostafa Gholami, Yaser Rowshan. 2n) |