Scientific Programme
Monday
| 8:30 - 9:00 |
|
| 9:00 - 9:45 | Boting Yang - Fast Searching on Cartesian Products of Graphs |
| 9:45 - 10:30 | David Offner - Zombies can be Much Dumber than Cops |
| 10:30 - 11:00 |
|
| 11:00 - 11:45 | Fionn McInerney - Sequential Metric Dimension |
| 11:45 - 15:00 |
|
| 15:00 - 15:45 | Florian Lehner - Bounding the Cop-number of a Graph in terms of its Genus |
| 15:45 - 16:30 | Joshua Erde - Catching a Robber by Cutting Up a Surface |
| 16:30 - 17:00 |
|
| 17:00 - 18:00 | Open Problem Session |
Tuesday
| 9:00 - 9:45 | Pierre Fraigniaud - Topology of Search and Rendezvous Games |
| 9:45 - 10:30 | Bernadette Charron-Bost - MinMax Algorithms for Eventual Consensus |
| 10:30 - 11:00 |
|
| 11:00 - 11:45 | Akitoshi Kawamura - Simple Strategies versus Optimal Schedules in Multi-agent Patrolling |
| 11:45 - 15:00 |
|
| 15:00 - 15:45 | Stephane Devismes - A Lower Bound of Graph Exploration by a Swarm of Oblivious Robots |
| 15:45 - 16:30 | Christian Scheideler - Shape Recognition by a Finite Automaton Robot |
| 16:30 - 17:00 |
|
| 17:00 - 18:00 | Open Problem Session |
Wednesday
| 9:00 - 9:45 | Nicola Galesi - Cops-Robber Games and the Resolution Complexity of Tseitin Formulas |
| 9:45 - 10:30 | Franck Petit - Robustness: a New Form of Heredity Motivated by Dynamic Networks |
| 10:30 - 11:00 |
|
| 11:00 - 11:45 | Dimitrios Thilikos - A Linear Time Algorithm for Fixed Connected Pathwidth |
| 11:45 - 12:15 | Roman Rabinovich - Gralog, a tool for Graphs Programming and Presenting |
| 12:15 - 15:00 |
|
| 17:00 - 18:30 | Berliner Unterwelten Guided Tour |
| 19:30 - 23:00 | Dinner at the TV Tower |
Thursday
| 9:00 - 9:45 | Thomas Lidbetter - Bounds on the Burning Numbers of Spiders and Path-forests |
| 9:45 - 10:30 | Christophe Paul - A Polynomial Time Algorithm to Compute the Connected Tree-width of a Series-parallel Graph |
| 10:30 - 11:00 |
|
| 11:00 - 11:45 | Robert Ganian - The Power of Cut-Based Parameters for Computing Edge Disjoint Paths |
| 11:45 - 15:00 |
|