{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:11Z","timestamp":1760202611730},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_31","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"322-333","source":"Crossref","is-referenced-by-count":4,"title":["Faster Parameterized Algorithms for Minor Containment"],"prefix":"10.1007","author":[{"given":"Isolde","family":"Adler","sequence":"first","affiliation":[]},{"given":"Frederic","family":"Dorn","sequence":"additional","affiliation":[]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Faster Parameterized Algorithms for Minor Containment (2010), http:\/\/users.uoa.gr\/~sedthilk\/papers\/minorch.pdf","DOI":"10.1007\/978-3-642-13731-0_31"},{"key":"31_CR2","unstructured":"Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 641\u2013650 (2008)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science. Formal Models and Semantics (B), vol.\u00a0B, pp. 193\u2013242 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally Excluding a Minor. In: Proc. of the 22nd IEEE Symposium on Logic in Computer Science (LICS), pp. 270\u2013279 (2007)","DOI":"10.1109\/LICS.2007.31"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.-i.: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. In: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 637\u2013646 (2005)","DOI":"10.1109\/SFCS.2005.14"},{"key":"31_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, vol.\u00a0173. Springer, Heidelberg (2005)"},{"key":"31_CR7","unstructured":"Dorn, F.: Planar Subgraph Isomorphism Revisited. In: Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 263\u2013274 (2010)"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M.R. Fellows","year":"1988","unstructured":"Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM\u00a035(3), 727\u2013739 (1988)","journal-title":"Journal of the ACM"},{"key":"31_CR9","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2008","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)"},{"key":"31_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"1","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.10099","volume":"43","author":"I.V. Hicks","year":"2004","unstructured":"Hicks, I.V.: Branch decompositions and minor containment. Networks\u00a043(1), 1\u20139 (2004)","journal-title":"Networks"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-i., Reed, B.A.: Hadwiger\u2019s conjecture is decidable. In: Proc. of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 445\u2013454 (2009)","DOI":"10.1145\/1536414.1536476"},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics\u00a0108, 143\u2013364 (1992)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.: Graph Minors. XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory, Series B\u00a063(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XX. Wagner\u2019s conjecture. J. Comb. Theory, Ser. B\u00a092(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Ru\u00e9, J., Sau, I., Thilikos, D.M.: Dynamic Programming for Graphs on Surfaces. To appear in Proc. of the 37th International Colloquium on Automata, Languages and Programming, ICALP (2010)","DOI":"10.1007\/978-3-642-14165-2_32"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:23Z","timestamp":1606185743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}