{"id":"https://openalex.org/W2028558845","doi":"https://doi.org/10.1007/pl00009223","title":"A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs","display_name":"A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2028558845","doi":"https://doi.org/10.1007/pl00009223","mag":"2028558845"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009223","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009223","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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. N. Klein","raw_affiliation_strings":["Brown University, Providence, RI 02912, USA., , , , , , US","Brown University, Providence, RI 02912, USA, , US"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI 02912, USA., , , , , , US","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI 02912, USA, , US","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054397956","display_name":"Sairam Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Subramanian","raw_affiliation_strings":["Brown University, Providence, RI 02912, USA., , , , , , US","Brown University, Providence, RI 02912, USA, , US"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI 02912, USA., , , , , , US","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI 02912, USA, , US","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035567880"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5101,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.65073918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"235","last_page":"249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9988999962806702,"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.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6808539628982544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6696518063545227},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6178315281867981},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5841059684753418},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5520142912864685},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48900851607322693},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.474225252866745},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43731021881103516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4360312223434448},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.399901807308197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30392080545425415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21432358026504517}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6808539628982544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6696518063545227},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6178315281867981},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5841059684753418},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5520142912864685},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48900851607322693},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.474225252866745},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43731021881103516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4360312223434448},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.399901807308197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30392080545425415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21432358026504517},{"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":1,"locations":[{"id":"doi:10.1007/pl00009223","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009223","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":15,"referenced_works":["https://openalex.org/W205976932","https://openalex.org/W267514296","https://openalex.org/W1540680813","https://openalex.org/W1759483102","https://openalex.org/W1876661458","https://openalex.org/W1979750070","https://openalex.org/W1996194724","https://openalex.org/W2028750248","https://openalex.org/W2038643780","https://openalex.org/W2049413646","https://openalex.org/W2084224084","https://openalex.org/W2121473031","https://openalex.org/W2135674162","https://openalex.org/W2169528473","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W4250775169","https://openalex.org/W3118505512","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2906860838","https://openalex.org/W2136838521","https://openalex.org/W2070751425","https://openalex.org/W2023670982","https://openalex.org/W2963158951","https://openalex.org/W2236098968"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}