{"id":"https://openalex.org/W3043093646","doi":"https://doi.org/10.1007/s00453-012-9714-7","title":"On the Complexity of Time-Dependent Shortest Paths","display_name":"On the Complexity of Time-Dependent Shortest Paths","publication_year":2012,"publication_date":"2012-11-17","ids":{"openalex":"https://openalex.org/W3043093646","doi":"https://doi.org/10.1007/s00453-012-9714-7","mag":"3043093646"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9714-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9714-7","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/A5073919193","display_name":"Luca Foschini","orcid":"https://orcid.org/0000-0001-9062-3647"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Luca Foschini","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038416046","display_name":"John Hershberger","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156212","display_name":"Mentor Technologies","ror":"https://ror.org/05vewsj04","country_code":"US","type":"other","lineage":["https://openalex.org/I4210156212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Hershberger","raw_affiliation_strings":["Mentor Graphics Corp, 8005 SW Boeckman Rd., Wilsonville, OR, 97070, USA"],"affiliations":[{"raw_affiliation_string":"Mentor Graphics Corp, 8005 SW Boeckman Rd., Wilsonville, OR, 97070, USA","institution_ids":["https://openalex.org/I4210156212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073919193"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.1752,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.94595533,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"68","issue":"4","first_page":"1075","last_page":"1097"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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.9987999796867371,"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/T11106","display_name":"Data Management and Algorithms","score":0.9972000122070312,"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/time-complexity","display_name":"Time complexity","score":0.6838346719741821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.680932879447937},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6025200486183167},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5238052606582642},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5132660865783691},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49730566143989563},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.49333658814430237},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47780925035476685},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4476001262664795},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43671587109565735},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.435238242149353},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.43166935443878174},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.4293856918811798},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20040926337242126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19029605388641357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18350744247436523}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6838346719741821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.680932879447937},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6025200486183167},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5238052606582642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5132660865783691},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49730566143989563},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.49333658814430237},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47780925035476685},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4476001262664795},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43671587109565735},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.435238242149353},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.43166935443878174},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.4293856918811798},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20040926337242126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19029605388641357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18350744247436523},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"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/s00453-012-9714-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9714-7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1554407673","https://openalex.org/W1604276976","https://openalex.org/W1788719447","https://openalex.org/W1816717522","https://openalex.org/W1964119857","https://openalex.org/W1969625919","https://openalex.org/W1980627447","https://openalex.org/W1987916269","https://openalex.org/W1988189387","https://openalex.org/W1989723858","https://openalex.org/W1998302192","https://openalex.org/W2053278287","https://openalex.org/W2058084873","https://openalex.org/W2081287319","https://openalex.org/W2086474457","https://openalex.org/W2089338760","https://openalex.org/W2106299112","https://openalex.org/W2108928028","https://openalex.org/W2109923933","https://openalex.org/W2111160151","https://openalex.org/W2116643655","https://openalex.org/W2122967662","https://openalex.org/W2129673493","https://openalex.org/W2130674086","https://openalex.org/W2144050074","https://openalex.org/W2146189710","https://openalex.org/W2149742236","https://openalex.org/W2166236009","https://openalex.org/W2189110458","https://openalex.org/W2911980744","https://openalex.org/W2946046356","https://openalex.org/W3105140593","https://openalex.org/W3145128584","https://openalex.org/W4235314854","https://openalex.org/W4249782589"],"related_works":["https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}