{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:05Z","timestamp":1725497165376},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_26","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"270-279","source":"Crossref","is-referenced-by-count":2,"title":["Characterization and Recognition of Digraphs of Bounded Kelly-width"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Meister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_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":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: Characterizations, Applications, and Computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 1\u201314. Springer, Heidelberg (2006)"},{"key":"26_CR3","first-page":"637","volume-title":"SODA 2007","author":"P. Hunter","year":"2007","unstructured":"Hunter, P., Kreutzer, S.: Digraph Measures: Kelly Decompositions, Games, and Orderings. In: SODA 2007. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 637\u2013644. ACM Press, New York (2007)"},{"key":"26_CR4","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. Journal of Combinatorial Theory, Series B\u00a082, 138\u2013154 (2001)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"26_CR5","unstructured":"Meister, D., Telle, J.A., Vatshelle, M.: Characterization and recognition of digraphs of bounded Kelly-width. Technical report no. 351, Institutt for Informatikk, Universitetet i Bergen (2007)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1145\/1109557.1109647","volume-title":"SODA 2006","author":"J. Obdr\u017e\u00e1lek","year":"2006","unstructured":"Obdr\u017e\u00e1lek, J.: DAG-width \u2013 Connectivity Measure for Directed Graphs. In: SODA 2006. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 814\u2013821. ACM Press, New York (2006)"},{"key":"26_CR7","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)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:33Z","timestamp":1619520153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_26","relation":{},"subject":[]}}