{"OA_type":"gold","acknowledgement":"This work was initiated at the 16th European Research Week on Geometric Graphs in Strobl in 2019. A.W. has been supported by the Austrian Science Fund (FWF): W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035] and by the NWO Gravitation project NETWORKS under grant no. 024.002.003. Part of the work was done while A.W. was emplyed at Graz University of Technology. Preliminary versions of this work have been presented at the 38th European Workshop on Computational Geometry (EuroCG\r\n2022) in Perugia [10] and at the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023) in Isola delle Femmine [11].","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"11","ddc":["510"],"doi":"10.7155/jgaa.v28i2.2988","oa":1,"year":"2024","external_id":{"arxiv":["2202.12175"]},"volume":28,"publication":"Journal of Graph Algorithms and Applications","language":[{"iso":"eng"}],"DOAJ_listed":"1","publication_status":"published","title":"Removing popular faces in curve arrangements","date_published":"2024-11-03T00:00:00Z","publisher":"Brown University","abstract":[{"text":"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 randomized FPT-time algorithm where the parameter is the number of popular faces.","lang":"eng"}],"intvolume":"        28","quality_controlled":"1","status":"public","file_date_updated":"2024-12-03T09:45:00Z","day":"03","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_created":"2024-12-01T23:01:54Z","type":"journal_article","scopus_import":"1","date_updated":"2024-12-03T09:49:18Z","article_type":"original","arxiv":1,"corr_author":"1","publication_identifier":{"issn":["1526-1719"]},"has_accepted_license":"1","page":"47-82","author":[{"last_name":"De Nooijer","full_name":"De Nooijer, Phoebe","first_name":"Phoebe"},{"full_name":"Terziadis, Soeren","first_name":"Soeren","last_name":"Terziadis"},{"last_name":"Weinberger","first_name":"Alexandra","full_name":"Weinberger, Alexandra"},{"full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mchedlidze, Tamara","first_name":"Tamara","last_name":"Mchedlidze"},{"last_name":"Löffler","first_name":"Maarten","full_name":"Löffler, Maarten"},{"first_name":"Günter","full_name":"Rote, Günter","last_name":"Rote"}],"file":[{"file_name":"2024_JourGraphAlgorithms_deNooijer.pdf","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1582493,"creator":"dernst","access_level":"open_access","date_updated":"2024-12-03T09:45:00Z","file_id":"18609","checksum":"be611da6f9d790dc980d6fb7283fe889","date_created":"2024-12-03T09:45:00Z"}],"oa_version":"Published Version","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, Journal of Graph Algorithms and Applications 28 (2024) 47–82.","ista":"De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler M, Rote G. 2024. Removing popular faces in curve arrangements. Journal of Graph Algorithms and Applications. 28(2), 47–82.","ieee":"P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2. Brown University, pp. 47–82, 2024.","ama":"De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. 2024;28(2):47-82. doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>","mla":"De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2, Brown University, 2024, pp. 47–82, doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>.","chicago":"De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2024. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>.","apa":"De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>"},"issue":"2","article_processing_charge":"No","_id":"18604"}