{"id":"https://openalex.org/W1978447499","doi":"https://doi.org/10.1137/110855247","title":"Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset","display_name":"Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1978447499","doi":"https://doi.org/10.1137/110855247","mag":"1978447499"},"language":"en","primary_location":{"id":"doi:10.1137/110855247","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110855247","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/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":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI),"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI),","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068912124","display_name":"Igor Razgon","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Igor Razgon","raw_affiliation_strings":["Department of Computer Science and Information Systems, Birkbeck, University of London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Systems, Birkbeck, University of London","institution_ids":["https://openalex.org/I98259816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":6.9862,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.97229229,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"43","issue":"2","first_page":"355","last_page":"388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9951000213623047,"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.9099885821342468},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8530274629592896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.71502286195755},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5761530995368958},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5520150065422058},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5115988850593567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4905950129032135},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.436848908662796},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4250418245792389},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3837335407733917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1883038580417633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14707249402999878}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9099885821342468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8530274629592896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.71502286195755},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5761530995368958},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5520150065422058},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5115988850593567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4905950129032135},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.436848908662796},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4250418245792389},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3837335407733917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1883038580417633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14707249402999878},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110855247","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110855247","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1974018476","https://openalex.org/W1985875030","https://openalex.org/W1991579759","https://openalex.org/W2014767497","https://openalex.org/W2025304499","https://openalex.org/W2032692205","https://openalex.org/W2039375254","https://openalex.org/W2039904196","https://openalex.org/W2044343300","https://openalex.org/W2051856222","https://openalex.org/W2076164610","https://openalex.org/W2086937160","https://openalex.org/W2088844265","https://openalex.org/W2089657800","https://openalex.org/W2121641644","https://openalex.org/W2152986618","https://openalex.org/W2153724959","https://openalex.org/W2161719898","https://openalex.org/W2568986002","https://openalex.org/W2914959486","https://openalex.org/W4213048784","https://openalex.org/W4213060883","https://openalex.org/W4243521820"],"related_works":["https://openalex.org/W2492498253","https://openalex.org/W3135299686","https://openalex.org/W4205772203","https://openalex.org/W4206498635","https://openalex.org/W2951185106","https://openalex.org/W1604162242","https://openalex.org/W4297688303","https://openalex.org/W3196638783","https://openalex.org/W3208065116","https://openalex.org/W1447961680"],"abstract_inverted_index":{"Given":[0],"an":[1,15,97],"undirected":[2],"graph":[3],"$G$,":[4],"a":[5,26,56],"collection":[6],"$\\{(s_1,t_1),":[7],"\\dots,":[8],"(s_{k},t_{k})\\}$":[9],"of":[10,12,29,38,58,85,102,112,126],"pairs":[11],"vertices,":[13],"and":[14],"integer":[16],"${{p}}$,":[17],"the":[18,36,44,50,82,86,89,103,109,113,124,127],"Edge":[19],"Multicut":[20,48],"problem":[21,52],"asks":[22],"if":[23],"there":[24],"is":[25,49,55,66,94],"set":[27,57],"$S$":[28,39,54],"at":[30,59],"most":[31,60],"${{p}}$":[32,61,84],"edges":[33],"such":[34],"that":[35,67,96],"removal":[37],"disconnects":[40],"every":[41],"$s_i$":[42],"from":[43],"corresponding":[45],"$t_i$.":[46],"Vertex":[47],"analogous":[51],"where":[53],"vertices.":[62],"Our":[63],"main":[64],"result":[65],"both":[68],"problems":[69],"can":[70],"be":[71,120],"solved":[72],"in":[73,88],"time":[74,101],"$2^{O({{p}}^3)}\\cdot":[75],"n^{O(1)}$,":[76],"i.e.,":[77],"fixed-parameter":[78],"tractable":[79],"parameterized":[80,122],"by":[81,123],"size":[83,125],"cutset":[87],"solution.":[90],"By":[91],"contrast,":[92],"it":[93,118],"unlikely":[95],"algorithm":[98],"with":[99],"running":[100],"form":[104],"$f({{p}})\\cdot":[105],"n^{O(1)}$":[106],"exists":[107],"for":[108],"directed":[110],"version":[111],"problem,":[114],"as":[115],"we":[116],"show":[117],"to":[119],"W[1]-hard":[121],"cutset.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":39},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}