{"id":"https://openalex.org/W2052227003","doi":"https://doi.org/10.1145/1944857.1944860","title":"A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems","display_name":"A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2052227003","doi":"https://doi.org/10.1145/1944857.1944860","mag":"2052227003"},"language":"en","primary_location":{"id":"doi:10.1145/1944857.1944860","doi":"https://doi.org/10.1145/1944857.1944860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1944857.1944860","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"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 Computation Theory","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212","observed_orcids":["https://orcid.org/0000-0002-6148-9212"]},"institutions":[{"id":"https://openalex.org/I29894533","display_name":"Charles Darwin University","ror":"https://ror.org/048zcaj52","country_code":"AU","type":"education","lineage":["https://openalex.org/I29894533"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Charles Darwin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles Darwin University","institution_ids":["https://openalex.org/I29894533"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104688098","display_name":"Jiong Guo","orcid":"https://orcid.org/0000-0003-2137-205X","observed_orcids":["https://orcid.org/0000-0003-2137-205X"]},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jiong Guo","raw_affiliation_strings":["Universit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040313005","display_name":"Hannes Moser","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hannes Moser","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236","observed_orcids":["https://orcid.org/0000-0003-1703-1236"]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["TU Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9743,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.71203521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"2","issue":"2","first_page":"1","last_page":"23"},"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.0015999999595806003,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterative-compression","display_name":"iterative compression","score":0.8410000205039978},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6439999938011169},{"id":"https://openalex.org/keywords/polynomial-time-solvability","display_name":"polynomial-time solvability","score":0.8140000104904175},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.8859999775886536},{"id":"https://openalex.org/keywords/minimization-problems","display_name":"minimization problems","score":0.597000002861023},{"id":"https://openalex.org/keywords/dichotomy","display_name":"dichotomy","score":0.4490000009536743},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.6209999918937683}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8574190735816956},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.7417962551116943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6033611297607422},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5945080518722534},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5832114815711975},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5562152862548828},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5489821434020996},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5143214464187622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48994606733322144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4315558671951294},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4148942232131958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38945674896240234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28526580333709717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25492554903030396}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1944857.1944860","doi":"https://doi.org/10.1145/1944857.1944860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1944857.1944860","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"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 Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W38367909","https://openalex.org/W272982077","https://openalex.org/W1485150579","https://openalex.org/W1488421129","https://openalex.org/W1495415187","https://openalex.org/W1503863201","https://openalex.org/W1517036688","https://openalex.org/W1551352271","https://openalex.org/W1586552957","https://openalex.org/W1602543479","https://openalex.org/W1839839470","https://openalex.org/W1964064059","https://openalex.org/W1969357318","https://openalex.org/W1971393213","https://openalex.org/W1979312598","https://openalex.org/W1988897846","https://openalex.org/W2004181701","https://openalex.org/W2011039300","https://openalex.org/W2016590962","https://openalex.org/W2051856222","https://openalex.org/W2061881283","https://openalex.org/W2066230947","https://openalex.org/W2106371135","https://openalex.org/W2134628243","https://openalex.org/W2144050783","https://openalex.org/W2148989696","https://openalex.org/W2157295389","https://openalex.org/W2169359757","https://openalex.org/W3101793140","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1987000624","https://openalex.org/W1564033224","https://openalex.org/W2964176371","https://openalex.org/W7099481383","https://openalex.org/W2935502686","https://openalex.org/W2900649734","https://openalex.org/W2134628243","https://openalex.org/W7220798789","https://openalex.org/W3101793140","https://openalex.org/W2394653516"],"abstract_inverted_index":{"We":[0,79],"investigate":[1],"the":[2,13,40,44,101,116,128],"computational":[3,41],"complexity":[4,42,68],"of":[5,17,43,69,84,108],"a":[6,63,76,81,94],"general":[7],"\u201ccompression":[8],"task\u201d":[9],"centrally":[10],"occurring":[11],"in":[12,60],"recently":[14],"developed":[15],"technique":[16],"iterative":[18,35],"compression":[19,117,129],"for":[20,52],"exactly":[21],"solving":[22],"NP-hard":[23],"minimization":[24],"problems.":[25],"The":[26,67,105],"core":[27],"issue":[28],"(particularly":[29],"but":[30],"not":[31],"only":[32],"motivated":[33],"by":[34],"compression)":[36],"is":[37,72,119,131],"to":[38],"determine":[39],"following":[45],"task:":[46],"given":[47],"an":[48,53],"already":[49],"inclusion-minimal":[50],"solution":[51],"underlying":[54],"(typically":[55],"NP-hard)":[56],"vertex":[57,85,109],"deletion":[58,86,110],"problem":[59],"graphs,":[61],"find":[62],"smaller":[64],"disjoint":[65],"solution.":[66],"this":[70],"task":[71,118,130],"so":[73],"far":[74],"lacking":[75],"systematic":[77],"study.":[78],"consider":[80],"large":[82],"class":[83,107],"problems":[87,111],"on":[88],"undirected":[89],"graphs":[90],"and":[91,100,122],"show":[92],"that":[93],"few":[95],"cases":[96],"are":[97,103],"polynomial-time":[98],"solvable,":[99],"others":[102],"NP-hard.":[104],"considered":[106],"includes":[112],"Vertex":[113,125],"Cover":[114],"(where":[115,127],"polynomial":[120],"time)":[121],"Undirected":[123],"Feedback":[124],"Set":[126],"NP-complete).":[132]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}