@inproceedings{6feca4cbcd884a7a9c9a38d3a9d5a149,
title = "Removing Popular Faces in Curve Arrangements",
abstract = "A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP -hard; however, it becomes tractable when the number of popular faces is small: We present a probabilistic FPT -approach in the number of popular faces.",
keywords = "Curve arrangements, Fixed-parameter tractable (FPT), Puzzle generation",
author = "{de Nooijer}, Phoebe and Soeren Terziadis and Alexandra Weinberger and Zuzana Mas{\'a}rov{\'a} and Tamara Mchedlidze and Maarten L{\"o}ffler and G{\"u}nter Rote",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 31st International Symposium on Graph Drawing and Network Visualization : GD 2023 ; Conference date: 20-09-2023 Through 22-09-2023",
year = "2023",
doi = "10.1007/978-3-031-49275-4_2",
language = "English",
isbn = "9783031492747",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "18--33",
editor = "Bekos, {Michael A.} and Markus Chimani",
booktitle = "Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Revised Selected Papers",
address = "Germany",
}