{"id":"https://openalex.org/W2937927637","doi":"https://doi.org/10.1137/140988553","title":"Minimum Bisection Is Fixed-Parameter Tractable","display_name":"Minimum Bisection Is Fixed-Parameter Tractable","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2937927637","doi":"https://doi.org/10.1137/140988553","mag":"2937927637"},"language":"en","primary_location":{"id":"doi:10.1137/140988553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140988553","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/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9281,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87149755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"48","issue":"2","first_page":"417","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9976000189781189,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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.7203010320663452},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6834848523139954},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6379953622817993},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6190175414085388},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6177250146865845},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.5882521867752075},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5846663117408752},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.491058349609375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4616242051124573},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4606803059577942},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.456299751996994},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.45024868845939636},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4430852234363556},{"id":"https://openalex.org/keywords/decomposition-theorem","display_name":"Decomposition theorem","score":0.4290658235549927},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4205961227416992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23928549885749817}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7203010320663452},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6834848523139954},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6379953622817993},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6190175414085388},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6177250146865845},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.5882521867752075},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5846663117408752},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.491058349609375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4616242051124573},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4606803059577942},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.456299751996994},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.45024868845939636},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4430852234363556},{"id":"https://openalex.org/C2779182943","wikidata":"https://www.wikidata.org/wiki/Q25345219","display_name":"Decomposition theorem","level":2,"score":0.4290658235549927},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4205961227416992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23928549885749817},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140988553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140988553","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":[{"id":"https://openalex.org/G216536116","display_name":null,"funder_award_id":"UMO-2013/09/B/ST6/03136","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G6038047093","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G6960645039","display_name":null,"funder_award_id":"715744","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1978447499","https://openalex.org/W1981591809","https://openalex.org/W1996575062","https://openalex.org/W2005079828","https://openalex.org/W2023039219","https://openalex.org/W2031579107","https://openalex.org/W2032278054","https://openalex.org/W2037713618","https://openalex.org/W2060785476","https://openalex.org/W2069572927","https://openalex.org/W2086937160","https://openalex.org/W2088647669","https://openalex.org/W2121641644","https://openalex.org/W2126641717","https://openalex.org/W2129027842","https://openalex.org/W2296148711","https://openalex.org/W2471129545","https://openalex.org/W2619061098","https://openalex.org/W2911740249"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W3112697985","https://openalex.org/W41290553","https://openalex.org/W2585516632","https://openalex.org/W1986919722","https://openalex.org/W2093663313","https://openalex.org/W40332083","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W2546248295"],"abstract_inverted_index":{"In":[0,59],"the":[1,55,77,90,121,141,147],"classic":[2],"Minimum":[3,67,84],"Bisection":[4,68,85],"problem":[5],"we":[6,62,151],"are":[7,44],"given":[8],"as":[9],"input":[10],"an":[11,16,64],"undirected":[12],"graph":[13,104],"$G$":[14,105],"and":[15,35,42,54],"integer":[17],"$k$.":[18,88],"The":[19],"task":[20],"is":[21,26,76,117],"to":[22,146],"determine":[23],"whether":[24],"there":[25,43],"a":[27,96,132,153],"partition":[28],"of":[29,92,126,135,140,155],"$V(G)$":[30],"into":[31,112],"two":[32],"parts":[33,113],"$A$":[34,53],"$B$":[36],"such":[37],"that":[38,100,102,160],"$||A|-|B||":[39],"\\leq":[40],"1$":[41],"at":[45,162],"most":[46,163],"$k$":[47,164],"edges":[48],"with":[49,69],"one":[50],"endpoint":[51],"in":[52,57,120],"other":[56],"$B$.":[58],"this":[60],"paper":[61],"give":[63],"algorithm":[65,82,94],"for":[66,83],"running":[70],"time":[71],"$2^{\\mathcal{O}(k^3)}n^3":[72],"\\log^3":[73],"n$.":[74],"This":[75],"first":[78],"fixed":[79],"parameter":[80],"tractable":[81],"parameterized":[86],"by":[87,109],"At":[89],"core":[91],"our":[93],"lies":[95],"new":[97],"decomposition":[98],"theorem":[99],"states":[101],"every":[103],"can":[106,129],"be":[107],"decomposed":[108],"small":[110],"separators":[111],"where":[114,150],"each":[115,138],"part":[116,139],"\u201chighly":[118],"connected\u201d":[119],"following":[122],"sense:":[123],"any":[124],"separator":[125],"bounded":[127],"size":[128],"separate":[130],"only":[131],"limited":[133],"number":[134],"vertices":[136],"from":[137],"decomposition.":[142],"Our":[143],"techniques":[144],"generalize":[145],"weighted":[148],"setting,":[149],"seek":[152],"bisection":[154],"minimum":[156],"weight":[157],"among":[158],"solutions":[159],"contain":[161],"edges.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}