{"id":"https://openalex.org/W4416966110","doi":"https://doi.org/10.1145/3798129.3800727","title":"Separator Theorem for Minor-Free Graphs in Linear Time","display_name":"Separator Theorem for Minor-Free Graphs in Linear Time","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416966110","doi":"https://doi.org/10.1145/3798129.3800727"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800727","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800727","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800727","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083806838","display_name":"\u00c9douard Bonnet","orcid":"https://orcid.org/0000-0002-1653-5822"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"\u00c9douard Bonnet","raw_affiliation_strings":["CNRS, ENS de Lyon, Universit\u00e9 Claude Bernard Lyon 1, Lyon, France"],"raw_orcid":"https://orcid.org/0000-0002-1653-5822","affiliations":[{"raw_affiliation_string":"CNRS, ENS de Lyon, Universit\u00e9 Claude Bernard Lyon 1, Lyon, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-0861-6515","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101657472","display_name":"L\u00ea Th\u00e1i H\u00f9ng","orcid":"https://orcid.org/0000-0001-6846-9073"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hung Le","raw_affiliation_strings":["University of Massachusetts at Amherst, Amherst, USA"],"raw_orcid":"https://orcid.org/0000-0001-8223-9944","affiliations":[{"raw_affiliation_string":"University of Massachusetts at Amherst, Amherst, USA","institution_ids":["https://openalex.org/I177605424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026118558","display_name":"Jason Li","orcid":"https://orcid.org/0000-0003-3644-0879"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-3644-0879","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027217082","display_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","orcid":"https://orcid.org/0000-0001-8524-4036"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","raw_affiliation_strings":["University of Warsaw, Institute of Informatics, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-8524-4036","affiliations":[{"raw_affiliation_string":"University of Warsaw, Institute of Informatics, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03081574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4878999888896942,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4878999888896942,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.39340001344680786,"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/T12288","display_name":"Optimization and Search Problems","score":0.04450000077486038,"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/separator","display_name":"Separator (oil production)","score":0.6797000169754028},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5958999991416931},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5307000279426575},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.5001999735832214},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.41690000891685486},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3889000117778778}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6841999888420105},{"id":"https://openalex.org/C185004128","wikidata":"https://www.wikidata.org/wiki/Q3011536","display_name":"Separator (oil production)","level":2,"score":0.6797000169754028},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5958999991416931},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5493000149726868},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5307000279426575},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.5001999735832214},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4900999963283539},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3720000088214874},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2637999951839447},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.2581999897956848}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800727","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800727","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2512.01587","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.01587","pdf_url":"https://arxiv.org/pdf/2512.01587","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.01587","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.01587","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800727","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800727","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2814711789","display_name":null,"funder_award_id":"CCF-2237288","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5367877527","display_name":null,"funder_award_id":"54451","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G5419085267","display_name":null,"funder_award_id":"ANR-21-CE48-0014","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6087696832","display_name":"NSF-BSF: AF: Small: New Frontiers in Distance Sketching","funder_award_id":"2517033","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/G7271835885","display_name":null,"funder_award_id":"2237288","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7595665062","display_name":"Optimal algorithms and data structures for decomposing graphs by small cuts and separators","funder_award_id":"101206430","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G86899522","display_name":null,"funder_award_id":"CCF-2517033","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8726149790","display_name":null,"funder_award_id":"2021/43/D/ST6/03312","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G8932181020","display_name":"Optimal algorithms and data structures for decomposing graphs by small cuts and separators","funder_award_id":"101206430","funder_id":"https://openalex.org/F4320338438","funder_display_name":"HORIZON EUROPE Marie Sklodowska-Curie Actions"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320323873","display_name":"Uniwersytet Warszawski","ror":"https://ror.org/039bjqg32"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"},{"id":"https://openalex.org/F4320337079","display_name":"Basic Algorithms Research Copenhagen, University of Copenhagen","ror":null},{"id":"https://openalex.org/F4320338337","display_name":"H2020 Marie Sk\u0142odowska-Curie Actions","ror":null},{"id":"https://openalex.org/F4320338438","display_name":"HORIZON EUROPE Marie Sklodowska-Curie Actions","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,96],"planar":[1,19,54,113],"separator":[2,27,85,102,128,149,224],"theorem":[3,62,103],"by":[4],"Lipton":[5],"and":[6,68,225],"Tarjan":[7],"[FOCS":[8],"'77,":[9],"SIAM":[10],"Journal":[11,72],"on":[12,46,53,191,203],"Applied":[13],"Mathematics":[14],"'79]":[15],"states":[16],"that":[17,31,78,89,234],"any":[18,79],"graph":[20,81],"with":[21],"$n$":[22],"vertices":[23,205],"has":[24],"a":[25,83,105,126,140,148,179,186,200,211,215,222,229],"balanced":[26,84,127,212,223],"of":[28,44,73,86,129,150,182,189,221,228,240],"size":[29,87,130,151,220],"$O(\\sqrt{n})$":[30,88,131,155],"can":[32,90],"be":[33,91,239],"found":[34,92],"in":[35,93,100,132],"linear":[36,48],"time.":[37,95],"This":[38],"landmark":[39],"result":[40],"kicked":[41],"off":[42],"decades":[43],"research":[45,119],"designing":[47],"or":[49,156,161],"nearly":[50],"linear-time":[51],"algorithms":[52,145],"graphs.":[55,116],"In":[56,163],"an":[57],"attempt":[58],"to":[59,63,114,206],"generalize":[60],"Lipton-Tarjan's":[61],"nonplanar":[64],"graphs,":[65],"Alon,":[66],"Seymour,":[67],"Thomas":[69],"[STOC":[70],"'90,":[71],"the":[74,168,192,204,208,219,226],"AMS":[75],"'90]":[76],"showed":[77],"minor-free":[80,115,137],"admits":[82],"$O(n^{3/2})$":[94],"superlinear":[97,158],"running":[98,159],"time":[99,135],"their":[101],"is":[104,174,199],"key":[106,196],"bottleneck":[107],"for":[108,120,136,210],"generalizing":[109],"algorithmic":[110],"results":[111],"from":[112],"Despite":[117],"extensive":[118],"more":[121],"than":[122,154],"two":[123],"decades,":[124],"finding":[125],"(linear)":[133],"$O(n)$":[134],"graphs":[138],"remains":[139],"major":[141],"open":[142,169],"problem.":[143],"Known":[144],"either":[146],"give":[147],"much":[152],"larger":[153],"have":[157],"time,":[160],"both.":[162],"this":[164],"paper,":[165],"we":[166],"answer":[167],"problem":[170],"affirmatively.":[171],"Our":[172,195],"algorithm":[173],"very":[175],"simple:":[176],"it":[177],"runs":[178],"vertex-weighted":[180],"variant":[181],"breadth-first":[183],"search":[184,209],"(BFS)":[185],"constant":[187],"number":[188],"times":[190],"input":[193],"graph.":[194],"technical":[197],"contribution":[198],"weighting":[201,236],"scheme":[202,237],"guide":[207],"separator,":[213],"offering":[214],"new":[216],"connection":[217],"between":[218],"existence":[227],"clique-minor":[230],"model.":[231],"We":[232],"believe":[233],"our":[235],"may":[238],"independent":[241],"interest.":[242]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-03T00:00:00"}