{"id":"https://openalex.org/W2106959995","doi":"https://doi.org/10.1145/1993636.1993699","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":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2106959995","doi":"https://doi.org/10.1145/1993636.1993699","mag":"2106959995"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993699","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993699","any_repository_has_fulltext":null},"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/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","[Humboldt Universitat zu Berlin, Berlin, Germany]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"[Humboldt Universitat zu Berlin, Berlin, Germany]","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068912124","display_name":"Igor Razgon","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Igor Razgon","raw_affiliation_strings":["University of Leicester, Leicester, United Kingdom","university of leicester, Leicester, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"university of leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.1095,"has_fulltext":true,"cited_by_count":89,"citation_normalized_percentile":{"value":0.99799365,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"469","last_page":"478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12534","display_name":"Protein Degradation and Inhibitors","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9091480374336243},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7777544856071472},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6168679594993591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.614392876625061},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5912542939186096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5363951921463013},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.502610445022583},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47354716062545776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35412174463272095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2252563238143921}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9091480374336243},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7777544856071472},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6168679594993591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.614392876625061},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5912542939186096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5363951921463013},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.502610445022583},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47354716062545776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35412174463272095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2252563238143921},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1993636.1993699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993699","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:lra.le.ac.uk:2381/20526","is_oa":false,"landing_page_url":"http://hdl.handle.net/2381/20526","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993699","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4486072965","display_name":"Employing Artificial Intelligence to Make Constraint Programming Easier to Use for Decision Making","funder_award_id":"05/IN/I886","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"},{"id":"https://openalex.org/G4547255915","display_name":null,"funder_award_id":"OTKA 67651","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320308269","display_name":"Alexander von Humboldt-Stiftung","ror":"https://ror.org/012kf4317"},{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"},{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2106959995.pdf","grobid_xml":"https://content.openalex.org/works/W2106959995.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W87291490","https://openalex.org/W1485150579","https://openalex.org/W1499816646","https://openalex.org/W1500938493","https://openalex.org/W1504436682","https://openalex.org/W1517036688","https://openalex.org/W1519134344","https://openalex.org/W1533487312","https://openalex.org/W1570425181","https://openalex.org/W1964119857","https://openalex.org/W1974018476","https://openalex.org/W1985875030","https://openalex.org/W1991579759","https://openalex.org/W2002531683","https://openalex.org/W2008362572","https://openalex.org/W2014767497","https://openalex.org/W2016590962","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/W2065803871","https://openalex.org/W2076164610","https://openalex.org/W2082223143","https://openalex.org/W2086937160","https://openalex.org/W2088844265","https://openalex.org/W2089657800","https://openalex.org/W2106959995","https://openalex.org/W2107080175","https://openalex.org/W2120358419","https://openalex.org/W2121641644","https://openalex.org/W2129939288","https://openalex.org/W2148025043","https://openalex.org/W2151141289","https://openalex.org/W2152986618","https://openalex.org/W2153724959","https://openalex.org/W2161719898","https://openalex.org/W2172205830","https://openalex.org/W2569542361","https://openalex.org/W2709134661","https://openalex.org/W2913688336","https://openalex.org/W2914959486","https://openalex.org/W2950152085","https://openalex.org/W2952630606","https://openalex.org/W4213048784","https://openalex.org/W4213060883","https://openalex.org/W4243715249","https://openalex.org/W4387732302"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W1516574938","https://openalex.org/W4205772203","https://openalex.org/W1994341438"],"abstract_inverted_index":{"Given":[0],"an":[1,15,98],"undirected":[2],"graph":[3],"$G$,":[4],"a":[5,26,56],"collection":[6],"{(s1,t1),":[7],"...,":[8],"(sl,tl)}":[9],"of":[10,12,29,38,58,86,103,114,128],"pairs":[11],"vertices,":[13],"and":[14],"integer":[16],"p,":[17],"the":[18,36,44,50,83,87,90,104,111,115,126,129],"Edge":[19],"Multicut":[20,48],"problem":[21,52],"ask":[22],"if":[23],"there":[24],"is":[25,49,55,66,95],"set":[27,57],"S":[28,39,54],"at":[30,59],"most":[31,60],"p":[32,61,85],"edges":[33],"such":[34],"that":[35,67,97],"removal":[37],"disconnects":[40],"every":[41],"si":[42],"from":[43],"corresponding":[45],"ti.":[46],"Vertex":[47],"analogous":[51],"where":[53],"vertices.":[62],"Our":[63],"main":[64],"result":[65],"both":[68],"problems":[69],"can":[70],"be":[71,122],"solved":[72],"in":[73,89],"time":[74,102],"2O(p3)":[75],"\u22c5":[76,107],"nO(1),":[77],"i.e.,":[78],"fixed-parameter":[79],"tractable":[80],"parameterized":[81,124],"by":[82,125],"size":[84,127],"cutset":[88],"solution.":[91],"By":[92],"contrast,":[93],"it":[94,120],"unlikely":[96],"algorithm":[99],"with":[100],"running":[101],"form":[105],"f(p)":[106],"nO(1)":[108],"exists":[109],"for":[110],"directed":[112],"version":[113],"problem,":[116],"as":[117],"we":[118],"show":[119],"to":[121],"W[1]-hard":[123],"cutset.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":22}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}