|
|
Monday, April 10 |
Tuesday, April 11 |
Wednesday, April 12 |
Thursday, April 10 |
|
08:00—08:45 |
Breakfast |
Breakfast |
Breakfast |
Breakfast |
|
08:45–09:00 |
Wellcome to GRASTA 2017 |
|
|
|
|
09:00–10:00 |
Anthony Bonato: Graph Searching Games and Probabilistic Methods |
Dariusz Dereniowski: Graph Exploration Algorithms |
Minko Markov: The sweeping of planar shapes: a geometric analogue of graph searching |
Akitoshi Kawamura: Open problems on optimal patrolling |
|
10:00–10:30 |
Break |
Break |
Break |
Break |
|
10:30–11:00 |
Nancy Clarke: Cops and Robbers with Gangs |
Pascal Schweitzer: Online graph exploration |
David Kirkpatrick: Minimizing uncertainty in the proximity of moving agents |
Katerina Papadaki: Patrolling continuous networks |
|
11:00–11:30 |
Konstantinos Stavropoulos: Cops, Robber and Medianwidth Parameters |
Michael Fellows: Searching for a Hidden Flaw: Some Results on Minesweeper of 3-Coloring |
Thomas Lidbetter: Using a best response oracle to solve search games on graphs |
Petr Golovach: How to hunt an invisible rabbit on a graph |
|
11:30–12:00 |
|
Przemysław Gordinowicz: Those Magnificent Blind Cops in Their Flying Machines with Sonars |
|
Athanasios Kehagias: Games of selfish cops and robbers |
|
12:00–13:00 |
|
|
|
|
|
13:00–14:00 |
Lunch |
Lunch |
Lunch |
Lunch |
|
14:00–15:00 |
|
|
|
|
|
15:00–16:00 |
Konstantinos Panagiotou: Optimal Strategies for Weighted Search Problems |
|
Amos Korman: From Ants to Query Complexity |
|
|
16:00–16:30 |
Break |
|
Break |
|
|
16:30–17:00 |
Christophe Paul: Connected search against a lazy robber |
|
Open problems |
|
|
17:00–17:30 |
Tomáš Gavenčiak: Cop number of string graphs |
|
Open problems |
|
|
17:30–19:30 |
|
|
|
|
|
20:00– |
Dinner (Arodamos) |
|
Dinner (Delina) |
|
|
|
|
|
|
|
|
|
|
|
|
|