Tentative program


08:45 - 09:45
Reinhard Diestel - Invited talk
A unified duality theorem for width parameters in graphs and matroids
09:45 - 10:35
Thomas Erlebach and Michael Hoffmann
Minimum Spanning Tree Verification under Uncertainty
Thiago Marcilon, Samuel Nascimento and Rudini Sampaio
The maximum time of 2-neighbour bootstrap percolation: complexity results
10:35 - 11:00
Coffee break
11:00 - 12:15
Petr Golovach, Pinar Heggernes, Pim Van't Hof and Christophe Paul
Hadwiger Number of Graphs with Small Chordality
Paul Bonsma
Independent Set Reconfiguration in Cographs
Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickael Montassier and Juraj Stacho.
Contact Representations of Planar Graph: Rebuilding is Hard
12:15 - 14:00
14:00 - 14:50
Satoru Iwata, Alantha Newman and R. Ravi
Graph TSP from Steiner Cycles
Stefan Hougardy and Rasmus T. Schroeder
Edge Elimination in TSP Instances
15:00 - 23:30
Social event


08:45 - 10:25
Oliver Schaudt and Eglantine Camby
A new characterization of Pk-free graphs
Oliver Schaudt, Andrea Oversberg and Van Bang Le.
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs
Felix Joos
A Characterization of Mixed Unit Interval Graphs
Ross Mc Connell, Nathan Lindzey, Vinicius F. Dos Santos, Pinar Heggernes, Jeremy Spinrad and Petr Golovach
Recognizing Threshold Tolerance Graphs in O(n^2) Time
10:25 - 10:50
Coffee break
10:50 - 12:30
Sigve Hortemo Sæther and Jan Arne Telle
Between Treewidth and Clique-width
Isolde Adler, Mamadou Kanté and O-Joung Kwon
Linear rank-width of distance-hereditary graphs
Antoine Mamcarz and Michel Habib
Colored modular and split decompositions of graphs with applications to trigraphs
Gengchun Xu and Qian-Ping Gu
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
12:30 - 14:15
14:15 - 15:55
Kustaa Kangas, Petteri Kaski, Mikko Koivisto and Janne Korhonen
On the Number of Connected Sets in Bounded Degree Graphs
Radoslav Fulek.
Towards Hanani-Tutte Theorem for Clustered Graphs
Aistis Atminas, Andrew Collins, Jan Foniok and Vadim V. Lozin
Deciding the Bell number for hereditary graph properties
Petr Golovach, Daniel Paulusma and Erik Jan van Leeuwen.
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
15:55 - 16:20
Coffee break
16:20 - 18:00
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew and Deepak Rajendraprasad
Boxicity and separation dimension
Michael Lampis, Kazuhisa Makino, Valia Mitsou and Yushi Uno
Parameterized Edge Hamiltonicity
Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt
Structural parameterizations for boxicity
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier and Martin Rötzschke
The Parameterized Complexity of the Rainbow Subgraph Problem


08:45 - 09:45
Pierre Fraigniaud - Invited talk
Local distributed computing
09:45 - 11:00
Hadas Shachnai and Meirav Zehavi
Parameterized Algorithms for Graph Partitioning Problems
Manu Basavaraju, Pinar Heggernes, Pim van 'T Hof, Reza Saei and Yngve Villanger
Maximal induced matchings in triangle-free graphs
10:35 - 11:00
Coffee break
11:00 - 12:15
Gregory Gutin, Mark Jones, Bin Sheng and Magnus Wahlström
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs
Leo van Iersel and Steven Kelk
Kernelizations for the hybridization number problem on multiple nonbinary trees
Stéphan Thomassé, Nicolas Trotignon and Kristina Vuskovic
A polynomial Turing-kernel for weighted independent set in bull-free graphs
12:15 - 14:00
14:00 - 15:40
Rajiv Gandhi and Guy Kortsarz
Edge Covering with Budget Constrains
Nieke Aerts and Stefan Felsner
Vertex Contact Graphs of Paths on a Grid
Basile Couëtoux, Elie Nakache and Yann Vaxès
The Maximum Labeled Path Problem
Eric Aaron, Danny Krizanc and Elliot Meyerson
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs