![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 794
Volume 794, November 2019
- Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on Theory and Applications of Graph Searching. 1-2 - Pawel Pralat:
How many zombies are needed to catch the survivor on toroidal grids? 3-11 - Anthony Bonato, Thomas Lidbetter:
Bounds on the burning numbers of spiders and path-forests. 12-19 - Steve Alpern:
Search for an immobile Hider in a known subset of a network. 20-26 - Ioannis Lamprou
, Russell Martin
, Sven Schewe
:
Eternally dominating large grids. 27-46 - Dariusz Dereniowski, Tomas Gavenciak
, Jan Kratochvíl
:
Cops, a fast robber and defensive domination on interval graphs. 47-58 - Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney
, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. 59-68 - Pierre Coupechoux, Marc Demange, David Ellison
, Bertrand Jouve:
Firefighting on trees. 69-84 - Dariusz Dereniowski
, Dorota Osula, Pawel Rzazewski
:
Finding small-width connected path decompositions in polynomial time. 85-100
![](https://dblp.org/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.