{"id":"https://openalex.org/W2781748924","doi":"https://doi.org/10.1145/3155299","title":"Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et","display_name":"Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et","publication_year":2018,"publication_date":"2018-01-03","ids":{"openalex":"https://openalex.org/W2781748924","doi":"https://doi.org/10.1145/3155299","mag":"2781748924"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155299","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6333","1549-6325"],"is_oa":false,"is_in_doaj":false,"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,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://wrap.warwick.ac.uk/101481/1/WRAP-linear-time-parameterized-algorithms-Lokshtanov-2018.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":null},"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_string":"University of Bergen, Norway, Bergen#TAB#","raw_affiliation_strings":["University of Bergen, Norway, Bergen#TAB#"]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000147923","display_name":"M. S. Ramanujan","orcid":"https://orcid.org/0000-0002-2116-6048"},"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":"M. S. Ramanujan","raw_affiliation_string":"University of Bergen, Norway, Bergen#TAB#","raw_affiliation_strings":["University of Bergen, Norway, Bergen#TAB#"]},{"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"]},{"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":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_string":"The Institute of Mathematical Sciences, HBNI, Chennai, India University of Bergen, Norway#TAB#","raw_affiliation_strings":["The Institute of Mathematical Sciences, HBNI, Chennai, India University of Bergen, Norway#TAB#"]}],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":false,"cited_by_count":14,"cited_by_percentile_year":{"min":90,"max":91},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"37"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9999,"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":"Graph Theory and Algorithms","score":0.9999,"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":"Combinatorial Optimization and Complexity Theory","score":0.9944,"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.9941,"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":[{"keyword":"linear time parameterized algorithms","score":0.671}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8438132},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7382255},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.72093844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.55633175},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.52966374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5243573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5076486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5037183},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4187749},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37898394},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155299","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6333","1549-6325"],"is_oa":false,"is_in_doaj":false,"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,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://wrap.warwick.ac.uk/101481/1/WRAP-linear-time-parameterized-algorithms-Lokshtanov-2018.pdf","pdf_url":"http://wrap.warwick.ac.uk/101481/1/WRAP-linear-time-parameterized-algorithms-Lokshtanov-2018.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":["University of Warwick"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.9652","pdf_url":"http://www.ii.uib.no/%7Edaniello/papers/subsetFVSfpt.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://wrap.warwick.ac.uk/101481/1/WRAP-linear-time-parameterized-algorithms-Lokshtanov-2018.pdf","pdf_url":"http://wrap.warwick.ac.uk/101481/1/WRAP-linear-time-parameterized-algorithms-Lokshtanov-2018.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":["University of Warwick"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320323898","funder_display_name":"Bergens Forskningsstiftelse","award_id":"BeHard"},{"funder":"https://openalex.org/F4320334678","funder_display_name":"European Research Council","award_id":"306992"}],"referenced_works_count":36,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1533487312","https://openalex.org/W1534309112","https://openalex.org/W1846185267","https://openalex.org/W1955711040","https://openalex.org/W1978447499","https://openalex.org/W1979312598","https://openalex.org/W1994556169","https://openalex.org/W1995725694","https://openalex.org/W1997576329","https://openalex.org/W2002055996","https://openalex.org/W2005079828","https://openalex.org/W2016590962","https://openalex.org/W2024931493","https://openalex.org/W2059273723","https://openalex.org/W2059372025","https://openalex.org/W2072261513","https://openalex.org/W2075199819","https://openalex.org/W2084595628","https://openalex.org/W2086937160","https://openalex.org/W2097289283","https://openalex.org/W2104713819","https://openalex.org/W2114769758","https://openalex.org/W2115589427","https://openalex.org/W2121641644","https://openalex.org/W2125350407","https://openalex.org/W2168568667","https://openalex.org/W2171796957","https://openalex.org/W2568407640","https://openalex.org/W2570081448","https://openalex.org/W2952587811","https://openalex.org/W3101258912","https://openalex.org/W4213060883","https://openalex.org/W4213262063","https://openalex.org/W4214877845","https://openalex.org/W4255585629"],"related_works":["https://openalex.org/W2953073202","https://openalex.org/W3214675586","https://openalex.org/W3046835365","https://openalex.org/W4389156785","https://openalex.org/W2492498253","https://openalex.org/W2173621488","https://openalex.org/W2087638517","https://openalex.org/W2800485060","https://openalex.org/W3135299686","https://openalex.org/W2113885662"],"ngrams_url":"https://api.openalex.org/works/W2781748924/ngrams","abstract_inverted_index":{"In":[0,89,238],"the":[1,14,72,85,91,107,179,201,209,215,219,231,243,257,315,342,349,354,367],"S":[2,8,77,125,157,186,250,262,270,290,319],"ubset":[3,11,126,158,187,251,263,271,291,320],"F":[4,73],"eedback":[5,74],"V":[6,75],"ertex":[7,76],"et":[9,78,147],"(S":[10],"FVS)":[12],"problem,":[13],"input":[15,232,355],"is":[16,43,109,212,234,311],"a":[17,26,49,61],"graph":[18,116],"G":[19],"on":[20,208,230,347,363],"n":[21,137,171,195,281,305,334],"vertices":[22,29,55,371,382],"and":[23,36,119],"m":[24,139,283,307],"edges,":[25],"subset":[27],"of":[28,51,65,71,94,221,358],"T":[30],",":[31,337],"referred":[32],"to":[33,44,374],"as":[34,224,226,351,353],"terminals,":[35],"an":[37,122,154,324],"integer":[38],"k":[39,54,135,166,168,193,205,211,278,299,301,332],".":[40,174],"The":[41,63],"objective":[42],"determine":[45],"whether":[46],"there":[47],"exists":[48],"set":[50],"at":[52,235],"most":[53],"intersecting":[56],"every":[57],"cycle":[58],"that":[59,106,313,369],"contains":[60],"terminal.":[62],"study":[64],"parameterized":[66,92,247],"algorithms":[67,248,260,360],"for":[68,124,156,185,249,261,269,289],"this":[69,95,222,239],"generalization":[70],"problem":[79,96,108],"has":[80],"received":[81],"significant":[82],"attention":[83],"over":[84],"past":[86],"few":[87],"years.":[88],"fact,":[90],"complexity":[93],"was":[97],"open":[98],"until":[99],"2011,":[100,150],"when":[101],"two":[102],"groups":[103],"independently":[104],"showed":[105],"fixed":[110],"parameter":[111,210,350],"tractable.":[112],"Using":[113],"tools":[114],"from":[115,384],"minors,,":[117],"Kawarabayashi":[118],"Kobayashi":[120],"obtained":[121,178],"algorithm":[123,155,184,223,268,288,325,340],"FVS":[127,159,272,292,321],"running":[128,160,189,273,293,326],"in":[129,161,190,274,294,327,366,377],"time":[130,162,183,191,246,275,295,328],"O":[131,164,172,196,203,276,297,335],"(":[132,134,165,204,280,298,304,331],"f":[133],")\u010b":[136],"2":[138,163,202,296,329],")":[140,169,206,302,333],"[SODA":[141,198],"2012,":[142],"JCTB":[143],"2012].":[144],"Independently,":[145],"Cygan":[146],"al.":[148],"[ICALP":[149],"SIDMA":[151],"2013]":[152],"designed":[153],"log":[167,300],"\u010b":[170,194,279,303],"(1)":[173,197,336],"More":[175,253],"recently,":[176],"Wahlstr\u00f6m":[177],"first":[180,244,339],"single":[181],"exponential":[182],"FVS,":[188],"4":[192],"2014].":[199],"While":[200],"dependence":[207,220,346],"optimal":[213],"under":[214],"Exponential":[216,316],"Time":[217,317],"Hypothesis,":[218,318],"well":[225,352],"those":[227],"preceding":[228],"it,":[229],"size":[233,379],"least":[236],"quadratic.":[237],"article,":[240],"we":[241,255],"design":[242],"linear":[245],"FVS.":[252,264],"precisely,":[254],"obtain":[256],"following":[258],"new":[259],"\u2014":[265,285],"A":[266,286],"randomized":[267],"(25.6":[277],"+":[282,306],")).":[284],"deterministic":[287],").":[308],"Since":[309],"it":[310],"known":[312],"assuming":[314],"cannot":[322],"have":[323],"o":[330],"our":[338,359],"obtains":[341],"best":[343],"possible":[344],"asymptotic":[345],"both":[348],"size.":[356],"Both":[357],"are":[361,372],"based":[362],"\u201ccut":[364],"centrality,\u201d":[365],"sense":[368],"solution":[370],"likely":[373],"show":[375],"up":[376],"minimum":[378],"cuts":[380],"between":[381],"sampled":[383],"carefully":[385],"chosen":[386],"distributions.":[387]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2781748924","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2024-03-21T23:03:30.853081","created_date":"2018-01-12"}