@inproceedings{4a0fda2b3442455f95dcb1960876573c,
title = "Dots & polygons (Media Exposition)",
abstract = "We present a new game, Dots & Polygons, played on a planar point set. We prove that its NP-hard and discuss strategies for the case when the point set is in convex position.",
keywords = "Boxes, Cycle packing, Dots, Game, NP-hard",
author = "Kevin Buchin and Mart Hagedoorn and Irina Kostitsyna and {van Mulken}, Max and Jolan Rensen and {van Schooten}, Leo",
year = "2020",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.SoCG.2020.79",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Sergio Cabello and Chen, {Danny Z.}",
booktitle = "36th International Symposium on Computational Geometry (SoCG)",
note = "36th International Symposium on Computational Geometry, SoCG 2020 ; Conference date: 23-06-2020 Through 26-06-2020",
}