{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:52Z","timestamp":1725475012140},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_3","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"3-15","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner\u2019s Contraction"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00453-001-0116-5","volume":"33","author":"J. Alber","year":"2002","unstructured":"Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica\u00a033(4), 461\u2013493 (2002)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jalgor.2004.03.005","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. Journal of Algorithms\u00a052(1), 26\u201356 (2004)","journal-title":"Journal of Algorithms"},{"key":"3_CR3","unstructured":"B\u00f6hme, T., Kawarabayashi, K.-i., Maharry, J., Mohar, B.: Linear connectivity forces large complete bipartite minors (October 2004) (manuscript), \n \n http:\/\/www.dais.is.tohoku.ac.jp\/~k_keniti\/KakNew8.ps"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jctb.2002.2119","volume":"86","author":"T. B\u00f6hme","year":"2002","unstructured":"B\u00f6hme, T., Maharry, J., Mohar, B.: K\n \n a,k\n minors in graphs of bounded tree-width. Journal of Combinatorial Theory, Series B\u00a086(1), 133\u2013147 (2002)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR5","unstructured":"Bouchitt\u00e9, V., Mazoit, F., Todinca, I.: Treewidth of planar graphs: connections with duality. In: Proceedings of the Euroconference on Combinatorics, Graph Theory and Applications (Barcelona, 2001) (2001)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-45477-2_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.-S. Chang","year":"2001","unstructured":"Chang, M.-S., Kloks, T., Lee, C.-M.: Maximum clique transversals. In: Brandst\u00e4dt, A., Van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 32\u201343. Springer, Heidelberg (2001)"},{"key":"3_CR7","unstructured":"Chen, G., Sheppardson, L., Yu, X., Zang, W.: Circumference of graphs with no K\n 3,t\n -minors (submitted manuscript), \n \n http:\/\/www.math.gatech.edu\/~yu\/Papers\/k3t2-10.pdf"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041(2), 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.2001.1178","volume":"41","author":"Z.-Z. Chen","year":"2001","unstructured":"Chen, Z.-Z.: Approximation algorithms for independent sets in map graphs. Journal of Algorithms\u00a041(1), 20\u201340 (2001)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/506147.506148","volume":"49","author":"Z.-Z. Chen","year":"2002","unstructured":"Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Map graphs. Journal of the ACM\u00a049(2), 127\u2013138 (2002)","journal-title":"Journal of the ACM"},{"issue":"3","key":"3_CR11","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 Journal on Discrete Mathematics\u00a018(3), 501\u2013511 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1077464.1077468","volume":"1","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms\u00a01(1), 33\u201347 (2005)","journal-title":"ACM Transactions on Algorithms"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","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. Journal of the ACM\u00a052(6), 866\u2013893 (2005)","journal-title":"Journal of the ACM"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.: Quickly deciding minor-closed parameters in general graphs. European Journal of Combinatorics (to appear)","DOI":"10.1016\/j.ejc.2005.07.003"},{"key":"3_CR15","unstructured":"Demaine, E.D., Hajiaghayi, M.: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), January 2004, pp. 833\u2013842 (2004)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-540-31843-9_57","volume-title":"Graph Drawing","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.: Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 517\u2013533. Springer, Heidelberg (2005)"},{"key":"3_CR17","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: New connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, January 2005, pp. 590\u2013601 (2005)"},{"key":"3_CR18","unstructured":"Demaine, E.D., Hajiaghayi, M.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, January 2005, pp. 682\u2013689 (2005)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.-i.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, October 2005, pp. 637\u2013646 (2005)","DOI":"10.1109\/SFCS.2005.14"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jcss.2003.12.001","volume":"69","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Hajiaghayi, M., Nishimura, N., Ragde, P., Thilikos, D.M.: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences\u00a069(2), 166\u2013195 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45753-4_8","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: A 1.5-approximation for treewidth of graphs excluding a graph with one crossing. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 67\u201380. Springer, Heidelberg (2002)"},{"issue":"4","key":"3_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1125-y","volume":"41","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors. Algorithmica\u00a041(4), 245\u2013267 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR23","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 Journal on Discrete Mathematics\u00a020(2), 357\u2013371 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/jctb.1998.1862","volume":"75","author":"R. Diestel","year":"1999","unstructured":"Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem. Journal of Combinatorial Theory, Series B\u00a075(1), 61\u201373 (1999)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/jgt.3190170314","volume":"17","author":"D. Eppstein","year":"1993","unstructured":"Eppstein, D.: Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory\u00a017(3), 409\u2013416 (1993)","journal-title":"Journal of Graph Theory"},{"issue":"3-4","key":"3_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica\u00a027(3-4), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"issue":"3","key":"3_CR28","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":"3_CR29","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013177 (2003)"},{"issue":"2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.jcss.2005.02.003","volume":"71","author":"G. Gutin","year":"2005","unstructured":"Gutin, G., Kloks, T., Lee, C.M., Yao, A.: Kernels in planar digraphs. Journal of Computer and System Sciences\u00a071(2), 174\u2013184 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proceedings of the London Mathematical Society. Third Series, vol.\u00a02, pp. 326\u2013336 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"D.S. Johnson","year":"1987","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide (column\u00a019). Journal of Algorithms\u00a08(3), 438\u2013448 (1987)","journal-title":"Journal of Algorithms"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-45687-2_33","volume-title":"Mathematical Foundations of Computer Science 2002","author":"I. Kanj","year":"2002","unstructured":"Kanj, I., Perkovi\u0107, L.: Improved parameterized algorithms for planar dominating set. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 399\u2013410. Springer, Heidelberg (2002)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Kloks","year":"2002","unstructured":"Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-face cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 282\u2013295. Springer, Heidelberg (2002)"},{"key":"3_CR35","unstructured":"Lapoire, D.: Treewidth and duality in planar hypergraphs, \n \n http:\/\/www.labri.fr\/Perso\/~lapoire\/papers\/dual_planar_treewidth.ps"},{"issue":"2","key":"3_CR36","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1006\/jctb.1993.1019","volume":"57","author":"B. Oporowski","year":"1993","unstructured":"Oporowski, B., Oxley, J., Thomas, R.: Typical subgraphs of 3- and 4-connected graphs. J. Combin. Theory Ser. B\u00a057(2), 239\u2013257 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR37","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. Journal of Combinatorial Theory, Series B\u00a041, 92\u2013114 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1006\/jctb.1995.1034","volume":"64","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XII. Distance on a surface. Journal of Combinatorial Theory, Series B\u00a064(2), 240\u2013272 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"3_CR39","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(2), 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR40","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Non-planar extensions of planar graphs (2001) (preprint), \n \n http:\/\/www.math.gatech.edu\/~thomas\/ext.ps"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.: Excluding a graph with one crossing. In: Graph structure theory (Seattle, 1991), pp. 669\u2013675. Amer. Math. Soc., Providence (1993)","DOI":"10.1090\/conm\/147\/01206"},{"key":"3_CR42","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. Journal of Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"2","key":"3_CR43","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. Journal of Combinatorial Theory, Series B\u00a062(2), 323\u2013348 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"3_CR44","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"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Map graphs in polynomial time. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 396\u2013407 (1998)","DOI":"10.1109\/SFCS.1998.743490"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:51Z","timestamp":1619509791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/11940128_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}