{"id":"https://openalex.org/W2115271283","doi":"https://doi.org/10.1007/978-3-540-27810-8_33","title":"Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles","display_name":"Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2115271283","doi":"https://doi.org/10.1007/978-3-540-27810-8_33","mag":"2115271283"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27810-8_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_33","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\u2013Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ, 07932, USA","AT&T Labs\u2013Research, Shannon Laboratory"],"affiliations":[{"raw_affiliation_string":"AT&T Labs\u2013Research, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ, 07932, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs\u2013Research, Shannon Laboratory","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":2.7671,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.91073512,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"384","last_page":"396"},"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.9998999834060669,"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.9998999834060669,"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/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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7322127819061279},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6579737663269043},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5899108648300171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5147057175636292},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5105077028274536},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.48395493626594543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4523221254348755},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.4307461380958557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40959736704826355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3609370291233063},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.34268152713775635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31263309717178345}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7322127819061279},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6579737663269043},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5899108648300171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5147057175636292},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5105077028274536},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.48395493626594543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4523221254348755},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4307461380958557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40959736704826355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3609370291233063},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.34268152713775635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31263309717178345},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-27810-8_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_33","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":13,"referenced_works":["https://openalex.org/W1547799421","https://openalex.org/W1554407673","https://openalex.org/W1589421353","https://openalex.org/W1601919219","https://openalex.org/W1968023964","https://openalex.org/W1982440947","https://openalex.org/W1983179262","https://openalex.org/W2029132631","https://openalex.org/W2058084873","https://openalex.org/W2084224084","https://openalex.org/W2169528473","https://openalex.org/W3198470706","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W1874815355","https://openalex.org/W4229844547","https://openalex.org/W4243828764","https://openalex.org/W4254523142","https://openalex.org/W2391392917","https://openalex.org/W2065411828","https://openalex.org/W3092127654","https://openalex.org/W2068799282"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}