Vol 12, No 1 (2010)

Table of Contents

Automata, Logic and Semantics

Deciding whether the ordering is necessary in a Presburger formula PDF PostScript
Christian Choffrut, Achille Frigeri 21-38

Combinatorics

Symmetric monochromatic subsets in colorings of the Lobachevsky plane PDF PostScript
Taras Banakh, Artem Dudko, Dušan Repovš 13-20
Generating involutions, derangements, and relatives by ECO PDF PostScript
Vincent Vajnovszki 109-122
On the existence of block-transitive combinatorial designs PDF PostScript
Michael Huber 122-132

Distributed Computing and Networking

Tight Bounds for Delay-Sensitive Aggregation PDF PostScript
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer 39-58

Graphs and Algorithms

On edge-intersection graphs of k-bend paths in grids PDF PostScript
Therese Biedl, Michal Stern 1-12
Acyclic colourings of graphs with bounded degree PDF PostScript
Mieczysław Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elżbieta Sidorowicz 59-74
Edge-Removal and Non-Crossing Configurations in Geometric Graphs PDF PostScript
Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood 75-86
An improved bound on the largest induced forests for triangle-free planar graphs PDF PostScript
Lukasz Kowalik, Borut Lužar, Riste Škrekovski 87-100
On a 1,2 Conjecture PDF PostScript
Jakub Przybyło, Mariusz Woźniak 101-108


ISSN: 1365-8050