Journal: Discrete Mathematics & Theoretical Computer Science

Volume 12, Issue 1

1 -- 12Therese C. Biedl, Michal Stern. On edge-intersection graphs of k-bend paths in grids
13 -- 20Taras O. Banakh, Artem Dudko, Dusan Repovs. Symmetric monochromatic subsets in colorings of the Lobachevsky plane
21 -- 38Christian Choffrut, Achille Frigeri. Deciding whether the ordering is necessary in a Presburger formula
39 -- 58Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer. Tight Bounds for Delay-Sensitive Aggregation
59 -- 74Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz. Acyclic colourings of graphs with bounded degree
75 -- 86Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood. Edge-Removal and Non-Crossing Configurations in Geometric Graphs
87 -- 100Lukasz Kowalik, Borut Luzar, Riste Skrekovski. An improved bound on the largest induced forests for triangle-free planar graphs
101 -- 108Jakub Przybylo, Mariusz Wozniak. On a 1, 2 Conjecture
109 -- 122Vincent Vajnovszki. Generating involutions, derangements, and relatives by ECO