{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:28:34Z","timestamp":1743020914144,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030420703"},{"type":"electronic","value":"9783030420710"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-42071-0_17","type":"book-chapter","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T17:02:44Z","timestamp":1587574964000},"page":"247-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Games, Puzzles and Treewidth"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3080-3210","authenticated-orcid":false,"given":"Tom C.","family":"van der Zanden","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"17_CR1","unstructured":"Aloupis, G., Demaine, E.D., Guo, A., Viglietta, G.: Classic nintendo games are (NP-)hard. arXiv preprint arXiv:1203.1895 (2012)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2015.02.037","volume":"586","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Demaine, E.D., Guo, A., Viglietta, G.: Classic nintendo games are (computationally) hard. Theoret. Comput. Sci. 586, 135\u2013160 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0304-3975(93)90357-Y","volume":"110","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: Complexity of path-forming games. Theoret. Comput. Sci. 110(1), 215\u2013245 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR4","unstructured":"Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding $${H}$$-minor free graphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 55, pp. 9:1\u20139:14 (2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-57586-5_9","volume-title":"Algorithms and Complexity","author":"HL Bodlaender","year":"2017","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: Improved lower bounds for graph embedding problems. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 92\u2013103. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_9"},{"key":"17_CR6","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: On the exact complexity of polyomino packing. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) 9th International Conference on Fun with Algorithms (FUN 2018), Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 100, pp. 9:1\u20139:10 (2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"17_CR7","first-page":"65","volume-title":"International Conference on Fun with Algorithms (FUN 1998)","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C.: Sokoban is PSPACE-complete. In: Lodi, E., Pagli, L., Santoro, N. (eds.) International Conference on Fun with Algorithms (FUN 1998), pp. 65\u201376. Carleton Scientific, Waterloo (1998)"},{"issue":"1","key":"17_CR8","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. Graph. Comb. 23(1), 195\u2013208 (2007)","journal-title":"Graph. Comb."},{"key":"17_CR9","unstructured":"Demaine, E.D., Lockhart, J., Lynch, J.: The computational complexity of portal and other 3D video games. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) 9th International Conference on Fun with Algorithms (FUN 2018), Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 100, pp. 19:1\u201319:22 (2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"1\u20132","key":"17_CR10","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/S0304-3975(01)00173-6","volume":"270","author":"GW Flake","year":"2002","unstructured":"Flake, G.W., Baum, E.B.: Rush Hour is PSPACE-complete, or \u201cWhy you should generously tip parking lot attendants\u201d. Theoret. Comput. Sci. 270(1\u20132), 895\u2013911 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-13122-6_22","volume-title":"Fun with Algorithms","author":"M Fori\u0161ek","year":"2010","unstructured":"Fori\u0161ek, M.: Computational complexity of two-dimensional platform games. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 214\u2013227. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_22"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","volume":"31","author":"AS Fraenkel","year":"1981","unstructured":"Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for n $$\\times $$ n chess requires time exponential in n. J. Comb. Theory, Ser. A 31(2), 199\u2013214 (1981)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"17_CR13","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. AK Peters\/CRC Press, Natick (2009)"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/05695558208975057","volume":"14","author":"TJ Hodgson","year":"1982","unstructured":"Hodgson, T.J.: A combined approach to the pallet loading problem. AIIE Trans. 14(3), 175\u2013182 (1982)","journal-title":"AIIE Trans."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR16","unstructured":"Clarke, D.: DX Interactive. Bloxorz. https:\/\/damienclarke.me\/#bloxorz"},{"issue":"12","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., et al.: On the complexity of reconfiguration problems. Theoret. Comput. Sci. 412(12), 1054\u20131065 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90131-7","volume":"123","author":"S Iwata","year":"1994","unstructured":"Iwata, S., Kasai, T.: The othello game on an n $$\\times $$ n board is PSPACE-complete. Theoret. Comput. Sci. 123(2), 329\u2013340 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR19","unstructured":"Pilz, A.: Planar 3-SAT with a clause\/variable cycle. arXiv preprint arXiv:1710.07476 (2017)"},{"key":"17_CR20","unstructured":"Robson, J.M.: The complexity of Go. In: 9th World Computer Congress on Information Processing, pp. 413\u2013417 (1983)"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"17_CR22","first-page":"270","volume":"73","author":"R Uehara","year":"1990","unstructured":"Uehara, R., Iwata, S.: Generalized Hi-Q is NP-complete. IEICE Trans. (1976-1990) 73(2), 270\u2013273 (1990)","journal-title":"IEICE Trans. (1976-1990)"},{"key":"17_CR23","unstructured":"van der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Husfeldt, T., Kanj, I. (eds.) 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 43, pp. 282\u2013293 (2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-319-18173-8_30","volume-title":"Algorithms and Complexity","author":"TC van der Zanden","year":"2015","unstructured":"van der Zanden, T.C., Bodlaender, H.L.: PSPACE-completeness of bloxorz and of games with 2-buttons. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 403\u2013415. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_30"},{"issue":"4","key":"17_CR25","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00224-013-9497-5","volume":"54","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it!. Theory Comput. Syst. 54(4), 595\u2013621 (2014)","journal-title":"Theory Comput. Syst."},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2017.11.003","volume":"93","author":"M Wrochna","year":"2018","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and tree-depth. J. Comput. Syst. Sci. 93, 1\u201310 (2018)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"17_CR27","first-page":"1052","volume":"86","author":"T Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(5), 1052\u20131060 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Treewidth, Kernels, and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42071-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T14:03:48Z","timestamp":1671372228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-42071-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420703","9783030420710"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42071-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}