@InProceedings{bonnet_et_al:LIPIcs.SoCG.2018.11,
author = {Bonnet, \'{E}douard and Giannopoulos, Panos},
title = {{Orthogonal Terrain Guarding is NP-complete}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-066-8},
ISSN = {1868-8969},
year = {2018},
volume = {99},
editor = {Speckmann, Bettina and T\'{o}th, Csaba D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.11},
URN = {urn:nbn:de:0030-drops-87246},
doi = {10.4230/LIPIcs.SoCG.2018.11},
annote = {Keywords: terrain guarding, rectilinear terrain, computational complexity}
}