{"id":"https://openalex.org/W2568986002","doi":"https://doi.org/10.1137/12086217x","title":"Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset","display_name":"Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2568986002","doi":"https://doi.org/10.1137/12086217x","mag":"2568986002"},"language":"en","primary_location":{"id":"doi:10.1137/12086217x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/12086217x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Department of Computer Science , University of Maryland at College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Maryland at College Park, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":[],"affiliations":[]},{"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/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0275,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.97472239,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"42","issue":"4","first_page":"1674","last_page":"1696"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.996999979019165,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8673847913742065},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8026177883148193},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6656737923622131},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6108908653259277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5543545484542847},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5461172461509705},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4930860698223114},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4622938334941864},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4555361270904541},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.4423278272151947},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4248661398887634},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4230666756629944},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4208073914051056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4099230468273163},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3734080195426941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3259354829788208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1046346127986908},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09593409299850464}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8673847913742065},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8026177883148193},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6656737923622131},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6108908653259277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5543545484542847},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5461172461509705},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4930860698223114},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4622938334941864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4555361270904541},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.4423278272151947},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4248661398887634},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4230666756629944},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4208073914051056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4099230468273163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3734080195426941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3259354829788208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1046346127986908},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09593409299850464},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/12086217x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/12086217x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4776870722","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1991579759","https://openalex.org/W2005079828","https://openalex.org/W2005309613","https://openalex.org/W2010004564","https://openalex.org/W2025304499","https://openalex.org/W2067016370","https://openalex.org/W2086937160","https://openalex.org/W2089657800","https://openalex.org/W2121641644","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W2951199065","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4288723498","https://openalex.org/W4292730466","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2603633312","https://openalex.org/W2792615373"],"abstract_inverted_index":{"Given":[0],"a":[1,5,24,53,87],"directed":[2],"graph":[3],"$G$,":[4],"set":[6,25,54,88],"of":[7,27,55,72,89,94,124,131,184,187,214],"$k$":[8,90],"terminals,":[9],"and":[10,121,142,167,226],"an":[11,192],"integer":[12],"$p$,":[13],"the":[14,47,73,77,125,152,185,188,197,212],"Directed":[15,42,143,163,168,206],"Vertex":[16,164],"Multiway":[17,44,111,165,170],"Cut":[18,45,166,171],"problem":[19,49,222],"asks":[20],"whether":[21],"there":[22],"is":[23,46,52,76,113,140,145,160,209],"$S$":[26,51],"at":[28,56],"most":[29,57],"$p$":[30,58,183],"(nonterminal)":[31],"vertices":[32],"whose":[33],"removal":[34],"disconnects":[35],"each":[36],"terminal":[37,216],"from":[38,202],"all":[39,95],"other":[40],"terminals.":[41],"Edge":[43,169],"analogous":[48],"where":[50],"edges.":[59],"These":[60],"two":[61],"problems":[62],"are":[63],"indeed":[64],"known":[65],"to":[66,84],"be":[67,173],"equivalent.":[68],"A":[69],"natural":[70],"generalization":[71],"multiway":[74],"cut":[75,112],"Multicut":[78,139,144,208],"problem,":[79],"in":[80,107,175],"which":[81,159,218],"we":[82],"want":[83],"disconnect":[85],"only":[86],"given":[91],"pairs":[92],"instead":[93],"pairs.":[96],"Marx":[97,120,225],"[Theoret.":[98],"Comput.":[99],"Sci.,":[100],"351":[101],"(2006),":[102],"pp.":[103,134],"394--406]":[104],"showed":[105,136],"that":[106,137,161,205],"undirected":[108,138],"graphs":[109],"Vertex/Edge":[110],"fixed-parameter":[114],"tractable":[115],"(FPT)":[116],"parameterized":[117,147,180],"by":[118,148,155,181,196,224],"$p$.":[119,149],"Razgon":[122],"[Proceedings":[123],"43rd":[126],"ACM":[127],"Symposium":[128],"on":[129],"Theory":[130],"Computing,":[132],"2011,":[133],"469--478]":[135],"FPT":[141,179,210],"W[1]-hard":[146],"We":[150],"complete":[151],"picture":[153],"here":[154],"our":[156,203],"main":[157],"result,":[158],"both":[162],"can":[172],"solved":[174],"time":[176],"$2^{2^{O(p)}}n^{O(1)}$,":[177],"i.e.,":[178],"size":[182],"cutset":[186],"solution.":[189],"This":[190],"answers":[191,219],"open":[193,221],"question":[194],"raised":[195,223],"aforementioned":[198],"papers.":[199],"It":[200],"follows":[201],"result":[204],"Edge/Vertex":[207],"for":[211],"case":[213],"$k=2$":[215],"pairs,":[217],"another":[220],"Razgon.":[227]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}