{"id":"https://openalex.org/W4319925028","doi":"https://doi.org/10.1145/3583688","title":"Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable","display_name":"Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable","publication_year":2023,"publication_date":"2023-02-10","ids":{"openalex":"https://openalex.org/W4319925028","doi":"https://doi.org/10.1145/3583688"},"language":"en","primary_location":{"id":"doi:10.1145/3583688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583688","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583688","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","Department of Informatics, University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070659804","display_name":"Giannos Stamoulis","orcid":"https://orcid.org/0000-0002-4175-7793"},"institutions":[{"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"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giannos Stamoulis","raw_affiliation_strings":["LIRMM, Univ Montpellier, CNRS, Montpellier, France","LIRMM, Univ Montpellier, CNRS, France"],"raw_orcid":"https://orcid.org/0000-0002-4175-7793","affiliations":[{"raw_affiliation_string":"LIRMM, Univ Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]},{"raw_affiliation_string":"LIRMM, Univ Montpellier, CNRS, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":"https://orcid.org/0000-0003-0470-1800"},"institutions":[{"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"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["LIRMM, Univ Montpellier, CNRS, Montpellier, France","LIRMM, Univ Montpellier, CNRS, France"],"raw_orcid":"https://orcid.org/0000-0003-0470-1800","affiliations":[{"raw_affiliation_string":"LIRMM, Univ Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]},{"raw_affiliation_string":"LIRMM, Univ Montpellier, CNRS, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"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.01875117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"3","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6470999717712402,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6470999717712402,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.22779999673366547,"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.05909999832510948,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7525514364242554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6718285083770752},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5460150837898254},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.5369377732276917},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5291804671287537},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.482399582862854},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4794863164424896},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4733286499977112},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4570304751396179},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.45309099555015564},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4405096769332886},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3987077474594116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19336935877799988},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07519188523292542}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7525514364242554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6718285083770752},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5460150837898254},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.5369377732276917},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5291804671287537},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.482399582862854},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4794863164424896},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4733286499977112},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4570304751396179},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.45309099555015564},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4405096769332886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3987077474594116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19336935877799988},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07519188523292542},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3583688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583688","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04265667v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04265667","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 2023, 19 (3), pp.1-29. ⟨10.1145/3583688⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3583688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583688","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1302621641","display_name":"Unifying Theories for Multivariate Algorithms","funder_award_id":"ANR-20-CE92-0027","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G1535968106","display_name":"Efficiency and Structure in Graph Mining Applications","funder_award_id":"ANR-17-CE23-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5140280351","display_name":"Decomposition of Graphical Models","funder_award_id":"ANR-16-CE40-0028","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5399623649","display_name":null,"funder_award_id":"314528","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G5420063140","display_name":null,"funder_award_id":"ANR-16","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4319925028.pdf","grobid_xml":"https://content.openalex.org/works/W4319925028.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W891461","https://openalex.org/W1495415187","https://openalex.org/W1507614398","https://openalex.org/W1561738351","https://openalex.org/W1567455550","https://openalex.org/W1838629830","https://openalex.org/W1964064059","https://openalex.org/W1965012931","https://openalex.org/W1976463682","https://openalex.org/W1983860528","https://openalex.org/W1989055377","https://openalex.org/W1991755800","https://openalex.org/W2004181701","https://openalex.org/W2005079828","https://openalex.org/W2013967419","https://openalex.org/W2017434030","https://openalex.org/W2020972784","https://openalex.org/W2024931493","https://openalex.org/W2025861110","https://openalex.org/W2032762881","https://openalex.org/W2033843939","https://openalex.org/W2050352628","https://openalex.org/W2054926952","https://openalex.org/W2064796716","https://openalex.org/W2067016370","https://openalex.org/W2097289283","https://openalex.org/W2105722028","https://openalex.org/W2109920117","https://openalex.org/W2142494205","https://openalex.org/W2144050783","https://openalex.org/W2147929948","https://openalex.org/W2158584754","https://openalex.org/W2184583947","https://openalex.org/W2313886575","https://openalex.org/W2394608588","https://openalex.org/W2563156040","https://openalex.org/W2569270235","https://openalex.org/W2591818589","https://openalex.org/W2914414140","https://openalex.org/W2954344045","https://openalex.org/W2963908100","https://openalex.org/W3035318934","https://openalex.org/W3045943679","https://openalex.org/W3116379639","https://openalex.org/W3134554124","https://openalex.org/W4213262063"],"related_works":["https://openalex.org/W603403972","https://openalex.org/W2061237693","https://openalex.org/W1554245510","https://openalex.org/W2152638828","https://openalex.org/W4285762950","https://openalex.org/W3121955789","https://openalex.org/W1578113210","https://openalex.org/W2239518402","https://openalex.org/W2083238533","https://openalex.org/W2579368376"],"abstract_inverted_index":{"For":[0],"a":[1,28,52,76],"finite":[2],"collection":[3],"of":[4,46],"graphs":[5,48,103],"\u2131,":[6,61],"the":[7,47],"\u2131-":[8],"TM-Deletion":[9,64],"problem":[10],"has":[11],"as":[12,51],"input":[13],"an":[14,20],"n":[15,82,93],"-vertex":[16],"graph":[17],"G":[18,39],"and":[19,23],"integer":[21],"k":[22,36,79,90],"asks":[24],"whether":[25],"there":[26],"exists":[27],"set":[29],"S":[30,41],"\u2286":[31],"V(G)":[32],"with":[33],"|S|":[34],"\u2264":[35],"such":[37,60],"that":[38,57,104],"\\":[40],"does":[42],"not":[43],"contain":[44],"any":[45,108],"in":[49,75,87],"\u2131":[50,62],"topological":[53],"minor.":[54],"We":[55],"prove":[56],"for":[58],"every":[59],"-":[63],"is":[65],"fixed":[66,109],"parameter":[67],"tractable":[68],"on":[69,107],"planar":[70],"graphs.":[71],"Our":[72,96],"algorithm":[73],"runs":[74],"2":[77,83,88],"\ud835\udcaa(":[78,89],"2)":[80],"\u22c5":[81,92],"time,":[84],"or,":[85],"alternatively,":[86],")":[91],"4":[94],"time.":[95],"techniques":[97],"can":[98],"easily":[99],"be":[100],"extended":[101],"to":[102],"are":[105],"embeddable":[106],"surface.":[110]},"counts_by_year":[],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}