[20:00-21:30:] Problem session
[10:35-11:10:] Mickael Montassier,
(k,j)-colouring of sparse graphs
[11:10-11:45:] Andre Raspaud,
Homomorphisms of sparse graphs to small graphs
[11:45-12:15:] Zoltán Szigeti, Partition
constrained edge-connectivity augmentation of a hypergraph
[12:15-15:00:] Lunch followed by a break
[15:00-15.35:] Tibor Jordan, Body-bar
graphs with unique d-dimensional realizations
[15:35-16:05:] Inge Li Gørtz, Minimum
makespan dial-a-ride
[16:05-16:30:] Coffee
[16:30-17:05:] Daniel Goncalves, The
spanning galaxy problem
[17:05-17:35:] Hajo Broersma, Three
complexity results on coloring Pk-free graphs
[17.35-18.20:] Gregory Gutin,
Polynomial-size kernels for problems parametrized above tight lower
bounds
[18:45-] dinner
[10:40-11:10:] Coffee
[11:10-11:45:] Jochen Harant, A
generalization of Tutte's theorem on Hamiltonian cycles in planar
graphs
[11:45-12:20:] Zoltan Kiraly, Maximum
number of cycles and hamiltonian cycles in sparse graphs
[12:20-12:50:] Stefane Bessy,
Partitioning a graph into a cycle and an anticycle - a proof of Lehel's
Conjecture
[12:50-15:30] Lunch followed by a break
[15:30-16:05:] Stephan Brandt, Minimum degree
and density of binary
sequences
[16:05-16:35:] Michael Stiebitz, The
Erdös-Lovász Tihany problem
[16:35-17:00:] Coffee
[17:00-17:35:] Bojan Mohar, Chromatic
number and complete graph substructure for degree sequences
[19:00-] Conference dinner
[10:05-10:35:] Coffee
[10:35-11:10:] Dieter Rautenbach, Bounds
on the independence number of a graph
[11:10-11:40:] Ken-ichi Kawarabayashi,
Graphs without subdivisions
[11:50-14:30:] Lunch followed by departure