Dagstuhl-Seminar 11071
Theory and Applications of Graph Searching Problems (GRASTA 2011)
( 13. Feb – 18. Feb, 2011 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/11071
Organisatoren
- Fedor V. Fomin (University of Bergen, NO)
- Pierre Fraigniaud (University of Paris VII, FR)
- Stephan Kreutzer (TU Berlin, DE)
- Dimitrios M. Thilikos (University of Athens, GR)
Kontakt
- Andreas Dolzmann (für wissenschaftliche Fragen)
Impacts
- Cops and invisible robbers : the cost of drunkenness : article pp. 100-120 - Kehagias, Athanasios; Mitsche, Dieter; Pralat, Pawel - Amsterdam : Elsevier, 2013 - (Theoretical computer science : 481. 2013, pp. 100-120).
- Parameterized complexity of firefighting : article : pp. 1285-1297 - Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor V.; van Leeuwen, Erik Jan - Amsterdam : Elsevier, 2014 - (Journal of computer and system sciences : 80. 2014).
- Special Issue on Theory and Applications of Graph Searching Problems : pp. 1-148 - Thilikos, Dimitrios M.; Fomin, Fedor V.; Fraigniaud, Pierre; Kreutzer, Christoph - Amsterdam : Elsevier, 2012 - (Theoretical computer science : 463. 2012).
Programm
Graph searching is often referred to, in a more playful language, as a pursuit-evasion game (or, alternatively, cops and robbers game). This is a kind of game where one part is a set of escaping mobile entities, called evaders (or fugitives), that hide in a graph representing a network, and the other part is a number of chasing agents, called searchers (or pursuers), that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers in terms of relative speed, sensor capabilities, visibility, etc. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations.
Graph searching revealed the need to express in a formal mathematical way intuitive concepts such as avoidance, surrounding, sense of direction, hiding, persecution, and threatening. There are many variants of graph searching studied in the literature, which are either application driven, i.e. motivated by problems in practice, or are inspired by foundational issues in Computer Science, Discrete Mathematics, and Artificial Intelligence including
- Information Seeking
- Robot motion planning
- Graph Theory
- Database Theory and Robber and Marshals Games
- Logic
- Distributed Computing
- Models of computation
- Network security
The objective of the seminar was to bring researchers from the widest possible variety of disciplines related to graph searching and we will especially encourage the maximum interplay between theory and applications. The meeting initiated the exchange of research results, ideas, open problems and discussion about future avenues in Graph Searching. As a fruit of this encounter new research results, open problems, and methodologies will appeared, especially those of interdisciplinary character.
- Isolde Adler (Goethe-Universität - Frankfurt a. M., DE) [dblp]
- Carme Alvarez (UPC - Barcelona, ES)
- Spyros Angelopoulos (CNRS - Paris, FR) [dblp]
- Dietmar Berwanger (ENS - Cachan, FR) [dblp]
- Lélia Blin (UPMC - Paris, FR)
- Nancy Clarke (Acadia University - Wolfville, CA)
- Dariusz Dereniowski (Gdansk University of Technology, PL)
- Josep Diaz (UPC - Barcelona, ES)
- Amalia Duch Brown (UPC - Barcelona, ES) [dblp]
- Fedor V. Fomin (University of Bergen, NO) [dblp]
- Pierre Fraigniaud (University of Paris VII, FR) [dblp]
- Petr A. Golovach (University of Bergen, NO) [dblp]
- Gena Hahn (University of Montréal, CA)
- Pinar Heggernes (University of Bergen, NO) [dblp]
- Paul Hunter (University of Oxford, GB)
- David Ilcinkas (University of Bordeaux, FR)
- Marcin Jurdzinski (University of Warwick - Coventry, GB) [dblp]
- Marcin Kaminski (Free University of Brussels, BE) [dblp]
- Athanasios Kehagias (Aristotle University of Thessaloniki, GR)
- Stephan Kreutzer (TU Berlin, DE) [dblp]
- Andrei Krokhin (Durham University, GB) [dblp]
- Margaret-Ellen Messinger (Mount Allison University - Sackville, CA)
- Zoltan Miklos (EPFL - Lausanne, CH)
- Dieter Mitsche (UPC - Barcelona, ES)
- Nicolas Nisse (INRIA Sophia Antipolis - Méditerranée, FR)
- Jan Obdržálek (Masaryk University - Brno, CZ) [dblp]
- Xavier Perez Gimenez (MPI für Informatik - Saarbrücken, DE)
- Pawel Pralat (West Virginia Univ. - Morgantown, US)
- Maria Serna (UPC - Barcelona, ES)
- Dimitrios M. Thilikos (University of Athens, GR) [dblp]
- Tomáš Valla (Charles University - Prague, CZ)
- Erik Jan van Leeuwen (Sapienza University of Rome, IT) [dblp]
- Peter Widmayer (ETH Zürich, CH) [dblp]
- Boting Yang (University of Regina, CA)
Klassifikation
- AI/ robotics
- data bases/ information retrieval
- data structures/ algorithms/ complexity
- hardware
- modelling/simulation
- networks
- optimization/ scheduling
- security/cryptography
- verification/logic
- WWW/internet
- interdisciplinary
Schlagworte
- Graph Searching
- Pursuit Evasion Games
- Cop and Robber Games
