{"id":"https://openalex.org/W1991579759","doi":"https://doi.org/10.1145/2462896.2462899","title":"On multiway cut parameterized above lower bounds","display_name":"On multiway cut parameterized above lower bounds","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W1991579759","doi":"https://doi.org/10.1145/2462896.2462899","mag":"1991579759"},"language":"en","primary_location":{"id":"doi:10.1145/2462896.2462899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462896.2462899","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/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"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["University of Warsaw, Poland","University of Warsaw , Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"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"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["University of Warsaw, Poland","University of Warsaw , Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","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"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["University of Warsaw, Poland","University of Warsaw , Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083165224","display_name":"Jakub Onufry Wojtaszczyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jakub Onufry Wojtaszczyk","raw_affiliation_strings":["Google Inc., Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Inc., Warsaw, Poland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.4873,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.99118367,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"11"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926999807357788,"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.9811999797821045,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8746377229690552},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6790109872817993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6241123080253601},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6164944171905518},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.604618489742279},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5769491195678711},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5536742806434631},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5513668656349182},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5355612635612488},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5286898016929626},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.48680588603019714},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44435566663742065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3888595998287201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3586217164993286},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.34355399012565613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19110512733459473},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06645947694778442}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8746377229690552},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6790109872817993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6241123080253601},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6164944171905518},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.604618489742279},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5769491195678711},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5536742806434631},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5513668656349182},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5355612635612488},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5286898016929626},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.48680588603019714},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44435566663742065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3888595998287201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3586217164993286},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34355399012565613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19110512733459473},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06645947694778442},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2462896.2462899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462896.2462899","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7578443165","display_name":null,"funder_award_id":"N206 567140","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"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/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W87291490","https://openalex.org/W207095278","https://openalex.org/W1485150579","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1586475286","https://openalex.org/W1689320375","https://openalex.org/W1773420541","https://openalex.org/W2005309613","https://openalex.org/W2006933117","https://openalex.org/W2010004564","https://openalex.org/W2016590962","https://openalex.org/W2019583540","https://openalex.org/W2025304499","https://openalex.org/W2051627428","https://openalex.org/W2054396313","https://openalex.org/W2082223143","https://openalex.org/W2086937160","https://openalex.org/W2106959995","https://openalex.org/W2121641644","https://openalex.org/W2152809035","https://openalex.org/W2152986618","https://openalex.org/W2166563816","https://openalex.org/W2490706771","https://openalex.org/W2913688336","https://openalex.org/W3121437753"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4296116869","https://openalex.org/W4286853492","https://openalex.org/W3215145351","https://openalex.org/W1485007464"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,6,34,90],"concept":[3],"of":[4,12,55],"parameterizing":[5],"problem":[7,25,54],"above":[8,46,69],"the":[9,21,47,94],"optimum":[10],"solution":[11,95],"its":[13],"natural":[14],"linear":[15],"programming":[16],"relaxation":[17],"and":[18,72],"prove":[19,37],"that":[20,38],"node":[22,39,86],"multiway":[23,40,87],"cut":[24,41,88],"is":[26,42],"fixed-parameter":[27],"tractable":[28],"(FPT)":[29],"in":[30],"this":[31],"setting.":[32],"As":[33],"consequence":[35],"we":[36],"FPT,":[43],"when":[44],"parameterized":[45],"maximum":[48,70],"separating":[49],"cut,":[50],"resolving":[51],"an":[52,78],"open":[53],"Razgon.":[56],"Our":[57],"results":[58],"imply":[59],"O":[60,79],"*":[61,80],"(4":[62],"k":[63,82],")":[64,83],"algorithms":[65],"for":[66,85,100],"vertex":[67],"cover":[68],"matching":[71],"almost":[73],"2-SAT":[74],"as":[75,77],"well":[76],"(2":[81],"algorithm":[84],"with":[89],"standard":[91],"parameterization":[92],"by":[93],"size,":[96],"improving":[97],"previous":[98],"bounds":[99],"these":[101],"problems.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}