{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:42:52Z","timestamp":1725698572265},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_41","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T04:44:32Z","timestamp":1343796272000},"page":"455-466","source":"Crossref","is-referenced-by-count":2,"title":["Obtaining Planarity by Contracting Few Edges"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","first-page":"1204","volume":"arXiv","author":"J. Abello","year":"2012","unstructured":"Abello, J., Klav\u00edk, P., Kratochv\u00edl, J., Vysko\u010dil, T.: Matching and \u2113-subgraph contractibility to planar graphs. Manuscript, arXiv:1204.6070 (2012)","journal-title":"Manuscript"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(83)90012-0","volume":"26","author":"T. Asano","year":"1983","unstructured":"Asano, T., Hirata, T.: Edge-contraction problems. Journal of Computer and System Sciences\u00a026, 197\u2013208 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0095-8956(78)90073-4","volume":"24","author":"A. Bouchet","year":"1978","unstructured":"Bouchet, A.: Orientable and nonorientable genus of the complete bipartite graph. Journal of Combinatorial Theory, Series B\u00a024, 24\u201333 (1978)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"41_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 graphs. I. Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-28050-4_6","volume-title":"Parameterized and Exact Computation","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Increasing the Minimum Degree of a Graph by Contractions. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 67\u201379. Springer, Heidelberg (2012)"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"4100","DOI":"10.1016\/j.tcs.2010.07.017","volume":"412","author":"Q.-P. Gu","year":"2011","unstructured":"Gu, Q.-P., Tamaki, H.: Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n\n                1\u2009+\u2009\u03b5\n                ) time. Theoretical Computer Science\u00a0412, 4100\u20134109 (2011)","journal-title":"Theoretical Computer Science"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. In: Proc. LAGOS 2011. ENDM, vol.\u00a037, pp. 87\u201392 (2011)","DOI":"10.1016\/j.endm.2011.05.016"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-28050-4_5","volume-title":"Parameterized and Exact Computation","author":"P. Heggernes","year":"2012","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Lokshtanov, D., Paul, C.: Contracting Graphs to Paths and Trees. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 55\u201366. Springer, Heidelberg (2012)"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van \u2019t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. Algorithmica (to appear), doi: 10.1007\/s00453-012-9670-2","DOI":"10.1007\/s00453-012-9670-2"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-15775-2_11","volume-title":"Algorithms \u2013 ESA 2010","author":"M. Kami\u0144ski","year":"2010","unstructured":"Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Contractions of Planar Graphs in\u00a0Polynomial\u00a0Time. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 122\u2013133. Springer, Heidelberg (2010)"},{"key":"41_CR11","unstructured":"Kami\u0144ski, M., Thilikos, D.M.: Contraction checking in graphs on surfaces. In: Proc. STACS, pp. 182\u2013193 (2012)"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.: Planarity allowing few error vertices in linear time. In: Proc. FOCS, pp. 639\u2013648 (2009)","DOI":"10.1109\/FOCS.2009.45"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.A.: Computing crossing number in linear time. In: Proc. STOC, pp. 382\u2013390 (2007)","DOI":"10.1145\/1250790.1250848"},{"key":"41_CR14","first-page":"1110","volume":"arXiv","author":"D. Marx","year":"2012","unstructured":"Marx, D., O\u2019Sullivan, B., Razgon, I.: Finding small separators in linear time via treewidth reduction. Manuscript, arXiv:1110.4765 (2012)","journal-title":"Manuscript"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s00453-010-9484-z","volume":"62","author":"D. Marx","year":"2012","unstructured":"Marx, D., Schlotter, I.: Obtaining a planar graph by vertex deletion. Algorithmica\u00a062, 807\u2013822 (2012)","journal-title":"Algorithmica"},{"key":"41_CR16","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.: Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B\u00a062, 323\u2013348 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"41_CR17","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. Journal of Combinatorial Theory, Series B\u00a063, 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"41_CR18","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. Journal of Combinatorial Theory, Series B\u00a092, 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.jctb.2007.12.007","volume":"102","author":"N. Robertson","year":"2012","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XXII: Irrelevant vertices in linkage problems. Journal of Combinatorial Theory, Series B\u00a0102, 530\u2013563 (2012)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:19:00Z","timestamp":1556943540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}