{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:08:01Z","timestamp":1725538081873},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_16","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"169-180","source":"Crossref","is-referenced-by-count":2,"title":["Directed Graphs of Entanglement Two"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","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":"16_CR2","first-page":"814","volume-title":"Proc. of SODA\u00a02006","author":"J. Obdr\u017e\u00e1lek","year":"2006","unstructured":"Obdr\u017e\u00e1lek, J.: Dag-width: connectivity measure for directed graphs. In: Proc. of SODA\u00a02006, pp. 814\u2013821. ACM Press, New York (2006)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Ordyniak, S.: Digraph decompositions and monotonicity in digraph searching. CoRR abs\/0802.2228 (2008)","DOI":"10.1007\/978-3-540-92248-3_30"},{"key":"16_CR4","first-page":"637","volume-title":"Proc. of SODA 2007","author":"P. Hunter","year":"2007","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: Proc. of SODA 2007, pp. 637\u2013644. SIAM, Philadelphia (2007)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 \u2014 a measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.\u00a03452, pp. 209\u2013223. Springer, Heidelberg (2005)"},{"issue":"1","key":"16_CR6","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":"16_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1307\/mmj\/1028998975","volume":"10","author":"L.C. Eggan","year":"1963","unstructured":"Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J.\u00a010, 385\u2013397 (1963)","journal-title":"Michigan Math. J."},{"key":"16_CR8","unstructured":"Safari, M.A.: D-width, metric embedding, and their connections. PhD thesis, Vancouver, BC, Canada (2007)"},{"key":"16_CR9","unstructured":"Hunter, P.: Complexity and Infinite Games on Finite Graphs. PhD thesis, Computer Laboratory, University of Cambridge (2007)"},{"key":"16_CR10","unstructured":"Rabinovich, R.: Complexity measures of directed graphs. Diploma thesis, RWTH-Aachen (2008)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00224-006-1317-8","volume":"40","author":"D. Berwanger","year":"2007","unstructured":"Berwanger, D., Gr\u00e4del, E., Lenzi, G.: The variable hierarchy of the \u03bc-calculus is strict. Theory of Computing Systems\u00a040, 437\u2013466 (2007)","journal-title":"Theory of Computing Systems"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-87531-4_26","volume-title":"Computer Science Logic","author":"A. Dawar","year":"2008","unstructured":"Dawar, A., Gr\u00e4del, E.: The descriptive complexity of parity games. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 354\u2013368. Springer, Heidelberg (2008)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Kaiser, \u0141., Rabinovich, R.: Directed graphs of entanglement two (Full version) (2009), www.logic.rwth-aachen.de\/Publications","DOI":"10.1007\/978-3-642-03409-1_16"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-77050-3_42","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"W. Belkhir","year":"2007","unstructured":"Belkhir, W., Santocanale, L.: Undirected graphs of entanglement 2. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 508\u2013519. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:15:50Z","timestamp":1558523750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}