Logic List Mailing Archive

Special Issue on "Graph Searching", Theoretical Computer Science

CALL FOR PAPERS
THEORETICAL COMPUTER SCIENCE
Special Issue on Graph Searching
http://www.ii.uib.no/~fomin/fedor/TCS.html

Manuscripts are solicited for a special issue in the journal Theoretical
Computer Science (TCS) on Graph Searching and related parameters. 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. With this 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.
Potential topics include (but are not limited to) the following:

- Search Games
- Cop-Robbers games
- Marshal Games
- Conquest and Expansion Games
- Pursuit-Evasion Games
- Monotonicity and Connectivity in Graph Searching
- Graph Parameters Related to Graph Searching
- Min-Max Theorems in Graph Searching
- New Variants of Graph Searching
- Applications of Graph Searching in Computer Science

Submissions in PostScript or PDF format should be send by email to

    Dimitrios M. Thilikos (sedthilk@math.uoa.gr)

with copies to Fedor Fomin (fomin@ii.uib.no) and Pierre Fraigniaud 
(pierre@lri.fr).

Submissions must be received before March 31, 2007.

Manuscripts should be prepared according to the guidelines of TCS. 
Papers will be refereed according to the standards of TCS. We promise 
to do our best to have the refereeing procedure timely finished. Please 
contact the guest editors for additional information

Guest Editors

Fedor V. Fomin
Pierre Fraigniaud
Dimitrios M. Thilikos