Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017

Spyros Angelopoulos 1 Pierre Fraignaud 2 Fedor Fomin 3 Nicolas Nisse 4, 5 Dimitrios M. Thilikos 6, 7
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
2 IRIF - Institut de Recherche en Informatique Fondamentale
3 Department of Informatics
4 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
5 I3S - Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis
6 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
7 Department of Mathematics [Athens]
Abstract : 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. 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. As a result, many researchers from different areas of Mathematics, Computer Science and Operations Research are interested in problems related to graph searching. GRASTA 2017 is the main forum on graph searching and was held at the Anogia Academic Village, Anogia, Crete, Greece. It gathered 39 researchers from diverse areas of Theoretical Computer Science and Discrete Mathematics related to Graph Searching Games and their Applications both from the applied and the theoretical point of view. The scientific program of the workshop consisted of 18 regular talks, and an open problem session.
Type de document :
Rapport
[Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017
Liste complète des métadonnées

Littérature citée [41 références]  Voir  Masquer  Télécharger
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01645614
Contributeur : Dimitrios M. Thilikos <>
Soumis le : jeudi 23 novembre 2017 - 10:17:49
Dernière modification le : vendredi 16 novembre 2018 - 02:09:20

Fichier

report_GRASTA_2017.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-01645614, version 1

Collections

LIRMM | I3S | UPMC | TDS-MACS | ALGCO | INRIA | LARA | USPC | LIP6 | INRIA2017 | MIPS | UNIV-MONTPELLIER | UNICE | UNIV-COTEDAZUR | SORBONNE-UNIVERSITE

Citation

Spyros Angelopoulos, Pierre Fraignaud, Fedor Fomin, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017. [Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017. 〈lirmm-01645614〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

1137

Téléchargements de fichiers

188

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD