{"id":"https://openalex.org/W7138017992","doi":"https://doi.org/10.1609/aaai.v40i17.38435","title":"Exact Algorithms for Distance to Unique Vertex Cover","display_name":"Exact Algorithms for Distance to Unique Vertex Cover","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138017992","doi":"https://doi.org/10.1609/aaai.v40i17.38435"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i17.38435","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38435","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i17.38435","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558873","display_name":"Foivos Fioravantes","orcid":"https://orcid.org/0000-0001-8217-030X"},"institutions":[{"id":"https://openalex.org/I4387154082","display_name":"City of Prague","ror":"https://ror.org/01mtgj902","country_code":null,"type":"government","lineage":["https://openalex.org/I4387154082"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Foivos Fioravantes","raw_affiliation_strings":["Czech Technical University of Prague"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University of Prague","institution_ids":["https://openalex.org/I44504214","https://openalex.org/I4387154082"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I4387154082","display_name":"City of Prague","ror":"https://ror.org/01mtgj902","country_code":null,"type":"government","lineage":["https://openalex.org/I4387154082"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Czech Technical University of Prague"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University of Prague","institution_ids":["https://openalex.org/I44504214","https://openalex.org/I4387154082"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088003340","display_name":"Nikolaos Melissinos","orcid":"https://orcid.org/0000-0002-0864-9803"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Nikolaos Melissinos","raw_affiliation_strings":["Charles University Prague"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University Prague","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129662681","display_name":"Michal Opler","orcid":null},"institutions":[{"id":"https://openalex.org/I4387154082","display_name":"City of Prague","ror":"https://ror.org/01mtgj902","country_code":null,"type":"government","lineage":["https://openalex.org/I4387154082"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michal Opler","raw_affiliation_strings":["Czech Technical University of Prague"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University of Prague","institution_ids":["https://openalex.org/I44504214","https://openalex.org/I4387154082"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037706878","display_name":"Manolis Vasilakis","orcid":"https://orcid.org/0000-0001-6505-2977"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Manolis Vasilakis","raw_affiliation_strings":["Universit\u00e9 Paris Dauphine - PSL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Dauphine - PSL","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16666667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"17","first_page":"14217","last_page":"14224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5396000146865845,"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.5396000146865845,"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.2985999882221222,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.06809999793767929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9332000017166138},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6955000162124634},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6620000004768372},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6270999908447266},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5364999771118164},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4661000072956085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42329999804496765},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.40779998898506165}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9332000017166138},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6955000162124634},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6620000004768372},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6427000164985657},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6270999908447266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6083999872207642},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5364999771118164},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4661000072956085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42329999804496765},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3181000053882599},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i17.38435","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38435","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i17.38435","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38435","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,75],"their":[1,80],"AAAI":[2],"2024":[3],"paper,":[4],"Horiyama":[5,59],"et":[6,60],"al.":[7,61],"studied":[8],"the":[9,35,44,57,65,68,98,109,124,163,191,194,199],"problem":[10,125],"of":[11,34,67,100,111,135,165,193,198],"generating":[12],"graph":[13],"instances":[14],"that":[15,123,155,173],"possess":[16],"a":[17,49,91,101,106,142],"unique":[18,92],"minimum":[19,69,93],"vertex":[20,50,70,94,102],"cover":[21,71],"under":[22],"specific":[23],"conditions.":[24],"Their":[25],"approach":[26],"involved":[27],"pre-assigning":[28,48],"certain":[29],"vertices":[30],"to":[31,53,89,153],"be":[32],"part":[33,197],"solution":[36,195],"or":[37],"excluding":[38],"them":[39],"from":[40,56],"it.":[41],"Notably,":[42],"for":[43,132,146],"Vertex":[45],"Cover":[46],"problem,":[47],"is":[51,88,126,149,157,175,184],"equivalent":[52],"removing":[54],"it":[55,183],"graph.":[58],"focused":[62],"on":[63,108],"maintaining":[64],"size":[66,110,192],"after":[72],"these":[73],"modifications.":[74],"this":[76,84],"work,":[77],"we":[78,140,171,189],"extend":[79],"study":[81],"by":[82,162,180],"relaxing":[83],"constraint:":[85],"our":[86,115],"goal":[87],"ensure":[90],"cover,":[95],"even":[96,131],"if":[97,188],"removal":[99],"may":[103],"not":[104],"incur":[105],"decrease":[107],"said":[112],"cover.":[113],"Surprisingly,":[114],"relaxation":[116],"introduces":[117],"significant":[118],"theoretical":[119],"challenges.":[120],"We":[121],"observe":[122],"\u03a3\u00b2_P-complete,":[127],"and":[128,167],"remains":[129],"so":[130],"planar":[133],"graphs":[134],"maximum":[136,168],"degree":[137],"5.":[138],"Nevertheless,":[139],"provide":[141],"linear":[143],"time":[144],"algorithm":[145],"trees,":[147],"which":[148],"then":[150],"further":[151],"leveraged":[152],"show":[154,172],"MU-VC":[156,174],"in":[158,176],"FPT":[159],"when":[160,178],"parameterized":[161,179],"combination":[164],"treewidth":[166],"degree.":[169],"Finally,":[170],"XP":[177],"clique-width":[181],"while":[182],"fixed-parameter":[185],"tractable":[186],"(FPT)":[187],"add":[190],"as":[196],"parameter.":[200]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-18T00:00:00"}