{"id":"https://openalex.org/W2044606924","doi":"https://doi.org/10.1016/s0304-3975(98)00042-5","title":"The complexity of shortest path and dilation bounded interval routing","display_name":"The complexity of shortest path and dilation bounded interval routing","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W2044606924","doi":"https://doi.org/10.1016/s0304-3975(98)00042-5","mag":"2044606924"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00042-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00042-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5056423330","display_name":"Rastislav Kr\u00e1\u013eovi\u010d","orcid":"https://orcid.org/0000-0003-1121-1009"},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Rastislav Kr\u00e1\u013eovi\u010d","raw_affiliation_strings":["Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","Comenius University, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]},{"raw_affiliation_string":"Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075069780","display_name":"Peter R\u016f\u017ei\u010dka","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]},{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Peter Ru\u017ei\u010dka","raw_affiliation_strings":["Institute of Informatics, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","Comenius University, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I4210152232","https://openalex.org/I74788687"]},{"raw_affiliation_string":"Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","Comenius University, Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]},{"raw_affiliation_string":"Comenius University, Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075069780"],"corresponding_institution_ids":["https://openalex.org/I4210152232","https://openalex.org/I74788687"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":2.6413,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.908557,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"234","issue":"1-2","first_page":"85","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6289960145950317},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5714880228042603},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5565940141677856},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5177537798881531},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5025479793548584},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.45560991764068604},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3924432396888733},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.346660315990448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32469111680984497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28890323638916016},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26793837547302246},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2425059676170349},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17547667026519775},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16954305768013}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6289960145950317},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5714880228042603},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5565940141677856},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5177537798881531},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5025479793548584},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.45560991764068604},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3924432396888733},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.346660315990448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32469111680984497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28890323638916016},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26793837547302246},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2425059676170349},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17547667026519775},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16954305768013}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(98)00042-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00042-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W42780094","https://openalex.org/W70118921","https://openalex.org/W1521744432","https://openalex.org/W1534598974","https://openalex.org/W1575592201","https://openalex.org/W1674997539","https://openalex.org/W1864067855","https://openalex.org/W1968698408","https://openalex.org/W1977304307","https://openalex.org/W2053759926","https://openalex.org/W2072694139","https://openalex.org/W2086178653","https://openalex.org/W2091569826","https://openalex.org/W2125856605","https://openalex.org/W2146257986","https://openalex.org/W2151358465","https://openalex.org/W2168022441","https://openalex.org/W2522694619","https://openalex.org/W2914484629","https://openalex.org/W4253132949","https://openalex.org/W4285719527","https://openalex.org/W6631172325","https://openalex.org/W6634366574","https://openalex.org/W6642198757","https://openalex.org/W6644601644","https://openalex.org/W6681875562"],"related_works":["https://openalex.org/W1492870390","https://openalex.org/W2149224531","https://openalex.org/W2160885658","https://openalex.org/W4247716783","https://openalex.org/W2098791961","https://openalex.org/W2483530712","https://openalex.org/W2144164383","https://openalex.org/W4230539218","https://openalex.org/W2137646787","https://openalex.org/W2154215043"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}