Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries.
F. Hoffmann, K. Kriegel, S. Suri, K. Verbeek, and M. Willert. Symposium on Computational Geometry, volume 34 of LIPIcs, page 421-435. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/compgeom/HoffmannKSVW15
%A Hoffmann, Frank
%A Kriegel, Klaus
%A Suri, Subhash
%A Verbeek, Kevin
%A Willert, Max
%B Symposium on Computational Geometry
%D 2015
%E Arge, Lars
%E Pach, János
%I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
%K dblp
%P 421-435
%T Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries.
%U http://dblp.uni-trier.de/db/conf/compgeom/compgeom2015.html#HoffmannKSVW15
%V 34
%@ 978-3-939897-83-5
@inproceedings{conf/compgeom/HoffmannKSVW15,
added-at = {2018-08-23T00:00:00.000+0200},
author = {Hoffmann, Frank and Kriegel, Klaus and Suri, Subhash and Verbeek, Kevin and Willert, Max},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26f1c7f2fc76ca15b94b8554a7ff249e3/dblp},
booktitle = {Symposium on Computational Geometry},
crossref = {conf/compgeom/2015},
editor = {Arge, Lars and Pach, János},
ee = {https://doi.org/10.4230/LIPIcs.SOCG.2015.421},
interhash = {15c3ecc9483adbbebf222a539388d767},
intrahash = {6f1c7f2fc76ca15b94b8554a7ff249e3},
isbn = {978-3-939897-83-5},
keywords = {dblp},
pages = {421-435},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
series = {LIPIcs},
timestamp = {2019-09-27T14:18:31.000+0200},
title = {Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries.},
url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2015.html#HoffmannKSVW15},
volume = 34,
year = 2015
}
