| 1 | -- | 12 | Reza Naserasr, Edita Rollová, Eric Sopena. Homomorphisms of planar signed graphs to signed projective cubes |
| 13 | -- | 20 | Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. 4's |
| 21 | -- | 30 | Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia. On the connectedness and diameter of a Geometric Johnson Graph |
| 31 | -- | 40 | Andrej Taranenko. A new characterization and a recognition algorithm of Lucas cubes |
| 41 | -- | 60 | Silvio Capobianco, Pierre Guillon, Jarkko Kari. Surjective cellular automata far from the Garden of Eden |
| 61 | -- | 72 | Mariusz Grech, Andrzej Kisielewicz. The Černý conjecture for automata respecting intervals of a directed graph |
| 73 | -- | 100 | Parikshit Kolipaka, Sathish Govindarajan. Two player game variant of the Erdős-Szekeres problem |
| 101 | -- | 118 | Krzysztof Krzywdzinski, Dariusz R. Kowalski. On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up |
| 119 | -- | 126 | Dániel Gerbner. The Magnus-Derek game in groups |
| 127 | -- | 138 | Rafal Witkowski, Janez Zerovnik. 1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs |
| 139 | -- | 154 | Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian. Coloring and Guarding Arrangements |
| 155 | -- | 166 | Delia Garijo, Antonio González Herrera, Alberto Márquez. The resolving number of a graph |