@inproceedings{14888,
  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.},
  author       = {De Nooijer, Phoebe and Terziadis, Soeren and Weinberger, Alexandra and Masárová, Zuzana and Mchedlidze, Tamara and Löffler, Maarten and Rote, Günter},
  booktitle    = {31st International Symposium on Graph Drawing and Network Visualization},
  isbn         = {9783031492747},
  issn         = {1611-3349},
  location     = {Isola delle Femmine, Palermo, Italy},
  pages        = {18--33},
  publisher    = {Springer Nature},
  title        = {{Removing popular faces in curve arrangements}},
  doi          = {10.1007/978-3-031-49275-4_2},
  volume       = {14466},
  year         = {2024},
}