{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T02:53:12Z","timestamp":1790391192877,"version":"4.1.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T00:00:00Z","timestamp":1377907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9497-5","type":"journal-article","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T04:30:21Z","timestamp":1377837021000},"page":"595-621","source":"Crossref","is-referenced-by-count":20,"title":["Gaming Is a Hard Job, but Someone Has to Do It!"],"prefix":"10.1007","volume":"54","author":[{"given":"Giovanni","family":"Viglietta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,31]]},"reference":[{"key":"9497_CR1","first-page":"65","volume-title":"Proceedings of FUN\u201904","author":"G. Cormode","year":"2004","unstructured":"Cormode, G.: The hardness of the Lemmings game, or Oh no, more NP-completeness proofs. In: Proceedings of FUN\u201904, pp. 65\u201376 (2004)"},{"key":"9497_CR2","series-title":"MSRI Publications","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/CBO9780511807251.002","volume-title":"Games of No Chance 3","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. In: Albert, M.H., Nowakowski, R.J. (eds.) Games of No Chance 3. MSRI Publications, vol.\u00a056, pp.\u00a03\u201356 (2009)"},{"key":"9497_CR3","first-page":"214","volume-title":"Proceedings of FUN\u201910","author":"M. Fori\u0161ek","year":"2010","unstructured":"Fori\u0161ek, M.: Computational complexity of two-dimensional platform games. In: Proceedings of FUN\u201910, pp. 214\u2013226 (2010)"},{"key":"9497_CR4","first-page":"47","volume-title":"Proceedings of STOC\u201974","author":"M.R. Garey","year":"1974","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of STOC\u201974, pp. 47\u201363 (1974)"},{"key":"9497_CR5","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"R.A. Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. AK Peters, Wellesley (2009)"},{"key":"9497_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2008-31103","volume":"31","author":"G. Kendall","year":"2008","unstructured":"Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA J. 31, 13\u201334 (2008)","journal-title":"ICGA J."},{"key":"9497_CR7","first-page":"293","volume-title":"Proceedings of FUN\u201912","author":"T. Miltzow","year":"2012","unstructured":"Miltzow, T.: Tron, a\u00a0combinatorial game on abstract graphs. In: Proceedings of FUN\u201912, pp. 293\u2013304 (2012)"},{"key":"9497_CR8","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9497_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J. Ples\u0144ik","year":"1979","unstructured":"Ples\u0144ik, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett. 8, 199\u2013201 (1979)","journal-title":"Inf. Process. Lett."},{"key":"9497_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O. Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1\u201324 (2008)","journal-title":"J. ACM"},{"key":"9497_CR11","first-page":"357","volume-title":"Proceedings of FUN\u201912","author":"G. Viglietta","year":"2012","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it! In: Proceedings of FUN\u201912, pp. 357\u2013367 (2012)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9497-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9497-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9497-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T20:45:21Z","timestamp":1596401121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9497-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,31]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9497"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9497-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,31]]}}}