{"id":"https://openalex.org/W4411319134","doi":"https://doi.org/10.1145/3717823.3718270","title":"Fully Dynamic Biconnectivity in \u00d5(log\u00b2 n) Time","display_name":"Fully Dynamic Biconnectivity in \u00d5(log\u00b2 n) Time","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319134","doi":"https://doi.org/10.1145/3717823.3718270"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/ws/files/522935873/Fully_Dynamic.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025874799","display_name":"Jacob Holm","orcid":"https://orcid.org/0000-0001-6997-9251"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jacob Holm","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6997-9251","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053382520","display_name":"Wojciech Nadara","orcid":"https://orcid.org/0000-0001-8371-425X"},"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/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK","PL"],"is_corresponding":false,"raw_author_name":"Wojciech Nadara","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark","University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-8371-425X","affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004695759","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Eva Rotenberg","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5853-7909","affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103284596","display_name":"Marek Soko\u0142owski","orcid":"https://orcid.org/0000-0001-8309-0141"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Soko\u0142owski","raw_affiliation_strings":["Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8309-0141","affiliations":[{"raw_affiliation_string":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9719,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81705732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.5836588144302368}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5836588144302368}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718270","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/3dbfcc92-b1d5-4bfc-a628-60c787293c59","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/3dbfcc92-b1d5-4bfc-a628-60c787293c59","pdf_url":"https://curis.ku.dk/ws/files/522935873/Fully_Dynamic.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Holm , J , Nadara , W , Rotenberg , E & Soko\u0142owski , M 2025 , Fully Dynamic Biconnectivity in \u00d5(log 2 n) Time . in M Koucky & N Bansal (eds) , STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery , pp. 156-165 , 57th Annual ACM Symposium on Theory of Computing, STOC 2025 , Prague , Czech Republic , 23/06/2025 . https://doi.org/10.1145/3717823.3718270","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/3dbfcc92-b1d5-4bfc-a628-60c787293c59","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/3dbfcc92-b1d5-4bfc-a628-60c787293c59","pdf_url":"https://curis.ku.dk/ws/files/522935873/Fully_Dynamic.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Holm , J , Nadara , W , Rotenberg , E & Soko\u0142owski , M 2025 , Fully Dynamic Biconnectivity in \u00d5(log 2 n) Time . in M Koucky & N Bansal (eds) , STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery , pp. 156-165 , 57th Annual ACM Symposium on Theory of Computing, STOC 2025 , Prague , Czech Republic , 23/06/2025 . https://doi.org/10.1145/3717823.3718270","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323873","display_name":"Uniwersytet Warszawski","ror":"https://ror.org/039bjqg32"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411319134.pdf","grobid_xml":"https://content.openalex.org/works/W4411319134.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1572092079","https://openalex.org/W1963524245","https://openalex.org/W1964669678","https://openalex.org/W1978270311","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W1997906261","https://openalex.org/W2009695707","https://openalex.org/W2010151376","https://openalex.org/W2010255818","https://openalex.org/W2023970268","https://openalex.org/W2030509174","https://openalex.org/W2040751723","https://openalex.org/W2045430818","https://openalex.org/W2046792522","https://openalex.org/W2048356005","https://openalex.org/W2069731308","https://openalex.org/W2095282679","https://openalex.org/W2104224360","https://openalex.org/W2116633957","https://openalex.org/W2121473031","https://openalex.org/W2127605247","https://openalex.org/W2142255724","https://openalex.org/W2148841334","https://openalex.org/W2529797681","https://openalex.org/W2777026024","https://openalex.org/W3000876286","https://openalex.org/W3128057791","https://openalex.org/W3136977603","https://openalex.org/W4367677276","https://openalex.org/W4400090660","https://openalex.org/W4412206532","https://openalex.org/W4415063897"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0,142],"present":[1],"a":[2,14,40,53,149,201,207,219,225,236,269],"deterministic":[3,99],"fully-dynamic":[4],"data":[5,26,133,159,237,245,275,287],"structure":[6,27,134,160,238,246],"for":[7,98,112,170,351],"maintaining":[8],"information":[9],"about":[10],"the":[11,17,23,57,95,129,154,167,195,232,292,331,348,358,375],"cut-vertices":[12],"in":[13,56,71,231,243,284],"graph;":[15],"i.e.":[16],"vertices":[18,44],"whose":[19],"removal":[20],"would":[21],"disconnect":[22],"graph.":[24],"Our":[25,204],"supports":[28],"insertion":[29],"and":[30,55,79,139,242],"deletion":[31],"of":[32,42,118,151,174,190,217,264,280,327,362,377],"edges,":[33],"as":[34,36,200,218],"well":[35],"queries":[37,80],"to":[38,63,103,186,251,304,320],"whether":[39],"pair":[41],"connected":[43],"are":[45,69],"either":[46],"biconnected,":[47],"or":[48],"can":[49,214,294],"be":[50,215,279],"separated":[51],"by":[52,124,135,148],"cutvertex,":[54],"latter":[58],"case":[59],"we":[60,163,198,234,247,289,356],"support":[61],"access":[62],"separating":[64],"cutvertices.":[65],"All":[66],"update":[67,116,188,360],"operations":[68],"supported":[70],"amortized":[72],"O(log<sup>2</sup>":[73,363],"n":[74,84,106,120,364],"log<sup>2</sup>":[75,85,365],"log":[76,86,104,105,121,122,316,366],"n)":[77,87,123,132,197,255,261],"time,":[78],"take":[81],"worst-case":[82],"O(log":[83],"time.":[88,322],"Note":[89],"that":[90,291,299,335],"these":[91,180,265,344],"time":[92,117,147,173,189,371],"bounds":[93],"match":[94],"current":[96],"best":[97,110],"dynamic":[100],"connectivity":[101,176,353],"up":[102],"factors.":[107],"The":[108,368],"previous":[109],"algorithm":[111],"biconnectivity":[113],"had":[114],"an":[115,187,253,310,314,337],"O(log\u03bb":[119,130],"Thorup":[125,140],"[STOC'00],":[126],"based":[127],"on":[128,224,309],"\u03bc":[131],"Holm,":[136],"de":[137],"Lichtenberg,":[138],"[STOC'98].":[141],"obtain":[143,357],"our":[144],"improved":[145],"running":[146,172],"series":[150],"reductions":[152],"from":[153,340,374],"original":[155],"problem":[156],"into":[157],"well-defined":[158],"problems.":[161],"While":[162],"do":[164,183],"indeed":[165],"apply":[166,248],"well-known":[168,349],"techniques":[169,181,267,350],"improving":[171,313],"two-edge":[175,352],"[STOC'00,":[177,354],"SODA'18],":[178,355],"surprisingly,":[179],"alone":[182,194],"not":[184],"lead":[185],"\u00d5(log\u00b3":[191],"n),":[192],"let":[193],"\u00d5(log<sup>2</sup>":[196],"give":[199],"final":[202],"result.":[203],"contributions":[205,346],"include":[206],"formally":[208],"defined":[209],"transient":[210,332,378],"expose":[211,222,333],"operation,":[212],"which":[213,277],"thought":[216],"cheaper":[220],"read-only":[221],"operation":[223,318,334],"top":[226],"tree.":[227],"For":[228],"each":[229],"vertex":[230,293],"graph,":[233],"maintain":[235],"over":[239],"its":[240,305],"neighbors,":[241],"this":[244,285,325],"biasing":[249,266],"(twice)":[250],"save":[252],"\u00d5(log":[254,260,338],"factor":[256],"(twice,":[257],"so":[258],"two":[259,296,307],"factors).":[262],"One":[263],"is":[268,324],"new,":[270],"simple":[271],"biased":[272],"disjoint":[273],"sets":[274],"structure,":[276,288],"may":[278],"independent":[281],"interest.":[282],"Moreover,":[283],"neighborhood":[286],"facilitate":[290],"select":[295],"VIP":[297,328],"neighbors":[298,308,329],"get":[300],"special":[301],"treatment,":[302],"corresponding":[303],"potentially":[306],"exposed":[311],"path,":[312],"otherwise":[315],"n-time":[317],"down":[319],"constant":[321],"It":[323],"combination":[326],"with":[330,347],"saves":[336],"n)-factor":[339],"another":[341],"bottleneck.":[342],"Combining":[343],"technical":[345],"desired":[359],"times":[361],"n).":[367],"near-linear":[369],"query":[370],"follows":[372],"directly":[373],"usage":[376],"expose.":[379]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}