{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:01Z","timestamp":1725558961132},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_6","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"55-66","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition Width of Matroids"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","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 fiding embeddings in a k-tree. SIAM J. Alg. Disc. Meth.\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree decomposable graphs. J. Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"H. Bodlaender","year":"1988","unstructured":"Bodlaender, H.: Dynamic programming algorithms on graphs with bounded tree-width. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 105\u2013119. Springer, Heidelberg (1988)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proc. SODA 1993, pp. 226\u2013234. ACM & SIAM (1993)","DOI":"10.1145\/167088.167161"},{"key":"6_CR5","first-page":"12","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graph I. Recognizable sets of finite graphs. Inform. and Comput.\u00a085, 12\u201375 (1990)","journal-title":"Recognizable sets of finite graphs. Inform. and Comput."},{"key":"6_CR6","series-title":"Foundations","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of graph grammars and computing by graph transformations","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations. Foundations, vol.\u00a01, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1006\/jctb.2001.2082","volume":"84","author":"J. Geelen","year":"2002","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Branch-width and well-quasi-ordering in matroids and graphs. J. Combin. Theory Ser. B\u00a084, 270\u2013290 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.jctb.2005.09.005","volume":"96","author":"J. Geelen","year":"2006","unstructured":"Geelen, J., Gerards, B., Whittle, G.: On Rota\u2019s Conjecture and excluded minors containing large projective geometries. J. Combin. Theory Ser.\u00a0B\u00a096, 405\u2013425 (2006)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.jctb.2007.02.005","volume":"97","author":"J. Geelen","year":"2007","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Excluding a planar graph from GF(q)-representable matroids. J. Combin. Theory Ser.\u00a0B\u00a097, 971\u2013998 (2007)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.jctb.2007.10.008","volume":"97","author":"J. Geelen","year":"2009","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Tangles, tree-decompositions, and grids in matroids. J. Combin. Theory Ser.\u00a0B\u00a097, 657\u2013667 (2009)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-36494-3_29","volume-title":"STACS 2003","author":"P. Hlin\u011bn\u00fd","year":"2003","unstructured":"Hlin\u011bn\u00fd, P.: Branch-width, parse trees, and monadic second-order logic for matroids. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 319\u2013330. Springer, Heidelberg (2003)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-540-45138-9_41","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Hlin\u011bn\u00fd","year":"2003","unstructured":"Hlin\u011bn\u00fd, P.: On matroid properties definable in the MSO logic. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 470\u2013479. Springer, Heidelberg (2003)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S0097539702418589","volume":"35","author":"P. Hlin\u011bn\u00fd","year":"2005","unstructured":"Hlin\u011bn\u00fd, P.: A parametrized algorithm for matroid branch-width. SIAM J. Computing\u00a035, 259\u2013277 (2005)","journal-title":"SIAM J. Computing"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2005.08.005","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Branch-width, parse trees, and monadic second-order logic for matroids, J. Combin. Theory Ser. B\u00a096, 325\u2013351 (2006)","journal-title":"Combin. Theory Ser. B"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/11821069_44","volume-title":"Mathematical Foundations of Computer Science 2006","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: On matroid representability and minor problems. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 505\u2013516. Springer, Heidelberg (2006)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1017\/S0963548305007297","volume":"15","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: The Tutte polynomial for matroids of bounded branch-width. Combin. Probab. Comput.\u00a015, 397\u2013406 (2006)","journal-title":"Combin. Probab. Comput."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding branch-decomposition and rank-decomposition. SIAM J. Computing\u00a038, 1012\u20131032 (2008)","journal-title":"SIAM J. Computing"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ejc.2006.06.005","volume":"27","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P., Whittle, G.: Matroid tree-width. Europ. J. Combin.\u00a027, 1117\u20131128 (2006)","journal-title":"Europ. J. Combin."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.ejc.2008.09.028","volume":"30","author":"P. Hlin\u011bn\u00fd","year":"2009","unstructured":"Hlin\u011bn\u00fd, P., Whittle, G.: Addendum to Matroid tree-Width. Europ. J. Combin.\u00a030, 1036\u20131044 (2009)","journal-title":"Europ. J. Combin."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-70918-3_20","volume-title":"STACS 2007","author":"D. Kr\u00e1l\u2019","year":"2007","unstructured":"Kr\u00e1l\u2019, D.: Computing representations of matroids of bounded branch-width. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 224\u2013235. Springer, Heidelberg (2007)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B\u00a096, 514\u2013528 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jctb.2006.06.006","volume":"97","author":"S. Oum","year":"2007","unstructured":"Oum, S., Seymour, P.D.: Testing branch-width. J. Combin. Theory Ser. B\u00a097, 385\u2013393 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR23","series-title":"Oxford Graduate Texts in Mathematics","volume-title":"Matroid theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid theory. Oxford Graduate Texts in Mathematics, vol.\u00a03. Oxford University Press, Oxford (1992)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02579179","volume":"1","author":"P. Seymour","year":"1981","unstructured":"Seymour, P.: Recognizing graphic matroids. Combinatorica\u00a01, 75\u201378 (1981)","journal-title":"Combinatorica"},{"key":"6_CR25","unstructured":"Strozecki, Y.: A logical approach to decomposable matroids, arXiv 0908.4499"},{"key":"6_CR26","volume-title":"Matroid decomposition","author":"K. Truemper","year":"1992","unstructured":"Truemper, K.: Matroid decomposition. Academic Press, London (1992)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:35Z","timestamp":1619785235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}