GRASTA 2014
6th Workshop on GRAph Searching, Theory and Applications

large size image Report and Open Problems

Objectives

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 modelled 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.

These variants are either application driven, i.e. motivated by problems in practice, or are inspired by foundational issues in Computer Science, Discrete Mathematics, and Artificial Inteligence, including:

• Information Seeking
• Robot Motion Planning
• Graph Theory
• Database Theory and Robber and Marshals Games
• Logic
• Distributed Computing
• Models of Computation
• Routing in Telecommunication Networks
• Network Security

More about Graph searching here.

GRASTA aims at bringing together various researchers and research groups working with problems related to Graph Searching both from the applied and the theoretical point of view.

Previous editions

This workshop would be the 6th edition of a fruitful stream of meetings in Anogia (Oct. 2006), Redonda (Feb. 2008), Valtice (Oct. 2009), Dagstuhl (Feb. 2011) and Banff (Oct. 2012).

Organizing and Scientific Comittee

• Fedor V. Fomin, University of Bergen, Norway
• Pierre Fraigniaud, CNRS and University Paris Diderot, France
• Nicolas Nisse, Inria et Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France
• Dimitrios M. Thilikos, AlGCo project-team, CNRS, LIRMM, France and Department of Mathematics, University of Athens, Greece