{"id":"https://openalex.org/W2471129545","doi":"https://doi.org/10.1137/15m1032077","title":"Designing FPT Algorithms for Cut Problems Using Randomized Contractions","display_name":"Designing FPT Algorithms for Cut Problems Using Randomized Contractions","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2471129545","doi":"https://doi.org/10.1137/15m1032077","mag":"2471129545"},"language":"en","primary_location":{"id":"doi:10.1137/15m1032077","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1032077","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":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/aa71f187-e8f4-414c-855a-73bbf16b85be","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["PL","US"],"is_corresponding":false,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Department of Computer Science, University of Maryland at College Park, College Park, MD 20742","Institute of Informatics, University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland","University of Birmingham"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland","University of Birmingham"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB","PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland","University of Birmingham"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["PL","US"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland","Department of Computer Science, University of Maryland at College Park, College Park, MD 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1261,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.9797222,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"45","issue":"4","first_page":"1171","last_page":"1229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9943000078201294,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9889000058174133,"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/combinatorics","display_name":"Combinatorics","score":0.7284388542175293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6589301228523254},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5796309113502502},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5770771503448486},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5624748468399048},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5477402806282043},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5204208493232727},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5172055959701538},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5150015354156494},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5013973712921143},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49924254417419434},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4981536865234375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45237621665000916},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.4394644796848297},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.43472588062286377},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.41522416472435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3797893822193146}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7284388542175293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6589301228523254},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5796309113502502},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5770771503448486},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5624748468399048},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5477402806282043},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5204208493232727},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5172055959701538},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5150015354156494},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5013973712921143},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49924254417419434},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4981536865234375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45237621665000916},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4394644796848297},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.43472588062286377},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.41522416472435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797893822193146},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/15m1032077","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1032077","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:pure.atira.dk:openaire_cris_publications/aa71f187-e8f4-414c-855a-73bbf16b85be","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/aa71f187-e8f4-414c-855a-73bbf16b85be","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Cygan, M, Hajiaghayi, M, Pilipczuk, M & Pilipczuk, M 2016, 'Designing FPT algorithms for cut problems using randomized contractions', SIAM Journal on Computing, vol. 45, no. 4, pp. 1171-1229. https://doi.org/10.1137/15M1032077","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/aa71f187-e8f4-414c-855a-73bbf16b85be","is_oa":true,"landing_page_url":"https://epubs.siam.org/doi/10.1137/15M1032077","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis , R , Cygan , M , Hajiaghayi , M , Pilipczuk , M & Pilipczuk , M 2016 , ' Designing FPT algorithms for cut problems using randomized contractions ' , SIAM Journal on Computing , vol. 45 , no. 4 , pp. 1171-1229 . https://doi.org/10.1137/15M1032077","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/aa71f187-e8f4-414c-855a-73bbf16b85be","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/aa71f187-e8f4-414c-855a-73bbf16b85be","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Cygan, M, Hajiaghayi, M, Pilipczuk, M & Pilipczuk, M 2016, 'Designing FPT algorithms for cut problems using randomized contractions', SIAM Journal on Computing, vol. 45, no. 4, pp. 1171-1229. https://doi.org/10.1137/15M1032077","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1129333050","display_name":null,"funder_award_id":"N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G2123337798","display_name":null,"funder_award_id":"YIP N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3751613428","display_name":null,"funder_award_id":"YIP award N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3946359015","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4119360775","display_name":null,"funder_award_id":"N206567140","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G4425768753","display_name":"CAREER: Foundations of Network Design: Real-World Networks, Special Topologies, and Game Theory","funder_award_id":"1053605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5803244198","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G5990251679","display_name":null,"funder_award_id":"FA8650-11-1-7162","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"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/G6775816958","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320323078","funder_display_name":"Universitetet i Bergen"},{"id":"https://openalex.org/G7546946110","display_name":null,"funder_award_id":"FP/2007-2013)/ERC","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7717912469","display_name":null,"funder_award_id":"CAREER 1053605","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/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320323078","display_name":"Universitetet i Bergen","ror":"https://ror.org/03zga2b32"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1846185267","https://openalex.org/W1964510837","https://openalex.org/W1978447499","https://openalex.org/W1981591809","https://openalex.org/W1990666952","https://openalex.org/W1991579759","https://openalex.org/W1996575062","https://openalex.org/W2009924457","https://openalex.org/W2010004564","https://openalex.org/W2019062750","https://openalex.org/W2024517697","https://openalex.org/W2025304499","https://openalex.org/W2027343828","https://openalex.org/W2030460280","https://openalex.org/W2037713618","https://openalex.org/W2040831377","https://openalex.org/W2044343300","https://openalex.org/W2051627428","https://openalex.org/W2051856222","https://openalex.org/W2070745908","https://openalex.org/W2082223143","https://openalex.org/W2086937160","https://openalex.org/W2089657800","https://openalex.org/W2112306992","https://openalex.org/W2120358419","https://openalex.org/W2121641644","https://openalex.org/W2129939288","https://openalex.org/W2165454009","https://openalex.org/W2166115470","https://openalex.org/W2166563816","https://openalex.org/W2167236203","https://openalex.org/W2171796957","https://openalex.org/W2242403914","https://openalex.org/W2296148711","https://openalex.org/W2568407640","https://openalex.org/W2568613863","https://openalex.org/W2568986002","https://openalex.org/W2595985379","https://openalex.org/W2621263703","https://openalex.org/W2913688336","https://openalex.org/W2914414140","https://openalex.org/W3038118706","https://openalex.org/W3121576764","https://openalex.org/W4213064273"],"related_works":["https://openalex.org/W4214889528","https://openalex.org/W2087638517","https://openalex.org/W1618150311","https://openalex.org/W3099189614","https://openalex.org/W2127265216","https://openalex.org/W4287600303","https://openalex.org/W3135063256","https://openalex.org/W2126169066","https://openalex.org/W2132200819","https://openalex.org/W1964510837"],"abstract_inverted_index":{"We":[0,15,40,137,188],"introduce":[1],"a":[2,95,207],"new":[3],"technique":[4],"for":[5,9,31],"designing":[6],"xed-parameter":[7,23],"algorithms":[8,24,278,289],"cut":[10],"problems,":[11],"called":[12],"randomized":[13,159],"contractions.":[14],"apply":[16],"our":[17,251,288],"framework":[18],"to":[19,117,127,191],"obtain":[20],"the":[21,32,43,47,54,57,74,81,89,92,111,132,140,164,167,172,178,199,242,245,248,253,263],"rst":[22],"(FPT":[25],"algorithms)":[26],"with":[27,279],"exponential":[28,174,281],"speed":[29],"up":[30],"Steiner":[33,141],"Cut":[34,142],"and":[35,86,155,183,195,223,268],"Node":[36,210],"Multiway":[37,211],"Cut-Uncut":[38],"problems.":[39],"prove":[41,138],"that":[42,99,139,213,225,291],"parameterized":[44],"version":[45],"of":[46,56,83,91,107,113,166,177,181,219,244,250,257,265,287],"Unique":[48,58,108],"Label":[49],"Cover":[50],"problem,":[51,209],"which":[52,129,276],"is":[53,80,88,121,163,241,290],"base":[55],"Games":[59,109],"Conjecture,":[60],"can":[61,101,144,214,293],"be":[62,118,145],"solved":[63,146],"in":[64,73,102,147,231],"2O<sup>(k2":[65,232],"log":[66,68,149,151,157,233,235],"|\u03a3|)</sup><sub>n</sub>4":[67],"n":[69,152,236],"deterministic":[70,153,237],"time":[71,104,154,176],"(even":[72],"stronger,":[75],"vertex-deletion":[76],"variant),":[77],"where":[78,110,161,239],"k":[79,162,240],"number":[82,112],"unsatisfied":[84],"edges":[85,114],"|\u03a3|":[87],"size":[90,165,243],"alphabet.":[93],"As":[94],"consequence,":[96],"we":[97,204],"show":[98,189,224],"one":[100],"polynomial":[103],"solve":[105],"instances":[106],"allowed":[115],"not":[116],"satis":[119],"ed":[120],"upper":[122,135],"bounded":[123],"by":[124],"O(log":[125],"n)":[126],"optimality,":[128],"improves":[130,171],"over":[131],"trivial":[133],"O(1)":[134],"bound.":[136],"problem":[143],"2<sup>O(k2":[148],"k)</sup>n<sup>4</sup>":[150,234],"O(2<sup>O(k2":[156],"k)</sup>n<sup>2</sup>)":[158],"time,":[160,238],"cutset.":[168,246],"This":[169],"result":[170],"double":[173,280],"running":[175,230,282],"recent":[179],"work":[180],"Kawarabayashi":[182],"Thorup":[184],"presented":[185],"at":[186,198],"FOCS'11.":[187],"how":[190],"combine":[192],"considering":[193],"\\cut\"":[194],"\\uncut\"":[196],"constraints":[197,222,260],"same":[200],"time.":[201,283],"More":[202],"precisely,":[203],"de":[205],"ne":[206],"robust":[208],"Cut-Uncut,":[212],"serve":[215],"as":[216],"an":[217,228],"abstraction":[218],"introducing":[220],"uncut":[221,259],"it":[226],"admits":[227],"algorithm":[229],"To":[247],"best":[249],"knowledge,":[252],"only":[254],"known":[255],"way":[256],"tackling":[258],"was":[261],"via":[262],"approach":[264],"Marx,":[266],"O'Sullivan,":[267],"Razgon":[269],"[ACM":[270],"Trans.":[271],"Algorithms,":[272],"9":[273],"(2013),":[274],"30],":[275],"yields":[277],"An":[284],"interesting":[285],"aspect":[286],"they":[292],"handle":[294],"positive":[295],"real":[296],"weights.":[297]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}