| 1 | -- | 12 | Sergio Cabello, Maria Saumell. A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| 13 | -- | 32 | Louis DeBiasio, Safi Faizullah, Imdadullah Khan. Ore-degree threshold for the square of a Hamiltonian cycle |
| 33 | -- | 66 | Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper. An Approximability-related Parameter on Graphs - Properties and Applications |
| 67 | -- | 78 | Akbar Davoodi, Behnaz Omoomi. On the 1-2-3-conjecture |
| 79 | -- | 88 | Jernej Azarija, Sandi Klavzar, Jaehun Lee, Yoomi Rho. Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes |
| 89 | -- | 96 | Koen Thas. Classification of skew translation generalized quadrangles, I |
| 97 | -- | 102 | Grant Cairns, Stacey Mendan. Symmetric Bipartite Graphs and Graphs with Loops |
| 103 | -- | 122 | Anton Pierre de Villiers, Alewyn Petrus Burger, Jan Harm van Vuuren. Edge stability in secure graph domination |
| 123 | -- | 144 | Helmut Prodinger, Stephan G. Wagner. Bootstrapping and double-exponential limit laws |
| 145 | -- | 160 | Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman. Avoider-Enforcer star games |
| 161 | -- | 168 | Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall. Guarded subgraphs and the domination game |
| 169 | -- | 186 | Mauricio Soto, Christopher Thraves Caro. p-Box: A new graph model |
| 187 | -- | 200 | Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter. On probe co-bipartite and probe diamond-free graphs |
| 201 | -- | 218 | Graham Farr. Cost-effectiveness of algorithms |
| 219 | -- | 240 | Olga Bodroza-Pantic, Harris Kwong, Milan Pantic. A Conjecture on the Number of Hamiltonian Cycles on Thin Grid Cylinder Graphs |
| 241 | -- | 254 | Adel Alahmadi, Robert E. L. Aldred, Ahmad Alkenani, Rola Hijazi, Patrick Solé, Carsten Thomassen. Extending a perfect matching to a Hamiltonian cycle |
| 255 | -- | 282 | Michael Anthony Henning, Viroshan Naicker. Graphs with Large Disjunctive Total Domination Number |
| 283 | -- | 306 | Vojtech Vorel, Adam Roman. Parameterized Complexity of Synchronization and Road Coloring |
| 307 | -- | 308 | François Gonze, Raphaël M. Jungers, Avraham Trakhtman. A Note on a Recent Attempt to Improve the Pin-Frankl Bound |
| 309 | -- | 316 | Hossein Ghasemalizadeh, Mohammadreza Razzazi. Output sensitive algorithm for covering many points |
| 317 | -- | 338 | Avleen Kaur Malhi, Shalini Batra. An Efficient Certificateless Aggregate Signature Scheme for Vehicular Ad-Hoc Networks |
| 339 | -- | 356 | Mikko Pelto. Maximum difference about the size of optimal identifying codes in graphs differing by one vertex |
| 357 | -- | 368 | Ludwig Staiger. On the Hausdorff measure of regular ω-languages in Cantor space |
| 369 | -- | 382 | Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki. Snarks with total chromatic number 5 |
| 382 | -- | 394 | Bridget Eileen Tenner. Intervals and factors in the Bruhat order |
| 395 | -- | 412 | Gregory Ross Maloney. On substitution tilings of the plane with n-fold rotational symmetry |
| 415 | -- | 444 | Kimball Martin, Krishnan Shankar. How often should you clean your room? |