{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:58:58Z","timestamp":1742950738061,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030789459"},{"type":"electronic","value":"9783030789466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_11","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"203-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Case Study on the Graph-Transformational Modeling and Analysis of Puzzles"],"prefix":"10.1007","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Lye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.entcs.2005.12.018","volume":"148","author":"R Heckel","year":"2006","unstructured":"Heckel, R.: Graph transformation in a nutshell. Electron. Notes Theor. Comput. Sci. 148(1), 187\u2013198 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3233\/FI-2009-0073","volume":"92","author":"K H\u00f6lscher","year":"2009","unstructured":"H\u00f6lscher, K., Kreowski, H.-J., Kuske, S.: Autonomous units to model interacting sequential and parallel processes. Fundamenta Informaticae 92, 233\u2013257 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR3","unstructured":"Kreowski, H.-J., Kuske, S., T\u00f6nnies, H.: Autonomous units to model games. In: Fischer, S., Maehle, E., Reischuk, R. (eds.) Informatik 2009, Im Focus das Leben, volume 154 of Lecture Notes in Informatics, pp. 3465\u20133472 (2009)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-40530-8_14","volume-title":"Graph Transformation","author":"D Priemer","year":"2016","unstructured":"Priemer, D., George, T., Hahn, M., Raesch, L., Z\u00fcndorf, A.: Using graph transformation for puzzle game level generation and validation. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 223\u2013235. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40530-8_14"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-89020-1_34","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2008","unstructured":"Rensink, A., et al.: Ludo: a case study for graph transformation tools. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 493\u2013513. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89020-1_34"},{"key":"11_CR6","unstructured":"Zambon, E., Rensink, A.: Solving the N-Queens problem with GROOVE - towards a compendium of best practices. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 67, 13 p. (2014)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-61228-9_81","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H-J Kreowski","year":"1996","unstructured":"Kreowski, H.-J., Kuske, S.: On the interleaving semantics of transformation units\u2014a step into GRACE. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 89\u2013106. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61228-9_81"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-68679-8_5","volume-title":"Concurrency, Graphs and Models","author":"H-J Kreowski","year":"2008","unstructured":"Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph transformation units \u2013 an overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 57\u201375. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68679-8_5"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.-J.: Graph grammars: an algebraic approach. In: IEEE Conference on Automata and Switching Theory, Iowa City, pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Corradini, A., Ehrig, H., Heckel, R., L\u00f6we, M., Montanari, U., Rossi, F.: Algebraic approaches to graph transformation part I: basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, pp. 163\u2013245. World Scientific, Singapore (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"11_CR11","first-page":"1052","volume":"86","author":"T Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86, 1052\u20131060 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"19","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.ipl.2009.07.017","volume":"109","author":"D Andersson","year":"2009","unstructured":"Andersson, D.: Hashiwokakero is NP-complete. Inf. Process. Lett. 109(19), 1145\u20131146 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"465","key":"11_CR13","first-page":"1","volume":"109","author":"K Kotsuma","year":"2010","unstructured":"Kotsuma, K., Takenaga, Y.: NP-completeness and enumeration of Number Link puzzle. IEICE Tech. Rep. 109(465), 1\u20137 (2010)","journal-title":"IEICE Tech. Rep."},{"issue":"3","key":"11_CR14","first-page":"239","volume":"23","author":"A Adcock","year":"2015","unstructured":"Adcock, A., et al.: Zig-zag numberlink is NP-complete. J. Inf. Process. 23(3), 239\u2013245 (2015)","journal-title":"J. Inf. Process."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Kreowski, H.-J., Kuske, S.: Modeling and analyzing graph algorithms by means of graph transformation units. J. Object Technol. 19(3), 3:1\u201314 (2020). https:\/\/doi.org\/10.5381\/jot.2020.19.3.a9","DOI":"10.5381\/jot.2020.19.3.a9"},{"issue":"1","key":"11_CR16","first-page":"13","volume":"31","author":"G Kendall","year":"2008","unstructured":"Kendall, G., Parkes, A.J., Spoerer, K.: A survey of NP-complete puzzles. J. Int. Comput. Games Assoc. 31(1), 13\u201334 (2008)","journal-title":"J. Int. Comput. Games Assoc."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78946-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:32:10Z","timestamp":1624318330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"26","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":"14","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":"0","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":"54% - 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":"3","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":"In addition, the proceedings contain 2 tool papers.","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)"}}]}}