{"id":"https://openalex.org/W2493557058","doi":"https://doi.org/10.1145/2933057.2933109","title":"Distributed Algorithms for Planar Networks I","display_name":"Distributed Algorithms for Planar Networks I","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2493557058","doi":"https://doi.org/10.1145/2933057.2933109","mag":"2493557058"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933109","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.1676,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.88670009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"38"},"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.9984999895095825,"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.9984999895095825,"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.996999979019165,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9955000281333923,"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/planar","display_name":"Planar","score":0.7872467041015625},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7172554135322571},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7069858312606812},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.68504399061203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5948247909545898},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5866675972938538},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.58339923620224},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5532318949699402},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.488292932510376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.353132963180542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3445194959640503},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.34443461894989014},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28835007548332214},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.18895530700683594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0858805775642395},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08523795008659363}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7872467041015625},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7172554135322571},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7069858312606812},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.68504399061203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5948247909545898},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5866675972938538},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.58339923620224},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5532318949699402},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.488292932510376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.353132963180542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3445194959640503},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.34443461894989014},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28835007548332214},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18895530700683594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0858805775642395},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08523795008659363},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2933057.2933109","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"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/W10324078","https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1587504556","https://openalex.org/W1945440063","https://openalex.org/W1974912205","https://openalex.org/W1983097829","https://openalex.org/W1987374783","https://openalex.org/W2005900781","https://openalex.org/W2024491681","https://openalex.org/W2030825457","https://openalex.org/W2038643780","https://openalex.org/W2040011014","https://openalex.org/W2057792779","https://openalex.org/W2059074458","https://openalex.org/W2112702616","https://openalex.org/W2116055396","https://openalex.org/W2121655825","https://openalex.org/W2148686552","https://openalex.org/W2172178473","https://openalex.org/W2294674552","https://openalex.org/W2952482095"],"related_works":["https://openalex.org/W40653327","https://openalex.org/W4302177579","https://openalex.org/W1798304401","https://openalex.org/W2135993528","https://openalex.org/W2068376033","https://openalex.org/W2344116943","https://openalex.org/W4377371890","https://openalex.org/W2059371135","https://openalex.org/W4298328114","https://openalex.org/W3131549025"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,32,86,107,122],"first":[4,15],"(non-trivial)":[5],"distributed":[6,24,34],"planar":[7,27,54,64,78,96],"embedding":[8,65],"algorithm.":[9],"We":[10,29],"consider":[11],"this":[12,132],"a":[13,18,53,76,94,115],"crucial":[14],"step":[16],"in":[17,31,36,93],"broader":[19],"program":[20],"to":[21,45,74,114,131],"design":[22],"efficient":[23],"algorithms":[25],"for":[26],"networks.":[28],"work":[30],"standard":[33],"model":[35],"which":[37,80],"nodes":[38,58],"can":[39],"send":[40],"an":[41],"O(log":[42],"n)-bit":[43],"message":[44],"each":[46,83],"of":[47,82,89,100,111,126],"their":[48],"neighbors":[49],"per":[50],"round.":[51],"In":[52],"network,":[55],"with":[56],"n":[57,117],"and":[59,105],"diameter":[60],"D,":[61],"our":[62,101],"deterministic":[63],"algorithm":[66,102,120],"uses":[67],"O(D":[68],"dot":[69],"min{log":[70],"n,":[71],"D)":[72],"rounds":[73],"compute":[75],"combinatorial":[77],"embedding,":[79],"consists":[81],"node":[84],"knowing":[85],"clockwise":[87],"order":[88],"its":[90],"incident":[91],"edges":[92],"fixed":[95],"drawing.":[97],"The":[98],"complexity":[99,125],"is":[103],"near-optimal":[104],"matches":[106],"trivial":[108,123],"lower":[109],"bound":[110],"Omega(D)":[112],"up":[113],"log":[116],"factor.":[118],"No":[119],"outperforming":[121],"round":[124],"O(n)":[127],"was":[128],"known":[129],"prior":[130],"work.":[133]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}