{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:12:27Z","timestamp":1743153147957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_2","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"18-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Removing Popular Faces in\u00a0Curve Arrangements"],"prefix":"10.1007","author":[{"given":"Phoebe","family":"de Nooijer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5161-3841","authenticated-orcid":false,"given":"Soeren","family":"Terziadis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-6661","authenticated-orcid":false,"given":"Alexandra","family":"Weinberger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-1322","authenticated-orcid":false,"given":"Zuzana","family":"Mas\u00e1rov\u00e1","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1545-5580","authenticated-orcid":false,"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9403-8856","authenticated-orcid":false,"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0351-5945","authenticated-orcid":false,"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.3233\/ICG-2012-35402","volume":"35","author":"KJ Batenburg","year":"2012","unstructured":"Batenburg, K.J., Kosters, W.A.: On the difficulty of nonograms. ICGA J. 35(4), 195\u2013205 (2012). https:\/\/doi.org\/10.3233\/ICG-2012-35402","journal-title":"ICGA J."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","volume":"18","author":"SW Bent","year":"1987","unstructured":"Bent, S.W., Manber, U.: On non-intersecting Eulerian circuits. Discret. Appl. Math. 18(1), 87\u201394 (1987). https:\/\/doi.org\/10.1016\/0166-218X(87)90045-X","journal-title":"Discret. Appl. Math."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2014.01.004","volume":"169","author":"D Berend","year":"2014","unstructured":"Berend, D., Pomeranz, D., Rabani, R., Raziel, B.: Nonograms: combinatorial questions and algorithms. Discret. Appl. Math. 169, 30\u201342 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.01.004","journal-title":"Discret. Appl. Math."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeld, T., Taslaman, N.: Shortest cycle through specified elements. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1747\u20131753. Society for Industrial and Applied Mathematics, USA (2012). 2095116.2095255","DOI":"10.1137\/1.9781611973099.139"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Brunck, F., Chang, H.C., L\u00f6ffler, M., Ophelders, T., Schlipf, L.: Reconfiguring popular faces. Dagstuhl Rep. (Seminar 22062) 12(2), 24\u201334 (2022). https:\/\/doi.org\/10.4230\/DagRep.12.2.17","DOI":"10.4230\/DagRep.12.2.17"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3233\/ICG-190097","volume":"41","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Lin, S.: A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments. ICGA J. 41(1), 2\u201314 (2019). https:\/\/doi.org\/10.3233\/ICG-190097","journal-title":"ICGA J."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1111\/cgf.13642","volume":"38","author":"M van de Kerkhof","year":"2019","unstructured":"van de Kerkhof, M., de Jong, T., Parment, R., L\u00f6ffler, M., Vaxman, A., van Kreveld, M.J.: Design and automated generation of Japanese picture puzzles. Comput. Graph. Forum 38(2), 343\u2013353 (2019). https:\/\/doi.org\/10.1111\/cgf.13642","journal-title":"Comput. Graph. Forum"},{"key":"2_CR8","unstructured":"de Nooijer, P.: Resolving popular faces in curve arrangements. Master\u2019s thesis, Utrecht University (2022). https:\/\/studenttheses.uu.nl\/handle\/20.500.12932\/494"},{"key":"2_CR9","unstructured":"de Nooijer, P., et al.: Removing popular faces in curve arrangements by inserting one more curve. In: Giacomo, E.D., Montecchiani, F. (eds.) Abstracts of the 38th European Workshop on Computational Geometry (EuroCG 2022), pp. 38:1\u201338:8, March 2022. https:\/\/eurocg2022.unipg.it\/booklet\/EuroCG2022-Booklet.pdf"},{"key":"2_CR10","unstructured":"de Nooijer, P., et al.: Removing popular faces in curve arrangements (2023). arXiv:2202.12175v2 [cs.CG]"},{"key":"2_CR11","unstructured":"Rote, G.: The Generalized Combinatorial Laso\u0144-Alon-Zippel-Schwartz Nullstellensatz Lemma (2023). arXiv:2305.10900 [math.CO]"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:02Z","timestamp":1704715382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}