@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2023.66,
author = {Abrahamsen, Mikkel and Bille Meyling, William and Nusser, Andr\'{e}},
title = {{Constructing Concise Convex Covers via Clique Covers}},
booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)},
pages = {66:1--66:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-273-0},
ISSN = {1868-8969},
year = {2023},
volume = {258},
editor = {Chambers, Erin W. and Gudmundsson, Joachim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.66},
URN = {urn:nbn:de:0030-drops-179164},
doi = {10.4230/LIPIcs.SoCG.2023.66},
annote = {Keywords: Convex cover, Polygons with holes, Algorithm engineering, Vertex clique cover}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode