[DMANET] Special issue in TCS on 'Theory and Applications of Graph Searching Problems' (GRASTA), submission open

Call for Papers
Theoretical Computer Science (TCS)

Special Issue:
GRASTA'14, 6th Workshop on GRAph Searching, Theory and Applications
Carg=E8se, Corsica, France, 2014
http://www-sop.inria.fr/coati/events/grasta2014/

Manuscripts are solicited for a special issue in the journal =
=91=91Theoretical Computer Science=92=92 (TCS) on =91=91Theory and =
Applications of Graph Searching Problems=92=92.

Graph searching is often referred to, in a more playful language, as a =
pursuit-evasion game. This is a kind of game where one part is a set of =
evaders, that hide in a graph representing a network, and the other part =
is a team of pursuers, that move systematically in the graph. The game =
may vary significantly according to the capabilities of the evaders and =
the pursuers. The objective of the game is to capture the evaders in an =
optimal way, where the notion of optimality itself admits several =
interpretations. The area of Graph Searching has become a very active =
research area in theoretical computer science and discrete mathematics, =
with impact and applications in various domains.=20

With this Special Issue, we wish to foster research in the area by =
exposing new results and directions for further research.
The purpose of the issue is to put together various recent results =
related to Graph Searching both from the applied and the theoretical =
point of view.=20

Potential topics include (but are not limited to) the following:
=95 Graph Searching and Logic
=95 Graph Parameters Related to Graph Searching
=95 Graph searching and Robotics
=95 Conquest and Expansion Games
=95 Database Theory and Robber and Marshals Games
=95 Probabilistic Techniques in Graph Searching
=95 Monotonicity and Connectivity in Graph Searching
=95 New Variants of Graph Searching
=95 Graph Searching and Distributed Computing
=95 Graph Searching and Network Security

Submissions should be made in PDF format using the standard TCS =
submission system at http://ees.elsevier.com/tcs/ (select the article =
type =93SI: GRASTA 2014=94)
Papers will be refereed according to the standards of TCS.

Submissions must be received before March 31, 2015.

Please contact the guest editors for additional information.

We are looking forward to receiving your contribution.

The Guest Editors,

Fedor V. Fomin
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/
*
**********************************************************