{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:47:59Z","timestamp":1754146079316,"version":"3.41.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_22","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:27Z","timestamp":1752796107000},"page":"302-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Solving Simple Curved Nonograms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9403-8856","authenticated-orcid":false,"given":"Maarten","family":"L\u00f6ffler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0351-5945","authenticated-orcid":false,"given":"G\u00fcnter","family":"Rote","sequence":"additional","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":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"22_CR1","unstructured":"Batenburg, K., Henstra, S., Kosters, W., Palenstijn, W.: Constructing simple nonograms of varying difficulty. Pure Math. Appl. (PU.\u00a0M.\u00a0A.), 20, 1\u201315 (2009)"},{"issue":"8","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.patcog.2008.12.003","volume":"42","author":"K Batenburg","year":"2009","unstructured":"Batenburg, K., Kosters, W.: Solving nonograms by combining relaxations. Pattern Recogn. 42(8), 1672\u20131683 (2009). https:\/\/doi.org\/10.1016\/j.patcog.2008.12.003","journal-title":"Pattern Recogn."},{"issue":"4","key":"22_CR3","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. J. Int. Comput. Games Assoc. 35(4), 195\u2013205 (2012). https:\/\/doi.org\/10.3233\/ICG-2012-35402","journal-title":"J. Int. Comput. Games Assoc."},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Brunck, F., Chang, H.-C., L\u00f6ffler, M., Ophelders, T., Schlipf, L.: Reconfiguring popular faces. Comput. Reconfiguration Low-Dimensional Topological Spaces (Dagstuhl Sem. 22062), pp. 24\u201334 (2022). https:\/\/doi.org\/10.4230\/DagRep.12.2.17","DOI":"10.4230\/DagRep.12.2.17"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Cigas, J., Hsin, W.-J.: Teaching proofs and algorithms in discrete mathematics with online visual logic puzzles. J. Educ. Resour. Comput. 5(2) (2005). https:\/\/doi.org\/10.1145\/1141904.1141906","DOI":"10.1145\/1141904.1141906"},{"key":"22_CR6","unstructured":"Cormode, G.: The hardness of the Lemmings game, or \u201cOh no, more NP-completeness proofs. In: Proceedings of 3rd International Conference on Fun with Algorithms, pp. 65\u201376 (2004)"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.7155\/jgaa.v28i2.2988","volume":"28","author":"P de Nooijer","year":"2024","unstructured":"de Nooijer, P., et al.: Removing popular faces in curve arrangements. J. Graph Algorithms Appl. 28(2), 47\u201382 (2024). https:\/\/doi.org\/10.7155\/jgaa.v28i2.2988","journal-title":"J. Graph Algorithms Appl."},{"issue":"18","key":"22_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.31782\/IJCRR.2020.121829","volume":"12","author":"V Kasinathan","year":"2020","unstructured":"Kasinathan, V., Mandhana, A., Mustapha, A., Adam, N.: How logical and mathematical games treat patients and adults suffering from dementia. Int. J. Curr. Res. 12(18), 9\u201313 (2020). https:\/\/doi.org\/10.31782\/IJCRR.2020.121829","journal-title":"Int. J. Curr. Res."},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101791","volume":"98","author":"F Klute","year":"2021","unstructured":"Klute, F., L\u00f6ffler, M., N\u00f6llenburg, M.: Labeling nonograms: boundary labeling for curve arrangements. Comput. Geom. Theory Appl. 98, 101791 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101791","journal-title":"Comput. Geom. Theory Appl."},{"key":"22_CR10","unstructured":"L\u00f6ffler, M., Rote, G., Terziadis, S., Weinberger, A.: On solving simple curved nonograms (2025). arXiv:2505.01554"},{"key":"22_CR11","unstructured":"Ueda, N., Nagao, T.: NP-completeness results for NONOGRAM via parsimonious reductions. Technical report TR96-0008, Department of Computer Science, Tokyo Institute of Technology. CiteSeerX (1996). 10.1.1.57.5277"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"van\u00a0de Kerkhof, M., de\u00a0Jong, T., Parment, R., L\u00f6ffler, M., Vaxman, A., van Kreveld, M.: Design and automated generation of Japanese picture puzzles. In: 40th Annual Conference on European Association Computer Graphics (2019). https:\/\/doi.org\/10.1111\/cgf.13642","DOI":"10.1111\/cgf.13642"},{"key":"22_CR13","unstructured":"van Kreveld, M.\u00a0J.: On nonogram and graph planarity puzzle generation. In: 30th Canadian Conference on Computational Geometry (CCCG), pp. 326\u2013327 (2018). http:\/\/www.cs.umanitoba.ca\/~cccg2018\/papers\/invited_paper_3.pdf"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00224-013-9497-5","volume":"54","author":"G Viglietta","year":"2013","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it! Theory Comput. Syst. 54(4), 595\u2013621 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9497-5","journal-title":"Theory Comput. Syst."},{"key":"22_CR15","unstructured":"Wolter, J.: Survey of paint-by-number puzzle solvers. https:\/\/webpbn.com\/survey\/. Accessed 22 Feb 2025"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Yang, Y., Zhang, D., Ji, T., Li, L., He, Y.: Designing educational games based on intangible cultural heritage for rural children: a case study on \u201cLogic Huayao. In: Advances in Human Factors in Wearable Technologies and Game Design (AHFE), pp. 378\u2013389 (2019). https:\/\/doi.org\/10.1007\/978-3-319-94619-1_38","DOI":"10.1007\/978-3-319-94619-1_38"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:29Z","timestamp":1752796109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}