{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T22:44:35Z","timestamp":1780785875178,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806784","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"687-694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["A shorter proof of the graph minor algorithm"],"prefix":"10.1145","author":[{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"first","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Wollan","sequence":"additional","affiliation":[{"name":"University of Rome, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90031-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.46"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.14"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07)","author":"Demaine E. D.","year":"2007","unstructured":"E. D. Demaine , M. Hajiaghayi , and B. Mohar , Approximation algorithms via contraction decomposition , Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07) ,278--287, ( 2007 ). E. D. Demaine, M. Hajiaghayi, and B. Mohar,Approximation algorithms via contraction decomposition, Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07),278--287, (2007)."},{"key":"e_1_3_2_1_7_1","volume-title":"R. Diestel,Graph Theory","year":"2005","unstructured":"R. Diestel,Graph Theory , 3 rd Edition, Springer , 2005 . R. Diestel,Graph Theory, 3rd Edition, Springer, 2005.","edition":"3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496784"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44491"},{"key":"e_1_3_2_1_11_1","first-page":"100","volume":"49","author":"Frank A.","year":"1990","unstructured":"A. Frank , Packing paths, cuts and circuits -- a survey,in Paths, Flows and VLSI- Layout , B. Korte , L. Lov\u00e1sz , H. J. Promel and A. Schrijver ( Eds .),Springer-Verlag , Berlin , 1990 , 49 -- 100 . A. Frank,Packing paths, cuts and circuits -- a survey,in Paths, Flows and VLSI-Layout,B. Korte, L. Lov\u00e1sz, H. J. Promel and A. Schrijver (Eds.),Springer-Verlag, Berlin, 1990, 49--100.","journal-title":"Berlin"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0037-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.45"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250848"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374443"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.53"},{"key":"e_1_3_2_1_18_1","unstructured":"K. Kawarabayashi Y. Kobayashi and B. Reed The disjoint paths problem in quaratic time submitted.  K. Kawarabayashi Y. Kobayashi and B. Reed The disjoint paths problem in quaratic time submitted."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873630"},{"key":"e_1_3_2_1_20_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms(SODA), 1146--1155","author":"Kobayashi Y.","year":"2009","unstructured":"Y. Kobayashi and K. Kawarabayashi , Algorithms for finding an induced cycle in planar graphs and boundedgenus graphs , ACM-SIAM Symposium on Discrete Algorithms(SODA), 1146--1155 , ( 2009 ). Y. Kobayashi and K. Kawarabayashi,Algorithms for finding an induced cycle in planar graphs and boundedgenus graphs, ACM-SIAM Symposium on Discrete Algorithms(SODA), 1146--1155, (2009)."},{"key":"e_1_3_2_1_21_1","first-page":"1208","volume-title":"Proc. Fifith Hungarian Combin. Colloq.,Keszthely, 1976","author":"Lov\u00e1sz L.","year":"1978","unstructured":"L. Lov\u00e1sz ,in Combinatorics , Proc. Fifith Hungarian Combin. Colloq.,Keszthely, 1976 , Vol. II , p. 1208 , North-Holland, Amsterdam , 1978 . L. Lov\u00e1sz,in Combinatorics, Proc. Fifith Hungarian Combin. Colloq.,Keszthely, 1976, Vol. II, p.1208, North-Holland, Amsterdam, 1978."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061425.1061430"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777139.1777167"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1978.11994670"},{"key":"e_1_3_2_1_25_1","volume-title":"a new connectivity measure and some applications, in \"Surveys in Combinatorics","author":"Reed B.","year":"1997","unstructured":"B. Reed , Tree width and tangles : a new connectivity measure and some applications, in \"Surveys in Combinatorics , 1997 (London)\",London Math. Soc. Lecture Note Ser. 241, Cambridge Univ.Press , Cambridge, 87--162, (1997). B. Reed,Tree width and tangles: a new connectivity measure and some applications, in \"Surveys in Combinatorics, 1997 (London)\",London Math. Soc. Lecture Note Ser. 241, Cambridge Univ.Press, Cambridge, 87--162, (1997)."},{"key":"e_1_3_2_1_26_1","volume-title":"Amer. Math. Soc.","author":"Reed B.","year":"1993","unstructured":"B. Reed , N. Robertson , A. Schrijver and P. D. Seymour , Finding disjoint trees in planar graphs in linear time,Contemp. Math., 147 , Amer. Math. Soc. , Providence, RI , 1993 , 295--301. B. Reed, N. Robertson, A. Schrijver and P. D. Seymour,Finding disjoint trees in planar graphs in linear time,Contemp. Math., 147, Amer. Math. Soc., Providence, RI, 1993, 295--301."},{"key":"e_1_3_2_1_27_1","volume-title":"Paths, Flows, and VLSI-Layout","author":"Robertson N.","year":"1990","unstructured":"N. Robertson and P. D. Seymour , An outline of a disjoint paths algorithm , in Paths, Flows, and VLSI-Layout ,B. Korte, L. Lov\u00e1sz, H. J. Pr\u00f6mel, and A. Schrijver (Eds.),Springer-Verlag, Berlin , 1990 , 267--292. N. Robertson and P. D. Seymour,An outline of a disjoint paths algorithm, in Paths, Flows, and VLSI-Layout,B. Korte, L. Lov\u00e1sz, H. J. Pr\u00f6mel, and A. Schrijver (Eds.),Springer-Verlag, Berlin, 1990, 267--292."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90031-6"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90070-6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90063-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0059"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.08.003"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.12.007"},{"key":"e_1_3_2_1_36_1","volume-title":"Schrijver,Combinatorial Optimization: Polyhedra and Efficiency, number 24 inAlgorithm and Combinatorics","author":"A.","year":"2003","unstructured":"A. Schrijver,Combinatorial Optimization: Polyhedra and Efficiency, number 24 inAlgorithm and Combinatorics , Springer Verlag , 2003 . A. Schrijver,Combinatorial Optimization: Polyhedra and Efficiency, number 24 inAlgorithm and Combinatorics, Springer Verlag, 2003."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806784"}},"subtitle":["the unique linkage theorem"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":36,"alternative-id":["10.1145\/1806689.1806784","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806784","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}