{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:47Z","timestamp":1725562907121},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_53","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T16:17:45Z","timestamp":1281716265000},"page":"604-615","source":"Crossref","is-referenced-by-count":0,"title":["Parity Games with Partial Information Played on Graphs of Bounded Complexity"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Puchala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J. Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics\u00a022, 161\u2013172 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11672142_43","volume-title":"STACS 2006","author":"D. Berwanger","year":"2006","unstructured":"Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 524\u2013536. Springer, Heidelberg (2006)"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-85361-9_27","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D. Berwanger","year":"2008","unstructured":"Berwanger, D., et al.: Strategy Construction for Parity Games with Imperfect Information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 325\u2013339. Springer, Heidelberg (2008)"},{"key":"53_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-540-32275-7_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2005","unstructured":"Berwanger, D., Gr\u00e4del, E.: Entanglement \u2013 a measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 209\u2013223. Springer, Heidelberg (2005)"},{"key":"53_CR5","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, pp. 193\u2013242. Elsevier, Amsterdam (1990)"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-03409-1_16","volume-title":"FCT 2009","author":"E. Gr\u00e4del","year":"2009","unstructured":"Gr\u00e4del, E., Kaiser, \u0141., Rabinovich, R.: Directed Graphs of Entanglement Two. In: Ge\u0327bala, M. (ed.) FCT 2009. LNCS, vol.\u00a05699, pp. 169\u2013181. Springer, Heidelberg (2009)"},{"key":"53_CR7","unstructured":"Hunter, P.: Losing the +1 or directed path-width games are monotone (2006), http:\/\/www.comlab.ox.ac.uk\/people\/paul.hunter\/papers\/losing.pdf"},{"key":"53_CR8","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: SODA, pp. 637\u2013644 (2007)"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T. Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B\u00a082(1), 138\u2013154 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"53_CR10","unstructured":"Jurdzi\u0144ski, M.: Games for Verification: Algorithmic Issues. PhD thesis, University of Aarhus (2000)"},{"key":"53_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-92248-3_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Kreutzer","year":"2008","unstructured":"Kreutzer, S., Ordyniak, S.: Digraph Decompositions and Monotonicity in Digraph Searching. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 336\u2013347. Springer, Heidelberg (2008)"},{"key":"53_CR12","unstructured":"Obdr\u017e\u00e1lek, J.: Algorithmic Analysis of Parity Games. PhD thesis, School of Informatics, University of Edinburgh (2006)"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Obdr\u017e\u00e1lek, J.: Dag-width: connectivity measure for directed graphs. In: SODA, pp. 814\u2013821 (2006)","DOI":"10.1145\/1109557.1109647"},{"key":"53_CR14","unstructured":"Puchala, B.: Infinite Two Player Games with Partial Information: Logic and Algorithms. Diploma Thesis, RWTH Aachen (2008)"},{"key":"53_CR15","first-page":"274","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The Complexity of Two-player Games of Incomplete Information. JCSS\u00a029, 274\u2013301 (1984)","journal-title":"JCSS"},{"issue":"1","key":"53_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Ser. B\u00a058(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"53_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 1995","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the Synthesis of Strategies in Infinite Games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:01:48Z","timestamp":1606168908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}