{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:26:23Z","timestamp":1766269583570,"version":"3.44.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032002808"},{"type":"electronic","value":"9783032002815"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_25","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:35Z","timestamp":1754825915000},"page":"415-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Computational Complexity of\u00a0Pushing Machine"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5204-8060","authenticated-orcid":false,"given":"Chao","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-7721(99)00017-6","volume":"13","author":"D Dor","year":"1999","unstructured":"Dor, D., Zwick, U.: SOKOBAN and other motion planning problems. Comput. Geom. 13, 215\u2013228 (1999)","journal-title":"Comput. Geom."},{"key":"25_CR2","unstructured":"Culberson, J.C.: Sokoban is PSPACE-complete. Tech. rep. TR 97-02, Department of Computing Science, University of Alberta (1997)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoret. Comput. Sci. 343, 72\u201396 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_CR4","first-page":"719","volume":"20","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Buchin, M.: Rolling block mazes are PSPACE-complete. J. Inf. Process. 20(3), 719\u2013722 (2012)","journal-title":"J. Inf. Process."},{"key":"25_CR5","first-page":"36","volume-title":"DCFS 2023, LNCS","author":"MC Chavrimootoo","year":"2023","unstructured":"Chavrimootoo, M.C.: Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle. In: Bordihn, H., Tran, N., Vaszil, G. (eds.) DCFS 2023, LNCS, vol. 13918, pp. 36\u201350. Springer, Heidelberg (2023)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2017.03.011","volume":"677","author":"W He","year":"2017","unstructured":"He, W., Liu, Z., Yang, C.: SNOWMAN is PSPACE-complete. Theoret. Comput. Sci. 677, 31\u201340 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR7","unstructured":"Ani, J., Bosboom J., Demaine E. D., Diomidov, Y., Hendrickson, D., Lynch J.: Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Proceedings of the 10th International Conference on Fun with Algorithms (FUN 2021), 3:1-3:23 (2021)"},{"key":"25_CR8","unstructured":"Brunner, J., Chung, L., Demaine, E. D., Hendrickson, D., Hesterberg, A., Suhl, A., Zeff, A.: $$1\\times 1$$ Rush Hour with fixed blocks is PSPACE-complete. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Proceedings of the 10th International Conference on Fun with Algorithms (FUN 2021), 7:1-7:14 (2021)"},{"key":"25_CR9","unstructured":"Biasi, M. D., Ophelders, T.: Subway Shuffle is PSPACE-complete. http:\/\/www.nearly42.org\/vdisk\/cstheory\/subwayshuffleprelimdraft.pdf"},{"key":"25_CR10","first-page":"223","volume-title":"Handbook of Graph Drawing and Visualization","author":"CA Duncan","year":"2013","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 223\u2013246. Chapman and Hall\/CRC, New York (2013)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T16:13:26Z","timestamp":1757348006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}