{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:44Z","timestamp":1725511784343},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_20","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"224-235","source":"Crossref","is-referenced-by-count":3,"title":["Computing Representations of Matroids of Bounded Branch-Width"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11874683_11","volume-title":"Computer Science Logic","author":"G. Bagan","year":"2006","unstructured":"Bagan, G.: MSO queries on tree decomposable structures are computable with linear delay. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 167\u2013181. Springer, Heidelberg (2006)"},{"key":"20_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":"20_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graph I. Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of graph grammars and computing by graph transformations, vol. 1: Foundations","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, vol. 1: Foundations, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"20_CR6","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Tangles, tree decomposition and grids in matroids. Preprint"},{"issue":"3","key":"20_CR7","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(3), 405\u2013425 (2006)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"20_CR8","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Excluding a planar graph from GF(q)-representable matroids. Manuscript"},{"key":"20_CR9","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Inequivalent representations of matroids I: An overview. In preparation"},{"key":"20_CR10","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":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"20_CR12","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(2), 259\u2013277 (2005)","journal-title":"SIAM J. Computing"},{"key":"20_CR13","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":"J. Combin. Theory Ser. B"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/11821069_44","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: On matroid representatibility and minor problems. In: Mohr, B., et al. (eds.) PVM\/MPI 2006. LNCS, vol.\u00a04192, pp. 505\u2013516. Springer, Heidelberg (2006)"},{"key":"20_CR15","unstructured":"Hlin\u011bn\u00fd, P., Whittle, G.: Matroid tree-width. To appear in European Journal on Combinatorics"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1145\/1109557.1109646","volume-title":"Proc. of SODA","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Certifying large branch-width. In: Proc. of SODA, pp. 810\u2013813. SIAM, Philadelphia (2006)"},{"key":"20_CR17","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. To appear in J. Combin. Theory, Ser.\u00a0B"},{"key":"20_CR18","unstructured":"Oum, S., Seymour, P.: Testing branch-width. To appear in J. Combin. Theory, Ser.\u00a0B"},{"key":"20_CR19","volume-title":"Matroid theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid theory. Oxford University Press, Oxford (1992)"},{"key":"20_CR20","first-page":"229","volume-title":"Actes du Congr\u00e8s International de Math\u00e9maticiens, vol. 3","author":"G.-C. Rota","year":"1970","unstructured":"Rota, G.-C.: Combinatorial theory, old and new. In: Actes du Congr\u00e8s International de Math\u00e9maticiens, vol. 3, pp. 229\u2013233. Gauthier-Villars, Paris (1970)"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P. Seymour","year":"1980","unstructured":"Seymour, P.: Decomposition of regular matroids. J. Combin. Theory Ser. B\u00a028, 305\u2013359 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"20_CR22","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":"20_CR23","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","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:48Z","timestamp":1605762708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_20","relation":{},"subject":[]}}