{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:32:25Z","timestamp":1745469145792,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_33","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"299-308","source":"Crossref","is-referenced-by-count":0,"title":["Induced Immersions"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"DeVos, M., Dvo\u0159\u00e1k, Z., Fox, J., McDonald, J., Mohar, B., Scheide, D.: Minimum degree condition forcing complete graph immersion (submitted for publication)"},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.26493\/1855-3974.112.b74","volume":"3","author":"M. DeVos","year":"2010","unstructured":"DeVos, M., Kawarabayashi, K., Mohar, B., Okamura, H.: Immersing small complete graphs. Ars Math. Contemp.\u00a03, 139\u2013146 (2010)","journal-title":"Ars Math. Contemp."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Electronic edn. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter intractability. In: Structure in Complexity Theory Conference, pp. 36\u201349 (1992)","DOI":"10.1109\/SCT.1992.215379"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-011-9545-y","volume":"64","author":"M.R. Fellows","year":"2012","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A.: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Algorithmica\u00a064, 3\u201318 (2012)","journal-title":"Algorithmica"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"M.R. Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica\u00a013, 266\u2013282 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0405010","volume":"5","author":"M.R. Fellows","year":"1992","unstructured":"Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Disc. Math.\u00a05(1), 117\u2013126 (1992)","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/jgt.20283","volume":"57","author":"M. Ferrara","year":"2008","unstructured":"Ferrara, M., Gould, R., Tansey, G., Whalen, T.: On H-immersions. J. Graph Theory\u00a057, 245\u2013254 (2008)","journal-title":"J. Graph Theory"},{"issue":"4","key":"33_CR10","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Computing"},{"key":"33_CR11","unstructured":"Giannopoulou, A., Kami\u0144ski, M., Thilikos, D.M.: Forbidding Kuratowski graphs as immersions (manuscript)"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological sugraphs is fixed-parameter tractable. In: STOC 2011, pp. 479\u2013488. ACM (2011)","DOI":"10.1145\/1993636.1993700"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: STOC 2012, pp. 173\u2013192. ACM (2012)","DOI":"10.1145\/2213977.2213996"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K. Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B\u00a0102, 424\u2013435 (2012)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"17","key":"33_CR15","doi-asserted-by":"publisher","first-page":"3540","DOI":"10.1016\/j.dam.2009.02.015","volume":"157","author":"B. L\u00e9v\u00eaque","year":"2009","unstructured":"L\u00e9v\u00eaque, B., Lin, D.Y., Maffray, F., Trotignon, N.: Detecting induced subgraphs. Discrete Applied Math.\u00a0157(17), 3540\u20133551 (2009)","journal-title":"Discrete Applied Math."},{"issue":"1","key":"33_CR16","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.D.: Graph minors XIII: The disjoint paths problem. J. Comb. Theory, Ser. B\u00a063(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"33_CR17","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"},{"issue":"2","key":"33_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N. Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors XXIII: Nash-Williams\u2019 immersion conjecture. J. Comb. Theory, Ser. B\u00a0100(2), 181\u2013205 (2010)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N. Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B\u00a062(2), 323\u2013348 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"33_CR20","unstructured":"Seymour, P.D., Wollan, P.: The structure of graphs not admitting a fixed immersion (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:55:07Z","timestamp":1745430907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}