{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:36:45Z","timestamp":1747888605063,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_25","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"390-404","source":"Crossref","is-referenced-by-count":1,"title":["Parity Games of Bounded Tree- and Clique-Width"],"prefix":"10.1007","author":[{"given":"Moses","family":"Ganardi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60218-6_1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local model checking games. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP \u2229 co-UP. Information Processing Letters\u00a068(3), 119\u2013124 (1998)","journal-title":"Information Processing Letters"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45069-6_7","volume-title":"Computer Aided Verification","author":"J. Obdr\u017e\u00e1lek","year":"2003","unstructured":"Obdr\u017e\u00e1lek, J.: Fast mu-calculus model checking when tree-width is bounded. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 80\u201392. Springer, Heidelberg (2003)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-74915-8_8","volume-title":"Computer Science Logic","author":"J. Obdr\u017e\u00e1lek","year":"2007","unstructured":"Obdr\u017e\u00e1lek, J.: Clique-width and parity games. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 54\u201368. Springer, Heidelberg (2007)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-31585-5_20","volume-title":"Automata, Languages, and Programming","author":"J. Fearnley","year":"2012","unstructured":"Fearnley, J., Schewe, S.: Time and parallelizability results for parity games with bounded treewidth. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 189\u2013200. Springer, Heidelberg (2012)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I.H. Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery\u00a025(3), 405\u2013414 (1978)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-009-9227-1","volume":"48","author":"S. G\u00f6ller","year":"2011","unstructured":"G\u00f6ller, S., Lohrey, M.: Fixpoint logics over hierarchical structures. Theory Comput. Syst.\u00a048(1), 93\u2013131 (2011)","journal-title":"Theory Comput. Syst."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Texts in Theoretical Computer Science. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science, pp. 368\u2013377. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-60922-9_33","volume-title":"STACS 96","author":"I. Walukiewicz","year":"1996","unstructured":"Walukiewicz, I.: Monadic second order logic on tree-like structures. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 401\u2013413. Springer, Heidelberg (1996)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of Bodlaender and Courcelle. In: 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 143\u2013152 (2010)","DOI":"10.1109\/FOCS.2010.21"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04761-9_15","volume-title":"Automated Technology for Verification and Analysis","author":"O. Friedmann","year":"2009","unstructured":"Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 182\u2013196. Springer, Heidelberg (2009)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BFb0017393","volume-title":"Graph Grammars and Their Application to Computer Science","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B.: Graphs as relational structures: An algebraic and logical approach. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 238\u2013252. Springer, Heidelberg (1991)"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Downey, M.R.R.G., Fellows: Parameterized Complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1-3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discrete Math.\u00a023(2), 909\u2013939 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-45127-7_16","volume-title":"Rewriting Techniques and Applications","author":"M. Lohrey","year":"2001","unstructured":"Lohrey, M.: On the parallel complexity of tree automata. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 201\u2013215. Springer, Heidelberg (2001)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36387-4"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/BFb0028825","volume-title":"Fundamentals of Computation Theory","author":"D. Seese","year":"1985","unstructured":"Seese, D.: Tree-partite graphs and the complexity of algorithms. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 412\u2013421. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:42Z","timestamp":1747857462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}