| 0 | -- | 0 | Michael A. Henning, Elena Mohr, Dieter Rautenbach. On the maximum number of minimum total dominating sets in forests |
| 0 | -- | 0 | Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová. On-line algorithms for multiplication and division in real and complex numeration systems |
| 0 | -- | 0 | Sandi Klavzar, Douglas F. Rall. Packing chromatic vertex-critical graphs |
| 0 | -- | 0 | Christof Löding, Christopher Spinrath. Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words |
| 0 | -- | 0 | Geoffrey Exoo, Jan Goedgebeur. Bounds for the smallest k-chromatic graphs of given girth |
| 0 | -- | 0 | Hongliang Lu, Qinglin Yu. Binding Number, Toughness and General Matching Extendability in Graphs |
| 0 | -- | 0 | Ville Junnila, Tero Laihonen, Gabrielle Paris. Solving Two Conjectures regarding Codes for Location in Circulant Graphs |
| 0 | -- | 0 | Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani. Consecutive patterns in restricted permutations and involutions |
| 0 | -- | 0 | Arnaud Mary, Yann Strozecki. Efficient enumeration of solutions produced by closure operations |
| 0 | -- | 0 | Carl Johan Casselgren, Petros A. Petrosyan. Some results on the palette index of graphs |
| 0 | -- | 0 | Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling |
| 0 | -- | 0 | Jonathan Klawitter. The agreement distance of rooted phylogenetic networks |
| 0 | -- | 0 | Feodor F. Dragan, Abdulhakeem Mohammed. Slimness of graphs |
| 0 | -- | 0 | Mélodie Lapointe. Number of orbits of Discrete Interval Exchanges |
| 0 | -- | 0 | Matthew Drescher, Guy Louchard, Yvik Swan. The Adaptive sampling revisited |
| 0 | -- | 0 | Konstantinos Georgiou, George Karakostas, Evangelos Kranakis. Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models |
| 0 | -- | 0 | Alexander Pilz. Planar 3-SAT with a Clause/Variable Cycle |
| 0 | -- | 0 | Laurent Beaudou, Richard C. Brewster. On the multipacking number of grid graphs |
| 0 | -- | 0 | Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann. Exact values for three domination-like problems in circular and infinite grid graphs of small height |
| 0 | -- | 0 | Jorge Almeida 0001, Ondrej Klíma 0001. On the insertion of n-powers |
| 0 | -- | 0 | Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel. $K_{1, 3}$-covering red and blue points in the plane |
| 0 | -- | 0 | Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek. Non-crossing paths with geographic constraints |
| 0 | -- | 0 | Danilo Korze, Aleksander Vesel. Packing coloring of generalized Sierpinski graphs |
| 0 | -- | 0 | Aijun Dong, Jianliang Wu. Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles |