{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089441},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_19","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"194-205","source":"Crossref","is-referenced-by-count":0,"title":["MSOL Restricted Contractibility to Planar Graphs"],"prefix":"10.1007","author":[{"given":"James","family":"Abello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vysko\u010dil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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 Comput. System Sci.\u00a026, 197\u2013208 (1983)","journal-title":"Journal Comput. System Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small tree-width. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR3","first-page":"257","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. ITA\u00a026, 257\u2013286 (1992)","journal-title":"ITA"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.dam.2010.05.005","volume":"160","author":"P. Hof van\u2019t","year":"2012","unstructured":"van\u2019t Hof, P., Kami\u0144ski, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Applied Mathematics\u00a0160, 799\u2013809 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR5","unstructured":"Golovach, P.A., van\u2019t Hof, P., Paulusma, P.: Obtaining Planarity by Contracting Few Edges. CoRR, abs\/1204.5113 (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1204.5113"},{"key":"19_CR6","unstructured":"Abello, J., Klav\u00edk, P., Kratochv\u00edl, J., Vysko\u010dil, T.: Matching and \u2113-Subgraph Contractibility to Planar Graphs. CoRR, abs\/1204.6070 (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1204.6070"},{"issue":"3","key":"19_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(3), 266\u2013282 (1995)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Discr. Meth.\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Discr. Meth."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jcss.2003.07.008","volume":"68","author":"M. Grohe","year":"2004","unstructured":"Grohe, M.: Computing crossing numbers in quadratic time. J. Comput. Syst. Sci.\u00a068(2), 285\u2013302 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient Planarity Testing. J. ACM (JACM)\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM (JACM)"},{"key":"19_CR11","unstructured":"Heggernes, P., van\u2019t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. In: Proc. FSTTCS 2011, pp. 217\u2013228 (2011)"},{"key":"19_CR12","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":"19_CR13","unstructured":"Bojan, M., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0129054100000247","volume":"11","author":"L. Perkovic\u0300","year":"2000","unstructured":"Perkovic\u0300, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. International Journal of Foundations of Computer Science\u00a011(3), 365\u2013371 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"19_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:24Z","timestamp":1620129804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}