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