{"id":"https://openalex.org/W1846185267","doi":"https://doi.org/10.1145/2700209","title":"Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable","display_name":"Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable","publication_year":2015,"publication_date":"2015-04-13","ids":{"openalex":"https://openalex.org/W1846185267","doi":"https://doi.org/10.1145/2700209","mag":"1846185267"},"language":"en","primary_location":{"id":"doi:10.1145/2700209","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700209","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland, Warszawa","Institute of Informatics, University of Warsaw, Poland, Warszawa#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland, Warszawa","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland, Warszawa#TAB#","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108375748","display_name":"Mohammataghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammataghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9408,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.95433297,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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.9975000023841858,"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.9861000180244446,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9768999814987183,"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.7932916879653931},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7817468643188477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7311404943466187},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5925818681716919},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5820124745368958},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.556550920009613},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5328902006149292},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4284549951553345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39313292503356934}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7932916879653931},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7817468643188477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7311404943466187},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5925818681716919},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5820124745368958},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.556550920009613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5328902006149292},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4284549951553345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39313292503356934}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2700209","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700209","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.atira.dk:openaire_cris_publications/6c36be77-aabb-41fd-bef4-f1768da8cd88","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/6c36be77-aabb-41fd-bef4-f1768da8cd88","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chitnis, R, Cygan, M, Hajiaghayi, M & Marx, D 2015, 'Directed subset feedback vertex set is fixed-parameter tractable', ACM Transactions on Algorithms, vol. 11, no. 4, 28. https://doi.org/10.1145/2700209","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/6c36be77-aabb-41fd-bef4-f1768da8cd88","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84928235454&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Cygan, M, Hajiaghayi, M & Marx, D 2015, 'Directed subset feedback vertex set is fixed-parameter tractable', ACM Transactions on Algorithms, vol. 11, no. 4, 28. https://doi.org/10.1145/2700209","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W54213734","https://openalex.org/W1485150579","https://openalex.org/W1496170950","https://openalex.org/W1517036688","https://openalex.org/W1517065489","https://openalex.org/W1517074594","https://openalex.org/W1532197868","https://openalex.org/W1533487312","https://openalex.org/W1570425181","https://openalex.org/W1573376749","https://openalex.org/W1826506799","https://openalex.org/W1896986820","https://openalex.org/W1971393213","https://openalex.org/W1978447499","https://openalex.org/W1979312598","https://openalex.org/W1991579759","https://openalex.org/W1992349235","https://openalex.org/W2000311286","https://openalex.org/W2016590962","https://openalex.org/W2022841964","https://openalex.org/W2024517697","https://openalex.org/W2040831377","https://openalex.org/W2051856222","https://openalex.org/W2059273723","https://openalex.org/W2061881283","https://openalex.org/W2065803871","https://openalex.org/W2070745908","https://openalex.org/W2075209053","https://openalex.org/W2083044334","https://openalex.org/W2086937160","https://openalex.org/W2089657800","https://openalex.org/W2106524338","https://openalex.org/W2119741712","https://openalex.org/W2121641644","https://openalex.org/W2122082801","https://openalex.org/W2125350407","https://openalex.org/W2129939288","https://openalex.org/W2147466109","https://openalex.org/W2157295389","https://openalex.org/W2166115470","https://openalex.org/W2171796957","https://openalex.org/W2201885232","https://openalex.org/W2401610261","https://openalex.org/W2490706771","https://openalex.org/W2568407640","https://openalex.org/W2568613863","https://openalex.org/W2568986002","https://openalex.org/W2569542361","https://openalex.org/W2913688336","https://openalex.org/W3101258912","https://openalex.org/W3102351898","https://openalex.org/W3149604617","https://openalex.org/W4210756314","https://openalex.org/W4255585629"],"related_works":["https://openalex.org/W2145212918","https://openalex.org/W2085731789","https://openalex.org/W2402064113","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W79682516","https://openalex.org/W3215145351","https://openalex.org/W4205772203","https://openalex.org/W2396010974","https://openalex.org/W43934320"],"abstract_inverted_index":{"Given":[0],"a":[1,19,46,63,83,122,186,290,312],"graph":[2],"G":[3],"and":[4,113,163,226,232,247,260],"an":[5,105,127,304,355],"integer":[6],"k":[7,27,85,86,200,212,362,368],",":[8],"the":[9,33,132,141,145,173,214,221,287,296,328,339,344,372,376],"Feedback":[10],"Vertex":[11],"Set":[12],"(FVS)":[13],"problem":[14,66,148],"asks":[15],"if":[16],"there":[17],"is":[18,78,258,281],"vertex":[20,123],"set":[21],"T":[22],"of":[23,48,57,99,109,124,129,175,213,237,240,289,299,315,330,375,381],"size":[24,211],"at":[25],"most":[26],"that":[28,76,185,255,277,307],"hits":[29],"all":[30,118],"cycles":[31,119],"in":[32,41,45,50,59,140,149,189,195,230,303,333,343,351,371],"graph.":[34],"The":[35,52,235],"first":[36],"fixed-parameter":[37,53,79],"algorithm":[38,380],"for":[39,223,326],"FVS":[40,58,147,188,224],"undirected":[42,150,231],"graphs":[43,61,151,191,274],"appeared":[44],"monograph":[47],"Mehlhorn":[49],"1984.":[51],"tractability":[54],"(FPT)":[55],"status":[56],"directed":[60,190,233,273,334],"was":[62,152,243,262],"long-standing":[64],"open":[65],"until":[67],"Chen":[68,176],"et":[69,159,167,177,266,383],"al.":[70,160,168,178,267,384],"(STOC":[71,179,249],"\u201908,":[72,180],"JACM":[73,181],"\u201908)":[74,182],"showed":[75],"it":[77,261],"tractable":[80],"by":[81,157,165,183,210,245,264],"giving":[82],"4":[84],"!":[87],"\u00b7":[88],"n":[89,204],"O":[90,198,205,360,366],"(1)":[91,206],"time":[92,196],"algorithm.":[93],"There":[94],"are":[95,103,135],"two":[96,133],"subset":[97,107,228],"versions":[98,229],"this":[100,320,353],"problems:":[101],"We":[102,171,318],"given":[104],"additional":[106],"S":[108,125,130],"vertices":[110],"(resp.,":[111,126],"edges),":[112],"we":[114,219,294,337],"want":[115],"to":[116,137,154,253,272,275,285,346,364],"hit":[117],"passing":[120],"through":[121],"edge":[128],");":[131],"variants":[134],"known":[136],"be":[138,155,193,309,324],"equivalent":[139],"parameterized":[142,209],"sense.":[143],"Recently,":[144],"Subset":[146,187,292],"shown":[153],"FPT":[156,208,288,329],"Cygan":[158],"(ICALP\u201911,":[161],"SIDMA\u201913)":[162],"independently":[164],"Kakimura":[166],"(SODA":[169,268,385],"\u201912).":[170],"generalize":[172],"result":[174],"showing":[184,327],"can":[192,308],"solved":[194],"2":[197,358,359,365,369],"(":[199,361,367],"3":[201],")":[202,363,370],"\u010b":[203],"(i.e.,":[207],"solution).":[215],"By":[216],"our":[217],"result,":[218],"complete":[220],"picture":[222],"problems":[225,332],"their":[227],"graphs.":[234,335],"technique":[236,302,345],"random":[238,297],"sampling":[239,298],"important":[241,300],"separators":[242,301],"used":[244,310,342],"Marx":[246],"Razgon":[248],"\u201911,":[250],"SICOMP":[251,270,387],"\u201914)":[252],"show":[254,276],"Undirected":[256],"Multicut":[257],"FPT,":[259],"generalized":[263],"Chitnis":[265,382],"\u201912,":[269,386],"\u201913)":[271],"Directed":[278,291,377],"Multiway":[279,378],"Cut":[280,379],"FPT.":[282],"In":[283],"addition":[284],"proving":[286],"FVS,":[293],"reformulate":[295],"abstract":[305],"way":[306],"with":[311],"general":[313,321],"family":[314],"transversal":[316],"problems.":[317],"believe":[319],"approach":[322],"will":[323],"useful":[325],"other":[331],"Moreover,":[336],"modify":[338],"probability":[340],"distribution":[341],"achieve":[347],"better":[348],"running":[349],"time;":[350],"particular,":[352],"gives":[354],"improvement":[356],"from":[357],"parameter":[373],"dependence":[374],"\u201913).":[388]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}