Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on the topic "Theory and Applications of Graph Searching". The scope of the issue is inspired by, but not limited to papers presented in the 8th International Workshop on Graph Searching: Theory and Algorithms (GRASTA 2017).
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 which may be modeled by a graph. Many variants of graph searching have been studied in the literature, such as pursuit-evasion games or cops and robbers games. These variants are either application driven, i.e., motivated by settings of practical interest, or are inspired by foundational issues at the intersection of Computer Science, Discrete Mathematics, and Artificial Inteligence. As a result, graph searching has attracted significant interest from different areas of Mathematics, Computer Science and Operations Research.
With this Special Issue, we aim to further foster research in the area of Graph Searching by presenting recent results and directions for future research. The purpose of the Special Issue is to highlight recent research both from the applied and the theoretical point of view. Topics of interest include (but are not limited to) the following:
Graph Searching and Logic
Graph Parameters Related to Graph Searching
Graph Searching and Robotics
Conquest and Expansion Games
Search, Patrolling and Surveillance Games
Graph Searching and Robotics
Conquest and Expansion Games
Database Theory and Robber and Marshals Games
Probabilistic Techniques in Graph Searching
Monotonicity and Connectivity in Graph Searching
New Variants and Performance Measures of Graph Searching
Graph Searching and Distributed Computing
Graph Searching and Network Security
Searching on Unbounded Domains
Submission format and guidelines
All submissions must contain original work in English. The manuscript and any supplementary material should be submitted using the Elsevier Editorial System (EES) at http://ees.elsevier.com/tcs. The authors must select "SI: Graph_Searching_GRASTA17" when they reach the "Article Type" step in the submission process. All submitted papers will be refereed according to the rigorous standards of TCS. The editorial team will make all effort to ensure the timely completion of the refereeing process. Requests for additional information should be addressed to the guest editors.
Important dates
Submission deadline: October 30, 2017
Final decision notification: August 30, 2018
Publication of special issue: November 30, 2018
Guest Editors
Spyros Angelopoulos
Nicolas Nisse
Dimitrios M. Thilikos
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
