{"id":"https://openalex.org/W2094724468","doi":"https://doi.org/10.1007/s004530010043","title":"Improved Algorithms for Dynamic Shortest Paths","display_name":"Improved Algorithms for Dynamic Shortest Paths","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2094724468","doi":"https://doi.org/10.1007/s004530010043","mag":"2094724468"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010043","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010043","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057625550","display_name":"Hristo Djidjev","orcid":"https://orcid.org/0000-0001-9286-8824"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"H. N. Djidjev","raw_affiliation_strings":["Department of Computer Science, University of Warwick,  Coventry CV4 7AL, England. hristo@dcs.warwick.ac.uk., , , , , , UK","Department of Computer Science, University of Warwick,  Coventry CV4 7AL, England. hristo@dcs.warwick.ac.uk., , UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick,  Coventry CV4 7AL, England. hristo@dcs.warwick.ac.uk., , , , , , UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, University of Warwick,  Coventry CV4 7AL, England. hristo@dcs.warwick.ac.uk., , UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001248687","display_name":"Grammati Pantziou","orcid":"https://orcid.org/0000-0002-7890-825X"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"G. E. Pantziou","raw_affiliation_strings":["Computer Technology Institute,  P.O. Box 1122, 26110 Patras, Greece. pantziou@cti.gr., , , , , , GR","Computer Technology Institute,  P.O. Box 1122, 26110 Patras, Greece. pantziou@cti.gr., , GR"],"affiliations":[{"raw_affiliation_string":"Computer Technology Institute,  P.O. Box 1122, 26110 Patras, Greece. pantziou@cti.gr., , , , , , GR","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute,  P.O. Box 1122, 26110 Patras, Greece. pantziou@cti.gr., , GR","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["DE","GB"],"is_corresponding":false,"raw_author_name":"C. D. Zaroliagis","raw_affiliation_strings":["Department of Computer Science, King's College, University of London, Strand, London WC2R 2LS, England. zaro@dcs.kcl.ac.uk., , , , , , UK","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College, University of London, Strand, London WC2R 2LS, England. zaro@dcs.kcl.ac.uk., , , , , , UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057625550"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.406,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8237944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"4","first_page":"367","last_page":"389"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9990000128746033,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/logarithm","display_name":"Logarithm","score":0.5985826253890991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.569984495639801},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5519956946372986},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.506316065788269},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.48059579730033875},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.465542197227478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46015220880508423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45904606580734253},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45073217153549194},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4444034695625305},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4337156116962433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3999876379966736},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.35335326194763184},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3488437533378601},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09056609869003296}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5985826253890991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.569984495639801},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5519956946372986},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.506316065788269},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.48059579730033875},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.465542197227478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46015220880508423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45904606580734253},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45073217153549194},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4444034695625305},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4337156116962433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3999876379966736},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.35335326194763184},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3488437533378601},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09056609869003296},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s004530010043","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010043","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.423.4896","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.4896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ceid.upatras.gr/faculty/zaro/pub/jou/J15-algo-dsp-10043.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.512","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.warwick.ac.uk/~hristo/papers/dyn-spp.ps.Z","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:518158","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518158","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.28, 367-389 (2000)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1330862","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-33C1-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W75167454","https://openalex.org/W205976932","https://openalex.org/W1545707055","https://openalex.org/W1552744309","https://openalex.org/W1555790150","https://openalex.org/W1575027696","https://openalex.org/W1594925095","https://openalex.org/W1595621389","https://openalex.org/W1655990431","https://openalex.org/W1859866712","https://openalex.org/W1876661458","https://openalex.org/W1967389135","https://openalex.org/W1971715758","https://openalex.org/W1974876810","https://openalex.org/W1980347321","https://openalex.org/W1989111470","https://openalex.org/W2006889851","https://openalex.org/W2009248757","https://openalex.org/W2009530930","https://openalex.org/W2018804864","https://openalex.org/W2019386850","https://openalex.org/W2027428596","https://openalex.org/W2030166143","https://openalex.org/W2046946959","https://openalex.org/W2063048655","https://openalex.org/W2065759448","https://openalex.org/W2070505654","https://openalex.org/W2071362870","https://openalex.org/W2077996575","https://openalex.org/W2084224084","https://openalex.org/W2092251403","https://openalex.org/W2112648314","https://openalex.org/W2116789243","https://openalex.org/W2120424341","https://openalex.org/W2120490947","https://openalex.org/W2131399793","https://openalex.org/W2762935521","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W2952185452","https://openalex.org/W2798106756","https://openalex.org/W2397288865","https://openalex.org/W2046736294","https://openalex.org/W2368524271","https://openalex.org/W2576709312","https://openalex.org/W2023657818","https://openalex.org/W2980815195","https://openalex.org/W2392797073","https://openalex.org/W4293584968"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}