{"id":"https://openalex.org/W2785454599","doi":"https://doi.org/10.1137/140961808","title":"Multicut Is FPT","display_name":"Multicut Is FPT","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2785454599","doi":"https://doi.org/10.1137/140961808","mag":"2785454599"},"language":"en","primary_location":{"id":"doi:10.1137/140961808","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140961808","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/A5044190443","display_name":"Nicol\u00e1s Bousquet","orcid":"https://orcid.org/0000-0003-0170-0503"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Bousquet","raw_affiliation_strings":["G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)","institution_ids":["https://openalex.org/I4210094718"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088651105","display_name":"Jean Daligault","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean Daligault","raw_affiliation_strings":["ALGCO - Algorithmes, Graphes et Combinatoire (LIRMM, 161 rue Ada, 34000 Montpellier - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALGCO - Algorithmes, Graphes et Combinatoire (LIRMM, 161 rue Ada, 34000 Montpellier - France)","institution_ids":["https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033238040","display_name":"St\u00e9phan Thomass\u00e9","orcid":"https://orcid.org/0000-0002-7090-1790"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phan Thomass\u00e9","raw_affiliation_strings":["IUF - Institut universitaire de France (Maison des Universit\u00e9s 103 Boulevard Saint-Michel 75005 Paris - France)","MC2 - Mod\u00e8les de calcul, Complexit\u00e9, Combinatoire (ENS Lyon 46 all\u00e9e d'Italie 69364 Lyon Cedex 07 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IUF - Institut universitaire de France (Maison des Universit\u00e9s 103 Boulevard Saint-Michel 75005 Paris - France)","institution_ids":["https://openalex.org/I185839726"]},{"raw_affiliation_string":"MC2 - Mod\u00e8les de calcul, Complexit\u00e9, Combinatoire (ENS Lyon 46 all\u00e9e d'Italie 69364 Lyon Cedex 07 - France)","institution_ids":["https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7578,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.72835052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"47","issue":"1","first_page":"166","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8283017873764038},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7994520664215088},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6368693709373474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6109336614608765},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.6040675640106201},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5748754143714905},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5433640480041504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32580894231796265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24689313769340515}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8283017873764038},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7994520664215088},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6368693709373474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6109336614608765},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.6040675640106201},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5748754143714905},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5433640480041504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32580894231796265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24689313769340515},{"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.1137/140961808","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140961808","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"},{"id":"pmh:oai:HAL:hal-01804120v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01804120","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2018, 47 (1), pp.166-207. ⟨10.1137/140961808⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1978447499","https://openalex.org/W1981591809","https://openalex.org/W1991579759","https://openalex.org/W2007342225","https://openalex.org/W2014767497","https://openalex.org/W2016341899","https://openalex.org/W2016590962","https://openalex.org/W2019062750","https://openalex.org/W2044343300","https://openalex.org/W2050285203","https://openalex.org/W2063375015","https://openalex.org/W2086937160","https://openalex.org/W2121641644","https://openalex.org/W2152986618","https://openalex.org/W2161719898","https://openalex.org/W2568613863","https://openalex.org/W2568986002","https://openalex.org/W4243521820"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W2132921321","https://openalex.org/W2998616538","https://openalex.org/W2964749573","https://openalex.org/W4288277589","https://openalex.org/W2401679980","https://openalex.org/W2048227119","https://openalex.org/W2076082825"],"abstract_inverted_index":{"Let":[0],"$G=(V,E)$":[1],"be":[2,10],"a":[3,11,24,60],"graph":[4],"on":[5],"$n$":[6],"vertices":[7,16],"and":[8],"$R$":[9,35],"set":[12],"of":[13,15,27,34,43,62],"pairs":[14],"in":[17],"$V$":[18],"called":[19],"requests.":[20],"A":[21],"multicut":[22,61],"is":[23,36,79],"subset":[25],"$F$":[26],"$E$":[28],"such":[29],"that":[30,49],"every":[31,41],"request":[32],"$xy$":[33],"separated":[37],"by":[38,74],"$F$,":[39],"i.e.,":[40],"$xy$-path":[42],"$G$":[44],"intersects":[45],"$F$.":[46],"We":[47],"show":[48],"there":[50,58],"exists":[51,59],"an":[52],"$O(f(k)n^c)$":[53],"algorithm":[54],"which":[55],"decides":[56],"if":[57],"size":[63,77],"at":[64],"most":[65],"$k$.":[66],"In":[67],"other":[68],"words,":[69],"the":[70,75],"Multicut":[71],"problem":[72],"parameterized":[73],"solution":[76],"$k$":[78],"fixed-parameter":[80],"tractable":[81],"(FPT).":[82]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2018-02-23T00:00:00"}