{"id":"https://openalex.org/W1591488944","doi":"https://doi.org/10.1007/3-540-44985-x_1","title":"Dynamic Graph Algorithms with Applications","display_name":"Dynamic Graph Algorithms with Applications","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1591488944","doi":"https://doi.org/10.1007/3-540-44985-x_1","mag":"1591488944"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44985-x_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44985-x_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["AT&T Labs-Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ, 07932"],"affiliations":[{"raw_affiliation_string":"AT&T Labs-Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ, 07932","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David R. Karger","raw_affiliation_strings":["MIT Laboratory for Computer Science, Cambridge, MA, 02138"],"affiliations":[{"raw_affiliation_string":"MIT Laboratory for Computer Science, Cambridge, MA, 02138","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8959,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.75708238,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9994999766349792,"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.9988999962806702,"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/computer-science","display_name":"Computer science","score":0.7134226560592651},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5663328766822815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5441029071807861},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.540631115436554},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4707741439342499},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4498922526836395},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.439857542514801},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.325142502784729},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29407697916030884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20042884349822998},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11955398321151733}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7134226560592651},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5663328766822815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5441029071807861},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.540631115436554},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4707741439342499},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4498922526836395},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.439857542514801},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.325142502784729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29407697916030884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20042884349822998},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11955398321151733},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44985-x_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44985-x_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1554407673","https://openalex.org/W1557418999","https://openalex.org/W1839839470","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1967160842","https://openalex.org/W1981519953","https://openalex.org/W1996575062","https://openalex.org/W2002272911","https://openalex.org/W2004317773","https://openalex.org/W2009695707","https://openalex.org/W2012287357","https://openalex.org/W2029706450","https://openalex.org/W2034841206","https://openalex.org/W2042706982","https://openalex.org/W2045430818","https://openalex.org/W2058336700","https://openalex.org/W2078109763","https://openalex.org/W2096655151","https://openalex.org/W2106371135","https://openalex.org/W2134422938","https://openalex.org/W2137498124","https://openalex.org/W2148841334","https://openalex.org/W2169528473","https://openalex.org/W2335389215","https://openalex.org/W3136367277","https://openalex.org/W4247278211"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}