9th workshop on GRAph Searching, Theory & Applications
Berlin, 24 - 27 September 2018
Technische Universität Berlin

Scope of the Event

Graph Searching involves a team of mobile agents (called searchers or pursuers or cops) that aims at capturing a set of escaping agents (called evaders or fugitives or robbers) that hide in a network modeled by a graph. There are many variants of graph searching studied in the literature, often referred to as a pursuit-evasion game or cops and robbers game. In particular, the graph searching games may vary significantly according to the capabilities of the evaders and the pursuers in terms of relative speed, sensor capabilities, visibility, etc. Also, the notion of capture itself admits several interpretations.

These variants are either application driven, i.e. motivated by problems in practice, or are inspired by foundational issues at the intersection of Computer Science, Discrete Mathematics, and Artificial Inteligence. In what follows, we mention some areas in which Graph Searching has significant (practical and fundamental) applications.

The aim of this workshop is to bring together researchers working in these areas in order to exchange problems, ideas, techniques, and results. The objective is to create a clearer picture of the state of the art in the field, to identify outstanding open problems and research directions, and to foster collaborative investigation of selected problems.

Scientific Committee

Organising Committee