{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T17:50:24Z","timestamp":1784742624477,"version":"3.55.0"},"publisher-location":"Cham","reference-count":20,"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_23","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:31Z","timestamp":1752796111000},"page":"316-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tile-Based Knot Assembly with\u00a0Celtic!"],"prefix":"10.1007","author":[{"given":"Divya","family":"Bajaj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryan","family":"Knobel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan Manuel","family":"Perez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rene","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramiro","family":"Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Berger, R.L.: The undecidability of the domino problem. Mem. Am. Math. Soc.\u00a0(1966)","DOI":"10.1090\/memo\/0066"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bosboom, J., et al.: Edge matching with inequalities, triangles, unknown shape, and two players (2020). arXiv:2002.03887","DOI":"10.2197\/ipsjjip.28.987"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bosboom, J., Demaine, E.D., Demaine, M.L., Hesterberg, A., Manurangsi, P., Yodpinyanee, A.: Even $$1 \\times n$$ edge-matching and jigsaw puzzles are really hard (2016). arXiv:1701.00146","DOI":"10.2197\/ipsjjip.25.682"},{"key":"23_CR4","unstructured":"Browne, C.: Connection Games: Variations on a Theme. A K Peters, Ltd. (2005)"},{"key":"23_CR5","unstructured":"Browne, C.: Celtic! [Board Game] (2009)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23, 195\u2013208 (2007)","journal-title":"Graphs Comb."},{"key":"23_CR7","unstructured":"Ebbesen, M., Fischer, P., Witt, C.: Edge-matching problems with rotations (2017). arXiv:1703.09421"},{"key":"23_CR8","unstructured":"Hardesty, F.W., Schenck, I.W.: Competitive road building and travel game. US grant 3309092A (1967)"},{"key":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. CRC Press, Boca Raton (2009)"},{"issue":"1\u20133","key":"23_CR10","first-page":"69","volume":"81","author":"Y Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Disc. Appl. Math. 81(1\u20133), 69\u201391 (1998)","journal-title":"Disc. Appl. Math."},{"issue":"5","key":"23_CR11","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TCAD.2008.917973","volume":"27","author":"X Ma","year":"2008","unstructured":"Ma, X., Lombardi, F.: Synthesis of tile sets for dna self-assembly. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(5), 963\u2013967 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"23_CR12","volume-title":"New Mathematical Pastimes","author":"PA MacMahon","year":"1921","unstructured":"MacMahon, P.A.: New Mathematical Pastimes. Cambridge University Press, Cambridge (1921)"},{"key":"23_CR13","unstructured":"McMurchie, T.: Squiggle Game. US grant 4180271A (1979)"},{"key":"23_CR14","unstructured":"McMurchie, T.: Tsuro. Calliope Games (2005)"},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J Ples\u0144ik","year":"1979","unstructured":"Ples\u0144ik, J.: The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two. Inf. Process. Lett. 8(4), 199\u2013201 (1979)","journal-title":"Inf. Process. Lett."},{"key":"23_CR16","volume-title":"Kalico (Psyche-Paths)","author":"C Schensted","year":"1968","unstructured":"Schensted, C., Titus, C.: Kalico (Psyche-Paths). Funtastic, Kadon (1968)"},{"issue":"5","key":"23_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ipl.2006.04.010","volume":"99","author":"Y Takenaga","year":"2006","unstructured":"Takenaga, Y., Walsh, T.: Tetravex is np-complete. Inf. Process. Lett. 99(5), 171\u2013174 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition \u2013 ii. Bell Syst. Techn. J. 40(1), 1\u201341 (1961)","journal-title":"Bell Syst. Techn. J."},{"key":"23_CR19","unstructured":"Wikipedia: Eternity ii, en.wikipedia.org\/wiki\/Eternity_II_puzzle (2024)"},{"key":"23_CR20","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T13:57:48Z","timestamp":1784383068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_23","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"}}]}}