| 0 | -- | 0 | Hui Rao, Lei Ren, Yang Wang. Dissecting a square into congruent polygons |
| 0 | -- | 0 | Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter. The Complexity of Helly-$B_{1}$ EPG Graph Recognition |
| 0 | -- | 0 | Xinwei He, A. J. Hildebrand, Yuchen Li, Yunyi Zhang. Complexity of Leading Digit Sequences |
| 0 | -- | 0 | Tim Smith. A Characterization of Morphic Words with Polynomial Growth |
| 0 | -- | 0 | Lukasz Merta. Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence |
| 0 | -- | 0 | Ümit Islak, Alperen Y. Özdemir. On an alternative sequence comparison statistic of Steele |
| 0 | -- | 0 | Jonathan Klawitter. The agreement distance of unrooted phylogenetic networks |
| 0 | -- | 0 | Raheel Anwar, Muhammad Irfan Yousuf, Muhammad Abid. Analysis of a Model for Generating Weakly Scale-free Networks |
| 0 | -- | 0 | L'ubomíra Dvoráková, Katerina Medková, Edita Pelantová. Complementary symmetric Rote sequences: the critical exponent and the recurrence function |
| 0 | -- | 0 | Wady Naanaa. New schemes for simplifying binary constraint satisfaction problems |
| 0 | -- | 0 | Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile. A method for eternally dominating strong grids |
| 0 | -- | 0 | János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca. On the heapability of finite partial orders |
| 0 | -- | 0 | Chunyan Yan, Zhicong Lin. Inversion sequences avoiding pairs of patterns |
| 0 | -- | 0 | Hongliang Lu, Wei Wang, Juan Yan. Antifactors of regular bipartite graphs |
| 0 | -- | 0 | Hanieh Amjadi, Nasrin Soltankhah. The 3-way flower intersection problem for Steiner triple systems |
| 0 | -- | 0 | Pascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque, Bruno Patrou. New tools for state complexity |
| 0 | -- | 0 | Gülnaz Boruzanli Ekinci, John Baptist Gauci. The super-connectivity of Johnson graphs |
| 0 | -- | 0 | Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro. The Chromatic Number of the Disjointness Graph of the Double Chain |
| 0 | -- | 0 | Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz. The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints |
| 0 | -- | 0 | James D. Currie, Lucas Mol, Narad Rampersad. The repetition threshold for binary rich words |
| 0 | -- | 0 | Winfried Hochstättler, Felix Schröder, Raphael Steiner. On the Complexity of Digraph Colourings and Vertex Arboricity |
| 0 | -- | 0 | Jérémy Omer, Tangi Migot. Vertex order with optimal number of adjacent predecessors |
| 0 | -- | 0 | Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena. From light edges to strong edge-colouring of 1-planar graphs |