{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:40Z","timestamp":1725486700212},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729136"},{"type":"electronic","value":"9783540729143"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72914-3_4","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T05:37:26Z","timestamp":1182836246000},"page":"16-29","source":"Crossref","is-referenced-by-count":0,"title":["Wooden Geometric Puzzles: Design and Hardness Proofs"],"prefix":"10.1007","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","reference":[{"key":"4_CR1","unstructured":"Cubism For Fun website, http:\/\/cff.helm.lu\/"},{"key":"4_CR2","unstructured":"Culberson, J.: SOKOBAN is PSPACE-complete. In: Proceedings in Informatics 4 (Int. Conf. FUN with Algorithms 1998), pp. 65\u201376 (1999)"},{"key":"4_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":"4_CR4","doi-asserted-by":"publisher","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.\u00a039(3), 473\u2013481 (2006)","journal-title":"Theory Comput. Syst."},{"key":"4_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":"4_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":"4_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. W. H. Freeman, New York, NY (1979)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","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.\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","doi-asserted-by":"publisher","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\u2009\u2217\u2009N-extension of the 15-puzzle is intractable. J. Symb. Comp.\u00a010, 111\u2013137 (1990)","journal-title":"J. Symb. Comp."},{"key":"4_CR10","first-page":"99","volume":"13","author":"E. Robertson","year":"1978","unstructured":"Robertson, E., Munro, I.: NP-completeness, puzzles, and games. Util. Math.\u00a013, 99\u2013116 (1978)","journal-title":"Util. Math."},{"key":"4_CR11","first-page":"12","volume":"68","author":"M. Kreveld van","year":"2005","unstructured":"van Kreveld, M.: Some tetraform puzzles. Cubism For Fun\u00a068, 12\u201315 (2005)","journal-title":"Cubism For Fun"},{"key":"4_CR12","first-page":"28","volume":"71","author":"M. Kreveld van","year":"2006","unstructured":"van Kreveld, M.: Gate puzzles. Cubism For Fun\u00a071, 28\u201330 (2006)","journal-title":"Cubism For Fun"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72914-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T16:22:09Z","timestamp":1556554929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72914-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729136","9783540729143"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}