


default search action
Theoretical Computer Science, Volume 463
Volume 463, December 2012
- Fedor V. Fomin

, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Foreword: Special Issue on Theory and Applications of Graph Searching Problems. 1
- Dietmar Berwanger

, Erich Grädel, Lukasz Kaiser, Roman Rabinovich:
Entanglement and the complexity of directed graphs. 2-25 - MohammadAli Safari:

Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs. 26-34 - Jane Butterfield, Daniel W. Cranston

, Gregory J. Puleo, Douglas B. West, Reza Zamani:
Revolutionaries and spies: Spy-good and spy-bad graphs. 35-53 - James M. Carraher, Ilkyoo Choi

, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West:
Locating a robber on a graph via distance queries. 54-61 - Nicole Megow

, Kurt Mehlhorn, Pascal Schweitzer
:
Online graph exploration: New results on old and new algorithms. 62-72 - Daniel Meister, Jan Arne Telle:

Chordal digraphs. 73-83 - Isolde Adler, Tomas Gavenciak

, Tereza Klimosová
:
Hypertree-depth and minors in hypergraphs. 84-95 - Dariusz Dereniowski

:
Approximate search strategies for weighted trees. 96-113 - Carme Àlvarez, Josep Díaz

, Dieter Mitsche, Maria J. Serna
:
Continuous monitoring in the dynamic sensor field model. 114-122 - Przemyslaw Gordinowicz

, Richard J. Nowakowski
, Pawel Pralat
:
polish - Let us play the cleaning game. 123-132 - Athanasios Kehagias, Pawel Pralat

:
Some remarks on cops and drunk robbers. 133-147

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














