{"id":"https://openalex.org/W2140430392","doi":"https://doi.org/10.1145/3029051","title":"Uniform Kernelization Complexity of Hitting Forbidden Minors","display_name":"Uniform Kernelization Complexity of Hitting Forbidden Minors","publication_year":2017,"publication_date":"2017-03-20","ids":{"openalex":"https://openalex.org/W2140430392","doi":"https://doi.org/10.1145/3029051","mag":"2140430392"},"language":"en","primary_location":{"id":"doi:10.1145/3029051","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3029051","pdf_url":null,"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":"green","oa_url":"https://research.tue.nl/files/78339833/704071146209393.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021332621","display_name":"Archontia C. Giannopoulou","orcid":"https://orcid.org/0009-0001-4368-2852"},"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":"Archontia C. Giannopoulou","raw_affiliation_strings":["University of Bergen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, MB Eindhoven, Netherlands","Eindhoven University of Technology, MB, Eindhoven, Netherlands#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-8204-1268","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, MB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, MB, Eindhoven, Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"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":"Daniel Lokshtanov","raw_affiliation_strings":["University of Bergen, Norway","University of Bergen , Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen , Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3379,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.89297987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"35"},"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.9984999895095825,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9101951122283936},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8732082843780518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7950982451438904},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.636195957660675},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5512064099311829},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49920201301574707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41687291860580444}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9101951122283936},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8732082843780518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7950982451438904},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.636195957660675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5512064099311829},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49920201301574707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41687291860580444}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3029051","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3029051","pdf_url":null,"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:pure.tue.nl:openaire_cris_publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","pdf_url":"https://research.tue.nl/files/78339833/704071146209393.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Giannopoulou, A C, Jansen, B M P, Lokshtanov, D & Saurabh, S 2017, 'Uniform kernelization complexity of hitting forbidden minors', ACM Transactions on Algorithms, vol. 13, no. 3, 35, pp. 1-35. https://doi.org/10.1145/3029051","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","pdf_url":"https://research.tue.nl/nl/publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 13(3):35, 1 - 35. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/afa3ccf6-e2f9-4b16-822b-3ffa1f964ca9","pdf_url":"https://research.tue.nl/files/78339833/704071146209393.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Giannopoulou, A C, Jansen, B M P, Lokshtanov, D & Saurabh, S 2017, 'Uniform kernelization complexity of hitting forbidden minors', ACM Transactions on Algorithms, vol. 13, no. 3, 35, pp. 1-35. https://doi.org/10.1145/3029051","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2140430392.pdf","grobid_xml":"https://content.openalex.org/works/W2140430392.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W36639738","https://openalex.org/W78721095","https://openalex.org/W182050876","https://openalex.org/W285041758","https://openalex.org/W1423095052","https://openalex.org/W1517036688","https://openalex.org/W1532942816","https://openalex.org/W1570425181","https://openalex.org/W1606657688","https://openalex.org/W1787689584","https://openalex.org/W1821538950","https://openalex.org/W1838629830","https://openalex.org/W1986916307","https://openalex.org/W1996472240","https://openalex.org/W1998964055","https://openalex.org/W2000311286","https://openalex.org/W2005079828","https://openalex.org/W2033405938","https://openalex.org/W2034437384","https://openalex.org/W2034472295","https://openalex.org/W2040404604","https://openalex.org/W2052210031","https://openalex.org/W2057826895","https://openalex.org/W2070685861","https://openalex.org/W2080609813","https://openalex.org/W2087083200","https://openalex.org/W2107284348","https://openalex.org/W2107285530","https://openalex.org/W2116087731","https://openalex.org/W2119741712","https://openalex.org/W2152982698","https://openalex.org/W2172138179","https://openalex.org/W2241275978","https://openalex.org/W2295651994","https://openalex.org/W2340149117","https://openalex.org/W2531503199","https://openalex.org/W2605868060","https://openalex.org/W2620774572","https://openalex.org/W2900382700","https://openalex.org/W2953158549","https://openalex.org/W2963253390","https://openalex.org/W2988480584","https://openalex.org/W3101261387","https://openalex.org/W3137355438","https://openalex.org/W4389615669","https://openalex.org/W6690484361"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W4301903827"],"abstract_inverted_index":{"The":[0],"F":[1,14,46,62,76,82,98,118,135],"-M":[2,99,136],"inor":[3,100,137],"-F":[4,101,138],"ree":[5,102,139],"D":[6,103,140],"eletion":[7,104,141],"problem":[8,105,169,191],"asks,":[9],"for":[10,84,123,203],"a":[11,20,48,70,180],"fixed":[12,205],"set":[13],"and":[15,23,88],"an":[16],"input":[17],"consisting":[18],"of":[19,45,72,113,170,182],"graph":[21,39,68,181],"G":[22,34],"integer":[24],"k":[25,28,79,121,173,199],",":[26],"whether":[27,94,172],"vertices":[29,174,202],"can":[30,175],"be":[31,176],"removed":[32,177],"from":[33],"such":[35],"that":[36,57,131,189],"the":[37,58,114,158,163,168],"resulting":[38],"does":[40],"not":[41,144,153],"contain":[42],"any":[43],"member":[44],"as":[47],"minor.":[49],"At":[50],"FOCS":[51],"2012,":[52],"Fomin":[53],"et":[54],"al.":[55],"showed":[56],"special":[59],"case":[60],"when":[61,155],"contains":[63],"at":[64,184],"least":[65],"one":[66],"planar":[67],"has":[69,106],"kernel":[71],"size":[73,109],"f":[74,87,116],"(":[75,81,117,198],")":[77,83,119,201],"\u010b":[78,120],"g":[80,89],"some":[85,124,132],"functions":[86],".":[90,128],"They":[91],"left":[92],"open":[93],"this":[95,190],"P":[96,133],"lanar":[97,134],"kernels":[107,148,195],"whose":[108],"is":[110],"uniformly":[111,146,193],"polynomial,":[112],"form":[115],"c":[122,127],"universal":[125],"constant":[126],"We":[129,187],"prove":[130,188],"problems":[142],"do":[143],"have":[145],"polynomial":[147,194],"(unless":[149],"NP":[150],"\u2286":[151],"coNP/poly),":[152],"even":[154],"parameterized":[156],"by":[157],"vertex":[159],"cover":[160],"number.":[161],"On":[162],"positive":[164],"side,":[165],"we":[166],"consider":[167],"determining":[171],"to":[178],"obtain":[179],"treedepth":[183],"most":[185],"\u03b7.":[186,206],"admits":[192],"with":[196],"O":[197],"6":[200],"every":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-10-10T00:00:00"}