{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:27:03Z","timestamp":1725496023915},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_42","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"508-519","source":"Crossref","is-referenced-by-count":1,"title":["Undirected Graphs of Entanglement 2"],"prefix":"10.1007","author":[{"given":"Walid","family":"Belkhir","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Santocanale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Artificial Intelligence","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\u2014a 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":"42_CR2","unstructured":"Berwanger, D.: Games and Logical Expressiveness. PhD thesis, RWTH Aachen (2005)"},{"issue":"1","key":"42_CR3","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. Combin. Theory Ser. B\u00a058(1), 22\u201333 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-44683-4_5","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions: A survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 37\u201357. Springer, Heidelberg (2001)"},{"issue":"1","key":"42_CR5","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. Combin. Theory Ser. B\u00a082(1), 138\u2013154 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/11549345_64","volume-title":"Mathematical Foundations of Computer Science 2005","author":"M.A. Safari","year":"2005","unstructured":"Safari, M.A.: d-width: a more natural measure for directed tree width. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 745\u2013756. Springer, Heidelberg (2005)"},{"key":"42_CR7","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":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45793-3_24","volume-title":"Computer Science Logic","author":"D. Berwanger","year":"2002","unstructured":"Berwanger, D., Gr\u00e4del, E., Lenzi, G.: On the variable hierarchy of the modal mu-calculus. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 352\u2013366. Springer, Heidelberg (2002)"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-31856-9_8","volume-title":"STACS 2005","author":"D. Berwanger","year":"2005","unstructured":"Berwanger, D., Lenzi, G.: The variable hierarchy of the \u03bc-calculus is strict. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 97\u2013109. Springer, Heidelberg (2005)"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoret. Comput. Sci.\u00a027(3), 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"42_CR11","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of \u03bc-calculus. Studies in Logic and the Foundations of Mathematics, vol.\u00a0146. North-Holland Publishing Co, Amsterdam (2001)"},{"key":"42_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories. Springer, Berlin (1993)"},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B. Jamison","year":"1988","unstructured":"Jamison, B., Olariu, S.: On the semi-perfect elimination. Adv. in Appl. Math.\u00a09(3), 364\u2013376 (1988)","journal-title":"Adv. in Appl. Math."},{"issue":"1","key":"42_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0166-218X(02)00419-5","volume":"131","author":"V. Chepoi","year":"2003","unstructured":"Chepoi, V., Dragan, F.: Finding a central vertex in an HHD-free graph. Discrete Appl. Math.\u00a0131(1), 93\u2013111 (2003)","journal-title":"Discrete Appl. Math."},{"key":"42_CR15","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, vol.\u00a0B, pp. 193\u2013242. Elsevier, Amsterdam (1990)"},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45995-2_8","volume-title":"LATIN 2002: Theoretical Informatics","author":"E. Goubault","year":"2002","unstructured":"Goubault, E., Rau\u00dfen, M.: Dihomotopy as a tool in state space analysis. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 16\u201337. Springer, Heidelberg (2002)"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzinski","year":"2000","unstructured":"Jurdzinski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"42_CR18","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:10:24Z","timestamp":1558278624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}