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