{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:39Z","timestamp":1759063779793},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_13","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T12:08:51Z","timestamp":1401278931000},"page":"147-157","source":"Crossref","is-referenced-by-count":2,"title":["UNO Gets Easier for a Single Player"],"prefix":"10.1007","author":[{"given":"Palash","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prachi","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alon, Yuster, Zwick: Color-Coding. JACM: Journal of the ACM 42 (1995)","DOI":"10.1145\/210332.210337"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-13122-6_15","volume-title":"Fun with Algorithms","author":"E.D. Demaine","year":"2010","unstructured":"Demaine, E.D., Demaine, M.L., Uehara, R., Uno, T., Uno, Y.: UNO Is Hard, Even for a Single Player. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 133\u2013144. Springer, Heidelberg (2010)"},{"key":"13_CR3","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"13_CR4","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York, Inc. (2006)"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications)","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press, USA (2006)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:05:31Z","timestamp":1558897531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}