![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 399
Volume 399, Numbers 1-2, June 2008
- Paola Flocchini, Leszek Gasieniec:
Preface. 1-2
- Amotz Bar-Noy, Richard E. Ladner
, Tami Tamir:
Optimal delay for media-on-demand with pre-loading and pre-buffering. 3-11 - Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed chasing of network intruders. 12-37 - Tiziana Calamoneri
, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria
, Angelo Monti, Riccardo Silvestri:
Minimum-Energy Broadcast and disk cover in grid wireless networks. 38-53 - Jérémie Chalopin:
Election and rendezvous with incomparable labels. 54-70 - Reuven Cohen
, David Peleg:
Local spreading algorithms for autonomous robot systems. 71-82 - Bilel Derbel, Cyril Gavoille:
Fast deterministic distributed algorithms for sparse spanners. 83-100 - Stefan Dobrev, Rastislav Kralovic
, Richard Královic, Nicola Santoro
:
On fractional dynamic faults with thresholds. 101-117 - Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
:
Distance- k knowledge in self-stabilizing algorithms. 118-127 - Adrian Kosowski:
The maximum edge-disjoint paths problem in complete graphs. 128-140 - Dariusz R. Kowalski, Adam Malinowski:
How to meet in anonymous network. 141-156
Volume 399, Number 3, June 2008
- Fedor V. Fomin
, Pierre Fraigniaud, Dimitrios M. Thilikos:
Forewords: Special issue on graph searching. 157
- Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Time constrained graph searching. 158-168 - Frédéric Mazoit
, Nicolas Nisse:
Monotonicity of non-deterministic graph searching. 169-178 - Volkan Isler, Nikhil Karnad:
The role of information in the cop-robber game. 179-190 - Margaret-Ellen Messinger, Richard J. Nowakowski
, Pawel Pralat:
Cleaning a network with brushes. 191-205 - Paul Hunter
, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings. 206-219 - Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski:
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - . 220-235 - Fedor V. Fomin
, Dimitrios M. Thilikos:
An annotated bibliography on guaranteed graph searching. 236-245
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.