{"id":"https://openalex.org/W2563767922","doi":"https://doi.org/10.1145/2820609","title":"Polynomial Bounds for the Grid-Minor Theorem","display_name":"Polynomial Bounds for the Grid-Minor Theorem","publication_year":2016,"publication_date":"2016-12-17","ids":{"openalex":"https://openalex.org/W2563767922","doi":"https://doi.org/10.1145/2820609","mag":"2563767922"},"language":"en","primary_location":{"id":"doi:10.1145/2820609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2820609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2820609&type=pdf","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2820609&type=pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, Urbana, IL"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago IL"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago IL","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":19.4071,"has_fulltext":true,"cited_by_count":98,"citation_normalized_percentile":{"value":0.99401654,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"63","issue":"5","first_page":"1","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9135305881500244},{"id":"https://openalex.org/keywords/graph-minor","display_name":"Graph minor","score":0.8028813004493713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.801145613193512},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.7950637340545654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.679282546043396},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6236911416053772},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.6188063025474548},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5581595301628113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5040218234062195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45603644847869873},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4528917670249939},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4402669072151184},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43253687024116516},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4268415868282318},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.25242850184440613},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22429129481315613},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13533034920692444},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07861915230751038}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9135305881500244},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.8028813004493713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.801145613193512},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.7950637340545654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.679282546043396},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6236911416053772},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.6188063025474548},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5581595301628113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5040218234062195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45603644847869873},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4528917670249939},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4402669072151184},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43253687024116516},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4268415868282318},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25242850184440613},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22429129481315613},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13533034920692444},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07861915230751038},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2820609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2820609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2820609&type=pdf","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2820609","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2820609","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2820609&type=pdf","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1405963881","display_name":null,"funder_award_id":"CCF-1016684, CCF-1319376, CCF-0844872, CCF-1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1881622834","display_name":null,"funder_award_id":"CCF-1016684","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5758289877","display_name":"AF:  Small:  Flows, Cuts, Treewidth and Algorithms for Routing, Network Design and Related Problems","funder_award_id":"1319376","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7257584671","display_name":"CAREER: Approximation Algorithms and Hardness of Network Optimization Problems","funder_award_id":"0844872","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7696245841","display_name":null,"funder_award_id":"CCF-1319376","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8010271620","display_name":null,"funder_award_id":"CCF-0844872","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8334011178","display_name":null,"funder_award_id":"CCF-1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8558341523","display_name":"AF: Small: Algorithms for Graph Routing, Drawing and Partitioning","funder_award_id":"1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2563767922.pdf","grobid_xml":"https://content.openalex.org/works/W2563767922.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W748479430","https://openalex.org/W1551708885","https://openalex.org/W1577694003","https://openalex.org/W1751846631","https://openalex.org/W1786780942","https://openalex.org/W1976463682","https://openalex.org/W1978207220","https://openalex.org/W1979444789","https://openalex.org/W1984361668","https://openalex.org/W1989274820","https://openalex.org/W1999867351","https://openalex.org/W2004163233","https://openalex.org/W2009946412","https://openalex.org/W2011334641","https://openalex.org/W2012927698","https://openalex.org/W2019041817","https://openalex.org/W2033480692","https://openalex.org/W2047871605","https://openalex.org/W2057826895","https://openalex.org/W2064656298","https://openalex.org/W2078013954","https://openalex.org/W2085348754","https://openalex.org/W2088844265","https://openalex.org/W2100346402","https://openalex.org/W2145818650","https://openalex.org/W2157950582","https://openalex.org/W2158584754","https://openalex.org/W2164281048","https://openalex.org/W2165303918","https://openalex.org/W2170380135","https://openalex.org/W2515641369","https://openalex.org/W2988480584","https://openalex.org/W3121437753","https://openalex.org/W4210556995"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W1836127928","https://openalex.org/W1490290385","https://openalex.org/W83147424","https://openalex.org/W2275773863","https://openalex.org/W2968633427","https://openalex.org/W2152982698","https://openalex.org/W4385772980","https://openalex.org/W2563767922","https://openalex.org/W4285473334"],"abstract_inverted_index":{"One":[0],"of":[1,77,84,105,204],"the":[2,15,20,70,126,149],"key":[3],"results":[4],"in":[5,59,188,209],"Robertson":[6],"and":[7,62,107,109,111,155,178,194],"Seymour\u2019s":[8],"seminal":[9],"work":[10,104],"on":[11],"graph":[12,35,60,76],"minors":[13],"is":[14,38,186],"grid-minor":[16],"theorem":[17,23,26,54],"(also":[18],"called":[19],"excluded":[21],"grid":[22,31,82,156,207],").":[24,123,143],"The":[25,96],"states":[27],"that":[28,74,114,132,161,197],"for":[29,171],"every":[30,34,75],"H":[32,46,49],",":[33,196],"whose":[36,183],"treewidth":[37,78,154],"large":[39],"enough":[40],"relative":[41],"to":[42,102],"|":[43,189],"V":[44,190],"(":[45,66,86,88,93,116,134,163,191],")|":[47,193],"contains":[48,80],"as":[50],"a":[51,81,180,202,206],"minor.":[52],"This":[53],"has":[55],"found":[56],"many":[57],"applications":[58],"theory":[61],"algorithms.":[63],"Let":[64],"f":[65,87,92,115,133,162],"k":[67,79,89,94,117,119,122,135,140,142,164,168,195],")":[68,90,136,165,170],"denote":[69],"largest":[71],"value":[72],"such":[73,205],"minor":[83,157,208],"size":[85,158],"\u00d7":[91],")).":[95],"best":[97,127],"previous":[98],"quantitative":[99],"bound,":[100],"due":[101],"recent":[103],"Kawarabayashi":[106],"Kobayashi,":[108],"Leaf":[110],"Seymour,":[112],"shows":[113],")=\u03a9(\u221alog":[118],"/log":[120,141],"log":[121],"In":[124,144],"contrast,":[125],"known":[128],"upper":[129],"bound":[130],"implies":[131],"=":[137,166],"O":[138],"(\u221a":[139],"this":[145],"article,":[146],"we":[147],"obtain":[148],"first":[150],"polynomial":[151,187],"relationship":[152],"between":[153],"by":[159],"showing":[160],"\u03a9(":[167],"\u03b4":[169,175],"some":[172],"fixed":[173],"constant":[174],">":[176],"0,":[177],"describe":[179],"randomized":[181],"algorithm,":[182],"running":[184],"time":[185],"G":[192,210],"with":[198],"high":[199],"probability":[200],"finds":[201],"model":[203],".":[211]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":38},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}