{"id":"https://openalex.org/W1876661458","doi":"https://doi.org/10.1007/3-540-54233-7_145","title":"Computing shortest paths and distances in planar graphs","display_name":"Computing shortest paths and distances in planar graphs","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1876661458","doi":"https://doi.org/10.1007/3-540-54233-7_145","mag":"1876661458"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-54233-7_145","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54233-7_145","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":"conference-paper","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/I24768866","display_name":"Bulgarian Academy of Sciences","ror":"https://ror.org/01x8hew03","country_code":"BG","type":"government","lineage":["https://openalex.org/I24768866"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Hristo N. Djidjev","raw_affiliation_strings":["Center of Informatics and Computer Technology, Bulgarian Academy of Sciences, Acad. G. Bonchev str. bl. 25-A, 1113, Sofia, Bulgaria","#TAB#Bulgarian Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Informatics and Computer Technology, Bulgarian Academy of Sciences, Acad. G. Bonchev str. bl. 25-A, 1113, Sofia, Bulgaria","institution_ids":["https://openalex.org/I24768866"]},{"raw_affiliation_string":"#TAB#Bulgarian Academy of Sciences","institution_ids":["https://openalex.org/I24768866"]}]},{"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":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Grammati E. Pantziou","raw_affiliation_strings":["Computer Sc and Eng Dept, University of Patras, Greece","Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","Computer Technology Institute","University of Patras"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Sc and Eng Dept, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"University of Patras","institution_ids":["https://openalex.org/I174878644"]}]},{"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/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos D. Zaroliagis","raw_affiliation_strings":["Computer Sc and Eng Dept, University of Patras, Greece","Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","Computer Technology Institute","University of Patras"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Sc and Eng Dept, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"University of Patras","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"327","last_page":"338"},"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.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7693959474563599},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6090582609176636},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6040091514587402},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5467877984046936},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5285913944244385},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.461503803730011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44262567162513733},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4383796751499176},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.41819214820861816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40477442741394043},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39764004945755005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39193060994148254}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7693959474563599},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6090582609176636},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6040091514587402},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5467877984046936},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5285913944244385},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.461503803730011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44262567162513733},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4383796751499176},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.41819214820861816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40477442741394043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39764004945755005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39193060994148254},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/3-540-54233-7_145","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54233-7_145","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":22,"referenced_works":["https://openalex.org/W103797413","https://openalex.org/W1511174345","https://openalex.org/W1525397299","https://openalex.org/W1550098107","https://openalex.org/W1594925095","https://openalex.org/W1608198357","https://openalex.org/W1766349993","https://openalex.org/W1876661458","https://openalex.org/W1989111470","https://openalex.org/W1995040285","https://openalex.org/W2023941025","https://openalex.org/W2040444410","https://openalex.org/W2046946959","https://openalex.org/W2060435478","https://openalex.org/W2063048655","https://openalex.org/W2065759448","https://openalex.org/W2084224084","https://openalex.org/W2120424341","https://openalex.org/W2144970024","https://openalex.org/W2752853835","https://openalex.org/W4247322843","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W2921632378","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W2046896701","https://openalex.org/W1996632063","https://openalex.org/W4286247391","https://openalex.org/W2023670982","https://openalex.org/W2236098968"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}