This is to announce that the deadline for submissions to the Special
Issue of Theoretical Computer Science has been extended to February 15,
2023.
With best regards,
Dimitrios, Nicolas, Pierre and Spyros
On 2022-09-04 21:29, Spyros Angelopoulos wrote:
> Call For Papers--Theoretical Computer Science.
> Special Issue on "Graph Searching: Theory and Applications".
>
> We invite submissions to a special issue of 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 10th International Workshop
> on Graph Searching:
> Theory and Algorithms (GRASTA 2022), which took place in Porquerolles,
> France, May 16-20 2002.
>
> 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 robber
> 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
> Intelligence. 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, predominantly from the theoretical point of
> view. Topics of interest
> include (but are not limited to) the following:
>
> Cops and Robbers Games
> Conquest and Expansion Games
> Search, Patrolling and Surveillance Games
> Graph Parameters Related to Graph Searching
> Graph Searching and Logic
> Graph Searching and Theory of Robotic Search
> 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 in Unbounded Domains
>
>
> Submission format and guidelines
> All submissions must contain original work and be written in English.
> The manuscript and any
> supplementary material should be submitted using the Elsevier Editorial
> System (EES) at https://www.editorialmanager.com/TCS. The authors must
> select "VSI: GRASTA_2022" 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: February 15, 2023
> Final decision notification (tentative): December 30, 2023
> Publication of special issue (tentative): March 30, 2024
>
>
> Guest Editors:
>
> Spyros Angelopoulos
> Pierre Fraigniaud
> Nicolas Nisse
> Dimitrios 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
