{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T20:01:03Z","timestamp":1784750463063,"version":"3.55.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["2329918"],"award-info":[{"award-number":["2329918"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s00236-026-00533-2","type":"journal-article","created":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T06:32:37Z","timestamp":1784701957000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tile-based knot assembly with Celtic!"],"prefix":"10.1007","volume":"63","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","family":"Manuel 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":[[2026,7,22]]},"reference":[{"key":"533_CR1","doi-asserted-by":"publisher","unstructured":"Bajaj, D., Knobel, R., Perez, J.M., et\u00a0al.: Tile-based knot assembly with Celtic! In: Fernau H, Zhu B (eds) Proceedings of the 36th Intl. Workshop on Combinatorial Algorithms. Springer Nature Switzerland, Cham, IWOCA\u201925, pp 316\u2013331 (2025). https:\/\/doi.org\/10.1007\/978-3-031-98740-3_23","DOI":"10.1007\/978-3-031-98740-3_23"},{"key":"533_CR2","doi-asserted-by":"crossref","unstructured":"Berger, R.L.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society (1966)","DOI":"10.1090\/memo\/0066"},{"key":"533_CR3","doi-asserted-by":"crossref","unstructured":"Bosboom, J., Demaine, E.D., Demaine, M.L., et\u00a0al.: Even $$1 \\times n$$ edge-matching and jigsaw puzzles are really hard. ArXiv:1701.00146 (2016)","DOI":"10.2197\/ipsjjip.25.682"},{"key":"533_CR4","doi-asserted-by":"crossref","unstructured":"Bosboom, J., Chen, C., Chung, L., et\u00a0al.: Edge matching with inequalities, triangles, unknown shape, and two players. arXiv:2002.03887 (2020)","DOI":"10.2197\/ipsjjip.28.987"},{"key":"533_CR5","unstructured":"Browne, C.: Connection Games: Variations on a Theme. A K Peters Ltd (2005)"},{"key":"533_CR6","unstructured":"Browne, C.: Celtic! [Board Game] (2009). https:\/\/www.cambolbro.com\/games\/celtic\/"},{"key":"533_CR7","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":"533_CR8","unstructured":"Ebbesen, M., Fischer, P., Witt, C.: Edge-matching problems with rotations. arXiv:1703.09421 (2017)"},{"key":"533_CR9","unstructured":"Hardesty, F.W., Schenck, I.W.: Competitive road building and travel game. US grant 3309092A (1967)"},{"key":"533_CR10","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":"533_CR11","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. Discret. Appl. Math. 81(1\u20133), 69\u201391 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"533_CR12","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":"533_CR13","volume-title":"New Mathematical Pastimes","author":"PA MacMahon","year":"1921","unstructured":"MacMahon, P.A.: New Mathematical Pastimes. University Press, Cambridge (1921)"},{"key":"533_CR14","unstructured":"McMurchie, T.: Squiggle Game. US grant 4180271A (1979)"},{"key":"533_CR15","unstructured":"McMurchie, T.: Tsuro. Calliope Games (2005)"},{"issue":"4","key":"533_CR16","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":"533_CR17","volume-title":"Kalico (Psyche-Paths)","author":"C Schensted","year":"1968","unstructured":"Schensted, C., Titus, C.: Kalico (Psyche-Paths). Funtastic, Kadon (1968)"},{"issue":"5","key":"533_CR18","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":"533_CR19","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\u2014II. Bell Syst. Tech. J. 40(1), 1\u201341 (1961)","journal-title":"Bell Syst. Tech. J."},{"key":"533_CR20","unstructured":"Wikipedia.: Eternity II. En.wikipedia.org\/wiki\/Eternity_II_puzzle (2024)"},{"key":"533_CR21","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology (1998)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00533-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T19:01:21Z","timestamp":1784746881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00533-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00533-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"1 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"29"}}