{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T09:20:38Z","timestamp":1672392038628},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00224-008-9104-3","type":"journal-article","created":{"date-parts":[[2008,3,3]],"date-time":"2008-03-03T11:52:58Z","timestamp":1204545178000},"page":"160-174","source":"Crossref","is-referenced-by-count":1,"title":["Wooden Geometric Puzzles: Design and Hardness Proofs"],"prefix":"10.1007","volume":"44","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[]},{"given":"Hans","family":"Bodlaender","sequence":"additional","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Gerard","family":"Tel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,4]]},"reference":[{"key":"9104_CR1","unstructured":"Cubism For Fun website. http:\/\/cff.helm.lu\/"},{"key":"9104_CR2","unstructured":"Culberson, J.: SOKOBAN is PSPACE-complete. In: Proceedings in Informatics 4 (Int. Conf. FUN with Algorithms 1998), pp. 65\u201376 (1999)"},{"key":"9104_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Proc. of Math. Found. of Comp. Sci., pp. 18\u201332 (2001)","DOI":"10.1007\/3-540-44683-4_3"},{"issue":"3","key":"9104_CR4","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s00224-005-1241-3","volume":"39","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Demaine, M.L.: Puzzles, art, and magic with algorithms. Theory Comput. Syst. 39(3), 473\u2013481 (2006)","journal-title":"Theory Comput. Syst."},{"key":"9104_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. Technical Report MIT-LCS-TR-865, MIT (2002)","DOI":"10.1007\/3-540-45071-8_36"},{"key":"9104_CR6","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Baum, E.B.: Rush Hour is PSPACE-complete, or why you should generously tip parking lot attendants. Manuscript (2001)","DOI":"10.1016\/S0304-3975(01)00173-6"},{"key":"9104_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"4","key":"9104_CR8","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"9104_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D. Ratner","year":"1990","unstructured":"Ratner, D., Warmuth, M.: Finding a shortest solution for the N * N-extension of the 15-puzzle is intractable. J. Symb. Comput. 10, 111\u2013137 (1990)","journal-title":"J. Symb. Comput."},{"key":"9104_CR10","first-page":"99","volume":"13","author":"E. Robertson","year":"1978","unstructured":"Robertson, E., Munro, I.: NP-completeness, puzzles, and games. Util. Math. 13, 99\u2013116 (1978)","journal-title":"Util. Math."},{"key":"9104_CR11","first-page":"12","volume":"68","author":"M. Kreveld van","year":"2005","unstructured":"van Kreveld, M.: Some tetraform puzzles. Cubism For Fun 68, 12\u201315 (2005)","journal-title":"Cubism For Fun"},{"key":"9104_CR12","first-page":"28","volume":"71","author":"M. Kreveld van","year":"2006","unstructured":"van Kreveld, M.: Gate puzzles. Cubism For Fun 71, 28\u201330 (2006)","journal-title":"Cubism For Fun"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9104-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T10:47:39Z","timestamp":1557312459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9104-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9104"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9104-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,4]]}}}