{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:48:15Z","timestamp":1780822095182,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041273","type":"print"},{"value":"9783642041280","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_63","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"706-717","source":"Crossref","is-referenced-by-count":12,"title":["Contraction Bidimensionality: The Accurate Picture"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"63_CR1","first-page":"270","volume-title":"LICS 2007","author":"A. Dawar","year":"2007","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270\u2013279. IEEE Computer Society, Los Alamitos (2007)"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"E. Demaine","year":"2007","unstructured":"Demaine, E., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal\u00a051, 292\u2013302 (2007)","journal-title":"The Computer Journal"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0895480103433410","volume":"18","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discrete Math.\u00a018, 501\u2013511 (2004\/2005)","journal-title":"SIAM J. Discrete Math."},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM\u00a052, 866\u2013893 (2005)","DOI":"10.1145\/1101821.1101823"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00493-008-2140-4","volume":"28","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica\u00a028, 19\u201336 (2008)","journal-title":"Combinatorica"},{"key":"63_CR6","first-page":"637","volume-title":"FOCS 2005","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS 2005, pp. 637\u2013646. IEEE Computer Society, Los Alamitos (2005)"},{"key":"63_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Improved grid minor bounds and Wagner\u2019s contraction. Algorithmica (to appear, 2009)","DOI":"10.1007\/s00453-007-9138-y"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/040616929","volume":"20","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: The bidimensional theory of bounded-genus graphs. SIAM J. Discrete Math.\u00a020, 357\u2013371 (2006) (electronic)","journal-title":"SIAM J. Discrete Math."},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cosrev.2008.02.004","volume":"2","author":"F. Dorn","year":"2008","unstructured":"Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comp. Sci. Rev.\u00a02, 29\u201339 (2008)","journal-title":"Comp. Sci. Rev."},{"key":"63_CR10","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.ejc.2003.07.007","volume":"25","author":"J.F. Geelen","year":"2004","unstructured":"Geelen, J.F., Richter, R.B., Salazar, G.: Embedding grids in surfaces. European J. Combin.\u00a025, 785\u2013792 (2004)","journal-title":"European J. Combin."},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.4153\/CJM-1992-076-8","volume":"44","author":"B. Mohar","year":"1992","unstructured":"Mohar, B.: Combinatorial local planarity and the width of graph embeddings. Canad. J. Math.\u00a044, 1272\u20131288 (1992)","journal-title":"Canad. J. Math."},{"key":"63_CR12","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"key":"63_CR13","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., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B\u00a062, 323\u2013348 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"63_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0606030","volume":"6","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.D.: Disjoint paths\u2014a survey. SIAM J. Algebraic Discrete Methods\u00a06, 300\u2013305 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"63_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Series B\u00a041, 92\u2013114 (1986)","journal-title":"J. Comb. Theory Series B"},{"key":"63_CR16","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. Obstructions to tree-decomposition. J. Combin. Theory Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N. Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B\u00a089, 43\u201376 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"63_CR18","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. Combin. Theory Ser. B\u00a062, 323\u2013348 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"63_CR19","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jctb.1997.1761","volume":"70","author":"C. Thomassen","year":"1997","unstructured":"Thomassen, C.: A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B\u00a070, 306\u2013311 (1997)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:09:38Z","timestamp":1685113778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}