{"id":"https://openalex.org/W2266371753","doi":"https://doi.org/10.1007/pl00009228","title":"Lower Bounds for Fully Dynamic Connectivity Problems in Graphs","display_name":"Lower Bounds for Fully Dynamic Connectivity Problems in Graphs","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2266371753","doi":"https://doi.org/10.1007/pl00009228","mag":"2266371753"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009228","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009228","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":null,"license_id":null,"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":"green","oa_url":"http://infoscience.epfl.ch/record/99349","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Henzinger","raw_affiliation_strings":["Systems Research Center, Digital Equipment Corporation,  130 Lytoon Ave, Palo Alto, CA 94301, USA., , , , , , US"],"affiliations":[{"raw_affiliation_string":"Systems Research Center, Digital Equipment Corporation,  130 Lytoon Ave, Palo Alto, CA 94301, USA., , , , , , US","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072449512","display_name":"Michael L. Fredman","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. L. Fredman","raw_affiliation_strings":["Department of Computer Science,  Rutgers University, New Brunswick, NJ 08903, USA., , , , , , US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  Rutgers University, New Brunswick, NJ 08903, USA., , , , , , US","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003641345"],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.1212,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.97025695,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"3","first_page":"351","last_page":"362"},"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.9991999864578247,"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.9991999864578247,"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.998199999332428,"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.9959999918937683,"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.8259179592132568},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6844335794448853},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6423544883728027},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6279692649841309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6257448196411133},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.608916163444519},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5910698771476746},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.4804894030094147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4184283912181854},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41378965973854065},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40536966919898987},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3192826211452484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21651163697242737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15956982970237732},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0675535798072815}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8259179592132568},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6844335794448853},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6423544883728027},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6279692649841309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6257448196411133},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.608916163444519},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5910698771476746},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.4804894030094147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4184283912181854},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41378965973854065},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40536966919898987},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3192826211452484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21651163697242737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15956982970237732},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0675535798072815},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/pl00009228","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009228","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.9799","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.digital.com/SRC/personal/monika/papers/monika-algorithmica.ps.gz","raw_type":"text"},{"id":"pmh:oai:ecommons.cornell.edu:1813/7180","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/7180","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"},{"id":"pmh:oai:infoscience.tind.io:99349","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/99349","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/99349","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:99349","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/99349","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/99349","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W144796997","https://openalex.org/W1519444547","https://openalex.org/W1550834367","https://openalex.org/W1572092079","https://openalex.org/W1774549437","https://openalex.org/W1967459785","https://openalex.org/W1993022201","https://openalex.org/W2007918837","https://openalex.org/W2010255818","https://openalex.org/W2022827580","https://openalex.org/W2042584910","https://openalex.org/W2069731308","https://openalex.org/W2078423836","https://openalex.org/W2089620427","https://openalex.org/W2094632707","https://openalex.org/W2102347446","https://openalex.org/W2114111808","https://openalex.org/W2127605247","https://openalex.org/W2340365916"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W2065411828","https://openalex.org/W3092127654","https://openalex.org/W1482484961","https://openalex.org/W4246145339","https://openalex.org/W2076407808","https://openalex.org/W2006811735","https://openalex.org/W2018777660","https://openalex.org/W2163978343"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}