Accepted Short Papers

(Published as 4 page papers in the proceedings and presented as posters during the conference)

Mathias Hauptmann, Richard Schmied and Claus Viehmann. On Approximation Complexity of Metric Dimension Problem
Robert Ganian. Thread graphs, linear rank-width and their algorithmic applications
Zareen Alamgir and Saira Karim. On Efficient Enumeration of Pseudo Bicliques
Maw-Shang Chang and Ling-Ju Hung. On the Recognition of Probe Ptolemaic Graphs
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. The (2,1)-total labeling number of outerplanar graphs is at most Δ+2
Konstanty Junosza-Szaniawski and Pawel Rzazewski. On improved exact algorithms for L(2,1)-labeling of graphs
Oudone Phanalasy, Mirka Miller, Leanne Rylands and Paulette Lieby. On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
Vladimir Estivill-Castro and Mahdi Parsa. Single parameter FPT-algorithms for non-trivial games