{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:46Z","timestamp":1725897646054},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_24","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"239-250","source":"Crossref","is-referenced-by-count":2,"title":["Deciding First Order Properties of Matroids"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Gaven\u010diak","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l","sequence":"additional","affiliation":[]},{"given":"Sang-il","family":"Oum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In: Proc. STOC 1994, pp. 326\u2013335. ACM (1994)","DOI":"10.1145\/195058.195179"},{"key":"24_CR2","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. Inform. and Comput.\u00a085, 12\u201375 (1990)","journal-title":"Inform. and Comput."},{"key":"24_CR3","doi-asserted-by":"crossref","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 (1997)","DOI":"10.1142\/9789812384720_0005"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Proc. LICS 2007, pp. 270\u2013279. IEEE Computer Society Press (2007)","DOI":"10.1109\/LICS.2007.31"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput.\u00a029, 545\u2013570 (1999)","journal-title":"SIAM J. Comput."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: Proc. FOCS 2010, pp. 133\u2013142 (2010)","DOI":"10.1109\/FOCS.2010.20"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algor. Appli.\u00a03, 1\u201327 (1999)","journal-title":"J. Graph Algor. Appli."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica\u00a027, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/504794.504798","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM\u00a048, 1184\u20131206 (2001)","journal-title":"Journal of the ACM"},{"key":"24_CR10","volume-title":"Proc. of Herbrand Symposium, Logic Colloquium 1981","author":"H. Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and non-local properties. In: Proc. of Herbrand Symposium, Logic Colloquium 1981. North-Holland, Amsterdam (1982)"},{"key":"24_CR11","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)"},{"issue":"2","key":"24_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":"24_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":"24_CR14","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":"24_CR15","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":"24_CR16","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. European J. Combin.\u00a027, 1117\u20131128 (2006)","journal-title":"European J. Combin."},{"key":"24_CR17","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. European J. Combin.\u00a030, 1036\u20131044 (2009)","journal-title":"European J. Combin."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Thorup, M.: Minimum k-way cut of bounded size is fixed-parameter tractable. In: Proc. FOCS 2011, pp. 160\u2013169. IEEE (2011)","DOI":"10.1109\/FOCS.2011.53"},{"key":"24_CR19","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.: Approximating clique-width and branch-width. J. Combin. Theory, Ser. B\u00a096, 514\u2013528 (2006)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"24_CR20","unstructured":"Oxley, J.G.: Matroid theory. Oxford University Press (1992)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1006\/inco.1993.1020","volume":"103","author":"D. Peleg","year":"1993","unstructured":"Peleg, D.: Distance-dependent distributed directories. Info. Computa.\u00a0103, 270\u2013298 (1993)","journal-title":"Info. Computa."},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X.\u00a0Obstructions to tree-decompositions. J. Combin. Theory Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"24_CR23","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":"24_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":"24_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0095-8956(90)90030-4","volume":"49","author":"K. Truemper","year":"1990","unstructured":"Truemper, K.: A decomposition theory for matroids V. Testing of matrix total unimodularity. J. Combin. Theory Ser. B\u00a049, 241\u2013281 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"24_CR26","unstructured":"Truemper, K.: Matroid decomposition. Academic Press (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-31585-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:33Z","timestamp":1620130413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}