Program

Monday, 31th March

9:00 - 10:30	Registration, Welcome
10:30 -11:30	Keynote 1
	Bill Kinnersley, Ryerson University, Toronto, Canada The computational complexity of Cops and Robbers
11:30 - 12:00	Tomas Gavenciak, Charles University, Prague, Czech Republic Cops and Robber in geometric intersection graphs (slides)
12:15 - 14:15	Lunch
14:15 - 15:45	Jérémie Chalopin, CNRS, LIF, Univ. Aix-Marseille, France Cop and robber game and hyperbolicity: (slides) Athanasios Kehagias, Aristotle Univ. of Thessaloniki, Greece The cost of drunkenness for visible and invisible robbers: (slides) Nicolas Nisse, Inria, Univ. Nice Sophia Antipolis, CNRS, I3S Fractional Combinatorial Two-Player Games (slides)
15:45 - 16:15	Coffee Break
16:15 - 18:00	Open Problems session

Tuesday, 1st April

09:30 - 10:30	Jan Arne Telle, Univ. of Bergen, Norway Similarity of treewidth and MM-width by a cops and robber game (slides) Roman Rabinovich, Technische Universität Berlin, Germany Monotonicity in directed cops and robber games (slides)
10:30 - 11:00	Coffee Break
11:00 - 12:00	Dimitrios Thilikos, AlGCo project-team, CNRS, LIRMM, France and Department of Mathematics, University of Athens, Greece Contraction obstructions for connected graph searching O-joung Kwon, Dept of Math. Sciences, KAIST, South Korea Minor closedness property for variants of treewidth (slides)
12:15 - 14:15	Lunch
14:15 - 16:00	Working session
16:00 - 16:30	Coffee Break
16:30 - 18:00	Working session

Wednesday, 2nd Arpril

09:30 -10:30	Keynote 2
	David Peleg, Weizmann Institute of Science, Israel Searching hidden Structures and Activities in Large Networks
10:30 - 11:00	Coffee Break
11:00 - 12:00	Spyros Angelopoulos, LIP6, CNRS, Univ. Paris 6, France Searching with turn cost and related problems (slides) Thomas Lidbetter, London School of Economics, UK Expanding search on a network (slides)
12:15 - 14:00	Lunch
14:00 - 19:00	Excursion
20:00 -	Gala dinner

Thursday, 3rd April

09:00 - 10:30	Dominik Pajak, LaBRI, Inria, Univ. Bordeaux, France Bounds on the Cover Time of Parallel Rotor Walks (slides) Dariusz Dereniowski, Gdansk University of Technology, Poland Connected graph searching: a distributed algorithm (slides) Dieter Mitsche, Lab. J.A.Dieudonné, Univ. Nice-Sophia Antipolis A note on the acquaintance time of random graphs (slides)
10:30 - 11:00	Coffee Break
11:00 - 12:00	Katerina Papadaki, London School of Economics, UK Patrolling Games (slides) Margaret-Ellen Messinger, Mount Allison University, Canada The (all guards move) Eternal Domination number for 3 x n grids (slides)
12:15 - 14:15	Lunch
14:15 - 16:00	Working session
16:00 - 16:30	Coffee Break
16:30 - 18:00	Open Problems session

Friday, 4th April

09:30 - 10:30	Sheng-Lung Peng, National Dong Hwa University, Taiwan On the Minimum Node and Edge Searching Spanning Tree Problems (slides) David Coudert, Inria, Univ. Nice Sophia Antipolis, CNRS, I3S Practical computation of pathwidth (slides)
10:30 - 11:00	Coffee Break
11:00 - 11:30	Euripides Markou, University of Thessaly, Lamia, Greece Exclusive Graph Searching in Various Graph Classes (slides)
12:00 - 13:30	Lunch
	End of the conference, departure of the shuttle for Ajaccio after lunch