![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/fct/HammarN97
@inproceedings{DBLP:conf/fct/HammarN97, author = {Mikael Hammar and Bengt J. Nilsson}, editor = {Bogdan S. Chlebus and Ludwik Czaja}, title = {Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms}, booktitle = {Fundamentals of Computation Theory, 11th International Symposium, {FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1279}, pages = {210--221}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0036185}, doi = {10.1007/BFB0036185}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/HammarN97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.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.