{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:20Z","timestamp":1725512120907},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797227"},{"type":"electronic","value":"9783540797234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79723-4_17","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T10:22:17Z","timestamp":1210069337000},"page":"172-189","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Chess"],"prefix":"10.1007","author":[{"given":"Allan","family":"Scott","sequence":"first","affiliation":[]},{"given":"Ulrike","family":"Stege","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"K. Abrahamson","year":"1995","unstructured":"Abrahamson, K., Downey, R., Fellows, M.: Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. A.\u00a0of Pure and Applied Logic\u00a073, 235\u2013276 (1995)","journal-title":"A.\u00a0of Pure and Applied Logic"},{"issue":"2","key":"17_CR2","first-page":"361","volume":"31","author":"A. Adachi","year":"1984","unstructured":"Adachi, A., Iwata, S., Kasai, T.: Some combinatorial game problems require \u03c9(n\n                \n                  k\n                ) time. J.\u00a0ACM\u00a031(2), 361\u2013376 (1984)","journal-title":"J.\u00a0ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"17_CR4","first-page":"278","volume":"115","author":"A. Fraenkel","year":"1981","unstructured":"Fraenkel, A., Lichtenstein, D.: Computing a perfect strategy for n\u00d7n chess requires time exponential in n. LNCS\u00a0115, 278\u2013293 (1981)","journal-title":"LNCS"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1137\/0208046","volume":"8","author":"T. Kasai","year":"1979","unstructured":"Kasai, T., Adachi, A., Iwata, S.: Classes of pebble games and complete problems. SIAM J.\u00a0Comput.\u00a08(4), 574\u2013586 (1979)","journal-title":"SIAM J.\u00a0Comput."},{"key":"17_CR6","unstructured":"Scott, A.: Short pursuit-evasion. Texts in Algorithmics\u00a07: Algorithms and Complexity in Durham 2006, 141\u2013152 (2006)"},{"key":"17_CR7","unstructured":"FIDE Handbook (Online Version): Chess rules, \n                  \n                    http:\/\/www.fide.com\/official\/handbook.asp?level=EE101"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79723-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:30:00Z","timestamp":1619523000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_17","relation":{},"subject":[]}}