{"id":"https://openalex.org/W3138202270","doi":"https://doi.org/10.1145/3406325.3451068","title":"Vertex deletion parameterized by elimination distance and even less","display_name":"Vertex deletion parameterized by elimination distance and even less","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3138202270","doi":"https://doi.org/10.1145/3406325.3451068","mag":"3138202270"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451068","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451068","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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, Netherlands","Eindhoven University of Technology"],"raw_orcid":"https://orcid.org/0000-0001-8204-1268","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016857499","display_name":"Jari J. H. de Kroon","orcid":"https://orcid.org/0000-0003-3328-9712"},"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":"Jari J. H. de Kroon","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands","Eindhoven University of Technology"],"raw_orcid":"https://orcid.org/0000-0003-3328-9712","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139616","display_name":"Micha\u0142 W\u0142odarczyk","orcid":"https://orcid.org/0000-0003-0968-8414"},"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":"Micha\u0142 W\u0142odarczyk","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands","Eindhoven University of Technology"],"raw_orcid":"https://orcid.org/0000-0003-0968-8414","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0526106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1757","last_page":"1769"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9776999950408936,"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.9380999803543091,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8057775497436523},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.760169506072998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7488553524017334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7130619883537292},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6858672499656677},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5840332508087158},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5148479342460632},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5011563301086426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4642190933227539},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.44568949937820435},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.42687004804611206},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4225130081176758},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33310800790786743},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2922302782535553},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08083280920982361}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8057775497436523},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.760169506072998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7488553524017334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7130619883537292},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6858672499656677},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5840332508087158},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5148479342460632},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5011563301086426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4642190933227539},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.44568949937820435},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.42687004804611206},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4225130081176758},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33310800790786743},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2922302782535553},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08083280920982361}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3406325.3451068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451068","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2103.09715","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.09715","pdf_url":"https://arxiv.org/pdf/2103.09715","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:openaire/9574f286-48f1-4b9b-8560-c77c01fb60b1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9574f286-48f1-4b9b-8560-c77c01fb60b1","pdf_url":"https://pure.tue.nl/ws/files/374060954/3406325.3451068.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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jansen, B M P, Kroon, J J H D & Wlodarczyk, M 2021, Vertex deletion parameterized by elimination distance and even less. in S Khuller & V V Williams (eds), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., pp. 1757-1769, 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, Virtual, Online, Italy, 21/06/21. https://doi.org/10.1145/3406325.3451068","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:3138202270","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2103.09715","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2103.09715","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2103.09715","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451068","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3138202270.pdf","grobid_xml":"https://content.openalex.org/works/W3138202270.grobid-xml"},"referenced_works_count":97,"referenced_works":["https://openalex.org/W150157909","https://openalex.org/W591589697","https://openalex.org/W749457272","https://openalex.org/W1493923326","https://openalex.org/W1495415187","https://openalex.org/W1511638527","https://openalex.org/W1517036688","https://openalex.org/W1532282263","https://openalex.org/W1532942816","https://openalex.org/W1548225002","https://openalex.org/W1579049696","https://openalex.org/W1589594187","https://openalex.org/W1777447092","https://openalex.org/W1857705078","https://openalex.org/W1963707128","https://openalex.org/W1964064059","https://openalex.org/W1965012931","https://openalex.org/W1973199140","https://openalex.org/W1973347908","https://openalex.org/W1975719754","https://openalex.org/W1978452004","https://openalex.org/W1991223992","https://openalex.org/W2003744153","https://openalex.org/W2004181701","https://openalex.org/W2005079828","https://openalex.org/W2012329067","https://openalex.org/W2016590962","https://openalex.org/W2021180976","https://openalex.org/W2029448190","https://openalex.org/W2040404604","https://openalex.org/W2051856222","https://openalex.org/W2052210031","https://openalex.org/W2053991811","https://openalex.org/W2054901865","https://openalex.org/W2057826895","https://openalex.org/W2059372025","https://openalex.org/W2063951771","https://openalex.org/W2076164610","https://openalex.org/W2087083200","https://openalex.org/W2099035480","https://openalex.org/W2099200602","https://openalex.org/W2102664288","https://openalex.org/W2116087731","https://openalex.org/W2121641644","https://openalex.org/W2137012936","https://openalex.org/W2141235933","https://openalex.org/W2142161693","https://openalex.org/W2154682992","https://openalex.org/W2163101585","https://openalex.org/W2164727303","https://openalex.org/W2168568667","https://openalex.org/W2180988813","https://openalex.org/W2258298398","https://openalex.org/W2296118781","https://openalex.org/W2313886575","https://openalex.org/W2332112754","https://openalex.org/W2398655357","https://openalex.org/W2471129545","https://openalex.org/W2591652165","https://openalex.org/W2600918792","https://openalex.org/W2743104256","https://openalex.org/W2771139435","https://openalex.org/W2783306705","https://openalex.org/W2789598654","https://openalex.org/W2793394636","https://openalex.org/W2797804389","https://openalex.org/W2800485060","https://openalex.org/W2809938360","https://openalex.org/W2913867289","https://openalex.org/W2914414140","https://openalex.org/W2943672262","https://openalex.org/W2952150057","https://openalex.org/W2962772870","https://openalex.org/W2963554461","https://openalex.org/W2963805305","https://openalex.org/W2964099322","https://openalex.org/W2968783941","https://openalex.org/W2970851838","https://openalex.org/W2977984462","https://openalex.org/W3001577222","https://openalex.org/W3002240277","https://openalex.org/W3002754118","https://openalex.org/W3014089325","https://openalex.org/W3034552259","https://openalex.org/W3035318934","https://openalex.org/W3037133113","https://openalex.org/W3039254663","https://openalex.org/W3040346023","https://openalex.org/W3045943679","https://openalex.org/W3065763739","https://openalex.org/W3082759585","https://openalex.org/W3139078859","https://openalex.org/W3139366516","https://openalex.org/W3163491381","https://openalex.org/W4213262063","https://openalex.org/W4238913085","https://openalex.org/W7139033639"],"related_works":["https://openalex.org/W1997576329","https://openalex.org/W835052590","https://openalex.org/W3000559115","https://openalex.org/W2994931140","https://openalex.org/W2500167267","https://openalex.org/W2269174106","https://openalex.org/W1848295871","https://openalex.org/W2069561762","https://openalex.org/W2974470551","https://openalex.org/W3091135013","https://openalex.org/W2962735094","https://openalex.org/W2053467581","https://openalex.org/W1501191738","https://openalex.org/W2963354889","https://openalex.org/W1664024785","https://openalex.org/W2949594281","https://openalex.org/W1486446192","https://openalex.org/W2021773268","https://openalex.org/W2102532003","https://openalex.org/W2942082090"],"abstract_inverted_index":{"We":[0,68],"study":[1],"the":[2,33,88,92],"parameterized":[3],"complexity":[4],"of":[5,40,72],"various":[6],"classic":[7],"vertex-deletion":[8],"problems":[9,29],"such":[10],"as":[11],"Odd":[12],"cycle":[13],"transversal,":[14],"Vertex":[15],"planarization,":[16],"and":[17,91],"Chordal":[18],"vertex":[19],"deletion":[20],"under":[21],"hybrid":[22],"parameterizations.":[23],"Existing":[24],"FPT":[25,76],"algorithms":[26,77],"for":[27,61,78],"these":[28,70],"either":[30],"focus":[31],"on":[32],"parameterization":[34],"by":[35,74],"solution":[36,89],"size,":[37],"detecting":[38],"solutions":[39,55],"size":[41,90],"k":[42],"in":[43,56],"time":[44,57],"f(k)":[45],"\u00b7":[46,59],"nO(1),":[47],"or":[48],"width":[49,63],"parameterizations,":[50],"finding":[51],"arbitrarily":[52,84],"large":[53],"optimal":[54],"f(w)":[58],"nO(1)":[60],"some":[62],"measure":[64],"w":[65],"like":[66],"treewidth.":[67,93],"unify":[69],"lines":[71],"research":[73],"presenting":[75],"parameterizations":[79],"that":[80],"can":[81],"simultaneously":[82],"be":[83],"much":[85],"smaller":[86],"than":[87]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}