{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:55:43Z","timestamp":1648540543881},"reference-count":9,"publisher":"Information Processing Society of Japan","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2013]]},"DOI":"10.2197\/ipsjjip.21.368","type":"journal-article","created":{"date-parts":[[2013,7,14]],"date-time":"2013-07-14T23:01:55Z","timestamp":1373842915000},"page":"368-377","source":"Crossref","is-referenced-by-count":2,"title":["Finding a Hamiltonian Path in a Cube with Specified Turns is Hard"],"prefix":"10.2197","volume":"21","author":[{"given":"Zachary","family":"Abel","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Sarah","family":"Eisenstat","sequence":"additional","affiliation":[]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[]}],"member":"1012","reference":[{"key":"1","unstructured":"[1] Creative Crafthouse, King snake."},{"key":"2","unstructured":"[2] Demaine, E.D., Demaine, M.L., Lindy, J.F. and Souvaine, D.L.: Hinged dissection of polypolyhedra, Proc. 9th Workshop on Algorithms and Data Structures<\/i> (WADS 2005<\/i>), Lecture Notes in Computer Science<\/i>, Vol.3608, pp.205-217, Waterloo, Ontario, Canada (2005)."},{"key":"3","unstructured":"[3] Demaine, E.D. and Eisenstat, S.: Flattening fixed-angle chains is strongly NP-hard, Proc. 12th Algorithms and Data Structures Symposium<\/i> (WADS 2011<\/i>), pp.314-325, Brooklyn, New York (2011)."},{"key":"4","unstructured":"[4] Garey, M.R. and Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing<\/i>, Vol.4, No.4, pp.397-411 (1975)."},{"key":"5","unstructured":"[5] Indiana University Lilly Library, The jerry slocum mechanical puzzle collection, available from <http:\/\/webapp1.dlib.indiana.edu\/images\/splash.htm?scope=lilly\/slocum> 024867, 024868, 024869, 024870, and 024871, available from <http:\/\/webapp1.dlib.indiana.edu\/images\/item.htm?id=http:\/\/purl.dlib.indiana.edu\/iudl\/lilly\/slocum\/LL-SLO-024867>."},{"key":"6","unstructured":"[6] McDonough, A.E.: Snake cube puzzles: Hamilton paths in grid graphs, Honors project (2009)."},{"key":"7","unstructured":"[7] Ruskey, F. and Sawada, J.: Bent hamilton cycles in d<\/i>-dimensional grid graphs, The Electric Journal of Combinatorics<\/i>, Vol.10, No.1, p.R1 (2003). available from <http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1r1>."},{"key":"8","unstructured":"[8] Jaap Scherphuis, Jaap's puzzle page: Snake cubes, (2010), available from <http:\/\/www.jaapsch.net\/puzzles\/snakecube.htm>."},{"key":"9","unstructured":"[9] Singmaster, D.: Singmaster cube and puzzle collection, CD distributed at Gathering 4 Gardner 6 (Mar. 2004)."}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/21\/3\/21_368\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T01:00:54Z","timestamp":1638320454000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/21\/3\/21_368\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.21.368","relation":{},"ISSN":["1882-6652"],"issn-type":[{"value":"1882-6652","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}