Program

Lunches are between 12:15 and 13:15, and Dinners are between 19:15 and 20:15.
Be careful, this is very (very) strict.

Monday, May 16th

15:00 - 16:00	Arrival, Registration, Welcome
16:00 - 17:00	Combinatorial Games, chair: Dimitrios Thilikos Nacim Oijid, LIRIS, Lyon, France Incidence, a scoring positional game (slides) Milos Stojakovic, Univ. of Novi Sad, Serbia Generalised Turan Game
17:00 - 17:30	Coffee Break
17:30 -	First Open Problems session, chair: Dimitrios Thilikos
19:15-20:15	Dinner

Tuesday, May 17th

09:30 - 10:30	Searching in a Graph, chair: Pierre Fraigniaud Spyros Angelopoulos, LIP6, CNRS, Paris, France Online search with hints. Arnaud Labourel, LIS, Univ. Aix Marseille, CNRS, France Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs (slides)
10:30 - 11:00	Coffee Break
11:00 - 12:00	Second Open Problems session, chair: Fedor Fomin
12:15-13:15	Lunch
14:00 - 15:00	Mobile agents / Distributed Computing, chair: Spyros Angelopoulos Stéphane Devismes, Univ. Picardie Jules Verne, France Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. (slides) David Ilcinkas, CNRS, LaBRI, Bordeaux, France Certifying in Coq results on mobile agents: a user perspective (slides)
15:00 - 16:00	Free working time
16:00 - 16:30	Coffee Break
16:30 -	Free working time
19:15-20:15	Dinner

Wednesday, May 18th

09:30 - 10:30	Cops and Robber games / Burning games, chair: Nicolas Nisse Shahin Kamali, University of Manitoba, Canada A Review of the Graph Burning Problem (slides) Harmender Gahlawat‬, Ben-Gurion University of the Negev, Israel The game of Cops and Robber on string graphs (slides)
10:30 - 11:00	Coffee Break
11:00 - 11:30	Petr Golovach, Univ. Bergen, Norway Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs
12:15-13:15	Lunch
	Social event (and/or Free working time)
19:15-	Dinner

Thursday, May 19th

09:30 - 10:30	Graph Decompositions, chair: Christophe Paul Thomas Dissaux, Univ. Cote d'Azur, Inria, CNRS, I3S, France Treelength and pathlength of subclasses of planar graphs (slides) Martin Milanic, FAMNIT and IAM, Univ. of Primorska, Slovenia Tree decompositions with bounded independence number and their algorithmic applications (slides)
10:30 - 11:00	Coffee Break
11:00 - 11:30	Robert Ganian, Technische Universität Wien, Institute of Logic and Computation, Austria A Unifying Framework for Characterizing and Computing Width Measures (slides)
12:15-13:15	Lunch
14:00 - 15:00	Temporal Graphs, chair: Fionn Mc Inerney Nicola Santoro, Carleton Univ., Canada Cop and Robber Games in Temporal Graphs. Petra Wolf, Trier Univ., Germany Edge Periodic Temporal Graphs: (slides)
15:00 - 16:00	Free working time
16:00 - 16:30	Coffee Break
16:30 -	Return on Open Problems, chair: Nicolas Nisse
19:15-20:15	Dinner

Friday, May 20th

09:30 - 10:30	Graph searching, chair: Victor Chepoi Sebastian Wiederrecht, LIRMM, Montpellier, France On tangles cops & robber in digraphs. Christophe Paul, LIRMM, CNRS, Université Montpellier, France Mixed search games are monotone
10:30 - 11:00	Coffee Break
11:00 - 11:30	Arnaud de Mesmay, CNRS, Gipsa-lab, Grenoble, France Homotopy height: searching a planar graph with simple closed curves. (slides)
12:15-13:15	Lunch
14:30	Departure (be careful, the departure of the boat is very strict)