{"id":"https://openalex.org/W857168178","doi":"https://doi.org/10.1007/s00453-017-0319-z","title":"Edge Bipartization Faster than $$2^k$$ 2 k","display_name":"Edge Bipartization Faster than $$2^k$$ 2 k","publication_year":2017,"publication_date":"2017-05-12","ids":{"openalex":"https://openalex.org/W857168178","doi":"https://doi.org/10.1007/s00453-017-0319-z","mag":"857168178"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0319-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0319-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s00453-017-0319-z","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","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, Warsaw, Poland","University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054859737","display_name":"Marcin Wrochna","orcid":"https://orcid.org/0000-0001-9346-2172"},"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 Wrochna","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059330513"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.00039009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"81","issue":"3","first_page":"917","last_page":"966"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7248759865760803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6709399819374084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6151442527770996},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6128005981445312},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5461453199386597},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5397323966026306},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5233218669891357},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.49439358711242676},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4836917519569397},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.469966858625412},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4659035801887512},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39439502358436584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3507579565048218}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7248759865760803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6709399819374084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6151442527770996},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6128005981445312},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5461453199386597},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5397323966026306},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5233218669891357},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.49439358711242676},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4836917519569397},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.469966858625412},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4659035801887512},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39439502358436584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3507579565048218},{"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-017-0319-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0319-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-017-0319-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0319-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1468631800","display_name":null,"funder_award_id":"START","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G4531886340","display_name":null,"funder_award_id":"DEC-2013/11/D/ST6/03073","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1504925519","https://openalex.org/W1582963151","https://openalex.org/W1621031363","https://openalex.org/W1787126581","https://openalex.org/W1968952709","https://openalex.org/W1991579759","https://openalex.org/W1994556169","https://openalex.org/W2025304499","https://openalex.org/W2046999257","https://openalex.org/W2051856222","https://openalex.org/W2059273723","https://openalex.org/W2079919815","https://openalex.org/W2092029376","https://openalex.org/W2105680721","https://openalex.org/W2116087731","https://openalex.org/W2119741712","https://openalex.org/W2157295389","https://openalex.org/W2166115470","https://openalex.org/W2249739104","https://openalex.org/W2270571990","https://openalex.org/W2404960361","https://openalex.org/W2481137663","https://openalex.org/W2570081448","https://openalex.org/W2588078445","https://openalex.org/W2798588639","https://openalex.org/W2914414140","https://openalex.org/W2950298732","https://openalex.org/W2951007762","https://openalex.org/W2964082660","https://openalex.org/W3125756447","https://openalex.org/W4214877845","https://openalex.org/W4246970570"],"related_works":["https://openalex.org/W1986447712","https://openalex.org/W2110193191","https://openalex.org/W2492498253","https://openalex.org/W3135299686","https://openalex.org/W4206498635","https://openalex.org/W2951185106","https://openalex.org/W4299980042","https://openalex.org/W2951748403","https://openalex.org/W1604162242","https://openalex.org/W2007359222"],"abstract_inverted_index":{"In":[0],"the":[1,17,65,73,76,84,114,118,123,134,144,162,182],"Edge":[2,102],"Bipartization":[3,103],"problem":[4,47],"one":[5],"is":[6,19,57,113],"given":[7],"an":[8,13,43,62,99,177],"undirected":[9],"graph":[10,80],"G":[11,27],"and":[12,16,176],"integer":[14],"k,":[15],"question":[18],"whether":[20],"k":[21],"edges":[22],"can":[23],"be":[24],"deleted":[25],"from":[26],"so":[28],"that":[29,104],"it":[30],"becomes":[31],"bipartite.":[32],"Guo":[33,140],"et":[34,141],"al.":[35,142],"(J":[36],"Comput":[37],"Syst":[38],"Sci":[39],"72(8):1386\u20131396,":[40],"2006)":[41],"proposed":[42,146],"algorithm":[44,56,100,116],"solving":[45],"this":[46,55,91,130],"in":[48,72,83,106,161],"time":[49,107,120],"$$\\mathcal":[50,108],"{O}(2^k\\cdot":[51],"{m}^2)$$":[52],";":[53],"today,":[54],"a":[58,157,165,172],"textbook":[59],"example":[60],"of":[61,64,75,79,139,151,155,164,181],"application":[63],"iterative":[66,136],"compression":[67,137],"technique.":[68],"Despite":[69],"extensive":[70],"progress":[71],"understanding":[74],"parameterized":[77],"complexity":[78],"separation":[81],"problems":[82],"recent":[85],"years,":[86],"no":[87],"significant":[88],"improvement":[89],"upon":[90],"result":[92],"has":[93],"been":[94],"yet":[95],"reported.":[96],"We":[97],"present":[98],"for":[101],"works":[105],"{O}(1.977^k\\cdot":[109],"{nm})$$":[110],",":[111],"which":[112],"first":[115],"with":[117],"running":[119],"dependence":[121],"on":[122],"parameter":[124],"better":[125],"than":[126],"$$2^k$$":[127],".":[128],"To":[129],"end,":[131],"we":[132],"combine":[133],"general":[135],"strategy":[138],"(2006),":[143],"technique":[145],"by":[147],"Wahlstr\u00f6m":[148],"(in:":[149],"Proceedings":[150],"SODA\u201914,":[152],"SIAM,":[153],"2014)":[154],"using":[156],"polynomial-time":[158],"solvable":[159],"relaxation":[160],"form":[163],"Valued":[166],"Constraint":[167],"Satisfaction":[168],"Problem":[169],"to":[170],"guide":[171],"bounded-depth":[173],"branching":[174],"algorithm,":[175],"involved":[178],"Measure&Conquer":[179],"analysis":[180],"recursion":[183],"tree.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}