{"id":"https://openalex.org/W2589084166","doi":"https://doi.org/10.1109/focs.2017.93","title":"Fast and Compact Exact Distance Oracle for Planar Graphs","display_name":"Fast and Compact Exact Distance Oracle for Planar Graphs","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2589084166","doi":"https://doi.org/10.1109/focs.2017.93","mag":"2589084166"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2017.93","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2017.93","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"preprint","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/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["University of Copenhagen","University of Copenhagen = K\u00f8benhavns Universitet"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen = K\u00f8benhavns Universitet","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043525193","display_name":"S\u00f8ren Dahlgaard","orcid":"https://orcid.org/0000-0003-2925-746X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Soren Dahlgaard","raw_affiliation_strings":["University of Copenhagen","University of Copenhagen = K\u00f8benhavns Universitet"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen = K\u00f8benhavns Universitet","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["University of Copenhagen","University of Copenhagen = K\u00f8benhavns Universitet"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen = K\u00f8benhavns Universitet","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":2.95926676,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8907777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"962","last_page":"973"},"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.9998999834060669,"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.9998999834060669,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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.662803053855896},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6322158575057983},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5810535550117493},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.4796103239059448},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4378720819950104},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4263598322868347},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4241613447666168},{"id":"https://openalex.org/keywords/random-oracle","display_name":"Random oracle","score":0.4231586456298828},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38995301723480225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37181174755096436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3611053228378296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3555060625076294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26433223485946655},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.07444515824317932}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.662803053855896},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6322158575057983},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5810535550117493},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.4796103239059448},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4378720819950104},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4263598322868347},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4241613447666168},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.4231586456298828},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38995301723480225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37181174755096436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3611053228378296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3555060625076294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26433223485946655},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.07444515824317932},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/focs.2017.93","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2017.93","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02169530v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02169530","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/fdccdccd-9081-465a-8ef4-007e4c6c6468","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/fast-and-compact-exact-distance-oracle-for-planar-grap(fdccdccd-9081-465a-8ef4-007e4c6c6468).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cohen-Addad , V P , Dahlgaard , S & Wulff-Nilsen , C 2017 , Fast and Compact Exact Distance Oracle for Planar Grap . in 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS) . IEEE , pp. 962-973 , 58th Annual IEEE Symposium on Foundations of Computer Science , Berkeley , California , United States , 15/10/2017 . https://doi.org/10.1109/FOCS.2017.93","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/fdccdccd-9081-465a-8ef4-007e4c6c6468","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/fdccdccd-9081-465a-8ef4-007e4c6c6468","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cohen-Addad , V P , Dahlgaard , S & Wulff-Nilsen , C 2017 , Fast and Compact Exact Distance Oracle for Planar Grap . in 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS) . IEEE , pp. 962-973 , 58th Annual IEEE Symposium on Foundations of Computer Science , Berkeley , California , United States , 15/10/2017 . https://doi.org/10.1109/FOCS.2017.93","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W75083785","https://openalex.org/W1481010420","https://openalex.org/W1503190306","https://openalex.org/W1551891681","https://openalex.org/W1555790150","https://openalex.org/W1575027696","https://openalex.org/W1623319572","https://openalex.org/W1792146362","https://openalex.org/W1985248597","https://openalex.org/W2003457914","https://openalex.org/W2015545367","https://openalex.org/W2044124294","https://openalex.org/W2045446569","https://openalex.org/W2078443814","https://openalex.org/W2091208704","https://openalex.org/W2096304547","https://openalex.org/W2103099082","https://openalex.org/W2120424341","https://openalex.org/W2166242192","https://openalex.org/W2231838532","https://openalex.org/W2278003675","https://openalex.org/W2284505917","https://openalex.org/W2570172216","https://openalex.org/W2762935521","https://openalex.org/W2768149714","https://openalex.org/W2950552904","https://openalex.org/W2951814478","https://openalex.org/W2952050889","https://openalex.org/W2952702960","https://openalex.org/W2963123599","https://openalex.org/W2964055350","https://openalex.org/W3101337733","https://openalex.org/W3139290474","https://openalex.org/W4210881201","https://openalex.org/W4234715723","https://openalex.org/W4239159750","https://openalex.org/W4293415950","https://openalex.org/W6633299274","https://openalex.org/W6651059365","https://openalex.org/W6669884786","https://openalex.org/W6694702536"],"related_works":["https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2119149496","https://openalex.org/W2055693471","https://openalex.org/W4295101776","https://openalex.org/W2139858675","https://openalex.org/W2952580779","https://openalex.org/W1537327044","https://openalex.org/W123129858","https://openalex.org/W4241588278"],"abstract_inverted_index":{"<br/><br/>":[0]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-02-07T08:09:18.108334","created_date":"2025-10-10T00:00:00"}