Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Mikkel Abrahamsen, William Bille Meyling, and André Nusser. Constructing Concise Convex Covers via Clique Covers (CG Challenge). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 66:1-66:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Feedback for Dagstuhl Publishing