{"id":"https://openalex.org/W1516511690","doi":"https://doi.org/10.1007/3-540-59042-0_73","title":"On-line and dynamic algorithms for shortest path problems","display_name":"On-line and dynamic algorithms for shortest path problems","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1516511690","doi":"https://doi.org/10.1007/3-540-59042-0_73","mag":"1516511690"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-59042-0_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-59042-0_73","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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/scopus1990/1744","any_repository_has_fulltext":true},"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/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/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Hristo N. Djidjev","raw_affiliation_strings":["Computer Science Dept, Rice University, P.O. Box 1892, 77251, Houston, TX, USA","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept, Rice University, P.O. Box 1892, 77251, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"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/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grammati E. Pantziou","raw_affiliation_strings":["Computer Science Dept, University of Central Florida, 82816, Orlando, FL, USA","UNIVERSITY OF CENTRAL FLORIDA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept, University of Central Florida, 82816, Orlando, FL, USA","institution_ids":["https://openalex.org/I106165777"]},{"raw_affiliation_string":"UNIVERSITY OF CENTRAL FLORIDA","institution_ids":["https://openalex.org/I106165777"]}]},{"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/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"]},{"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christos D. Zaroliagis","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, 66123, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Im Stadtwald, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057625550"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I74775410"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.298,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78482068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9620000123977661,"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/T11106","display_name":"Data Management and Algorithms","score":0.9602000117301941,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.785361647605896},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7440672516822815},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6902801990509033},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6726018190383911},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6338054537773132},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5622788667678833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5619276762008667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5527704954147339},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4571956396102905},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4531136751174927},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4521810710430145},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43465086817741394},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.43357646465301514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38406872749328613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3798747658729553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36564138531684875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2610204815864563},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2514548897743225}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.785361647605896},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7440672516822815},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6902801990509033},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6726018190383911},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6338054537773132},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5622788667678833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5619276762008667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5527704954147339},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4571956396102905},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4531136751174927},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4521810710430145},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43465086817741394},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43357646465301514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38406872749328613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3798747658729553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36564138531684875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2610204815864563},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2514548897743225},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/3-540-59042-0_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-59042-0_73","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"},{"id":"pmh:oai:stars.library.ucf.edu:scopus1990-2743","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus1990/1744","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 1990s","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.423.5552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.5552","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/conf/C12-stacs95.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:517749","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517749","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":"Mayr, Ernst W.; Puech, Claude: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Springer, 193-204 (1995)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1331853","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-ACA3-4","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":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1834242","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-B514-E","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Report / Max-Planck-Institut f\u00fcr Informatik","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:1516511690","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1331853","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:scopus1990-2743","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus1990/1744","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 1990s","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W75167454","https://openalex.org/W1541820931","https://openalex.org/W1594925095","https://openalex.org/W1595621389","https://openalex.org/W1859866712","https://openalex.org/W1876661458","https://openalex.org/W1967389135","https://openalex.org/W1971715758","https://openalex.org/W1978136862","https://openalex.org/W1979750070","https://openalex.org/W1989111470","https://openalex.org/W2013148843","https://openalex.org/W2018804864","https://openalex.org/W2019386850","https://openalex.org/W2023941025","https://openalex.org/W2030166143","https://openalex.org/W2063048655","https://openalex.org/W2065759448","https://openalex.org/W2067533448","https://openalex.org/W2070505654","https://openalex.org/W2084224084","https://openalex.org/W2095282679","https://openalex.org/W2105114849","https://openalex.org/W2112648314","https://openalex.org/W2120424341","https://openalex.org/W2127605247","https://openalex.org/W2131399793","https://openalex.org/W2160098350","https://openalex.org/W4249165371","https://openalex.org/W6608375579"],"related_works":["https://openalex.org/W1859866712","https://openalex.org/W114559324","https://openalex.org/W2112964526","https://openalex.org/W1968023964","https://openalex.org/W2124284012","https://openalex.org/W3087919015","https://openalex.org/W1604909471","https://openalex.org/W2567197845","https://openalex.org/W2172035912","https://openalex.org/W2793079","https://openalex.org/W2514270956","https://openalex.org/W2323352958","https://openalex.org/W2175109984","https://openalex.org/W2498905349","https://openalex.org/W2574671299","https://openalex.org/W2234917253","https://openalex.org/W39773528","https://openalex.org/W2465832610","https://openalex.org/W2122463055","https://openalex.org/W2087932760"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}