{"id":"https://openalex.org/W2989015329","doi":"https://doi.org/10.1145/3357713.3384249","title":"Fully-dynamic planarity testing in polylogarithmic time","display_name":"Fully-dynamic planarity testing in polylogarithmic time","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W2989015329","doi":"https://doi.org/10.1145/3357713.3384249","mag":"2989015329"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.03449","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025874799","display_name":"Jacob Holm","orcid":"https://orcid.org/0000-0001-6997-9251"},"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":"Jacob Holm","raw_affiliation_strings":["University of Copenhagen, Denmark","University of Copenhagen"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695759","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Eva Rotenberg","raw_affiliation_strings":["DTU, Denmark","Technical University of Denmark"],"affiliations":[{"raw_affiliation_string":"DTU, Denmark","institution_ids":[]},{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025874799"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00821537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"167","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9980000257492065,"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.9925000071525574,"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/combinatorics","display_name":"Combinatorics","score":0.7106163501739502},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.6971926689147949},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6507835388183594},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.5577062964439392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5422608852386475},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5267837643623352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4649793803691864},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.45472991466522217},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4298829734325409},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.4211091101169586},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4171476662158966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38937464356422424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3264870047569275},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.25240910053253174},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24404633045196533},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.19160977005958557},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06363129615783691}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7106163501739502},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.6971926689147949},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6507835388183594},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.5577062964439392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5422608852386475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5267837643623352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4649793803691864},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.45472991466522217},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4298829734325409},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.4211091101169586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4171476662158966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38937464356422424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3264870047569275},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.25240910053253174},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24404633045196533},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.19160977005958557},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06363129615783691},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3357713.3384249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1911.03449","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.03449","pdf_url":"https://arxiv.org/pdf/1911.03449","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2989015329","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1911.03449","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8c747694-c370-4f2f-843c-42410486eaed","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/8c747694-c370-4f2f-843c-42410486eaed","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Holm , J & Rotenberg , E 2020 , Fully-dynamic planarity testing in polylogarithmic time . in K Makarychev , Y Makarychev , M Tulsiani , G Kamath & J Chuzhoy (eds) , STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery , pp. 167-180 , 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020 , Chicago , United States , 22/06/2020 . https://doi.org/10.1145/3357713.3384249","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/3ec2ea61-bde9-47f8-b53f-70aad0726520","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/3ec2ea61-bde9-47f8-b53f-70aad0726520","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Holm , J & Rotenberg , E 2020 , Fully-dynamic planarity testing in polylogarithmic time . in K Makarychev , Y Makarychev , M Tulsiani , G Kamath & J Chuzhoy (eds) , Proceedings of the 52 nd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery , pp. 167-180 , 52nd Annual ACM SIGACT Symposium on Theory of Computing , Chicago , Illinois , United States , 22/06/2020 . https://doi.org/10.1145/3357713.3384249","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.1911.03449","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1911.03449","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.03449","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.03449","pdf_url":"https://arxiv.org/pdf/1911.03449","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2989015329.pdf","grobid_xml":"https://content.openalex.org/works/W2989015329.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1482534225","https://openalex.org/W1524840666","https://openalex.org/W1550834367","https://openalex.org/W1552413686","https://openalex.org/W1964669678","https://openalex.org/W1974936141","https://openalex.org/W1987374783","https://openalex.org/W1994556169","https://openalex.org/W2013148843","https://openalex.org/W2018804864","https://openalex.org/W2024366499","https://openalex.org/W2030509174","https://openalex.org/W2074352030","https://openalex.org/W2075541196","https://openalex.org/W2146507303","https://openalex.org/W2153217785","https://openalex.org/W2164648353","https://openalex.org/W2275934214","https://openalex.org/W2578842235","https://openalex.org/W2809834283","https://openalex.org/W2963123599","https://openalex.org/W3000876286","https://openalex.org/W4300030091"],"related_works":["https://openalex.org/W3035122908","https://openalex.org/W2950313362","https://openalex.org/W2950893338","https://openalex.org/W2163768829","https://openalex.org/W10405664","https://openalex.org/W1600381863","https://openalex.org/W2926426864","https://openalex.org/W3000986974","https://openalex.org/W1965845491","https://openalex.org/W1515663280","https://openalex.org/W2963277542","https://openalex.org/W2165150557","https://openalex.org/W3114008689","https://openalex.org/W1987342271","https://openalex.org/W2404540217","https://openalex.org/W3022944478","https://openalex.org/W2058521212","https://openalex.org/W1544807994","https://openalex.org/W2485865435","https://openalex.org/W2138841062"],"abstract_inverted_index":{"Given":[0],"a":[1,11,20,25,45],"dynamic":[2],"graph":[3,17,52],"subject":[4],"to":[5],"insertions":[6],"and":[7],"deletions":[8],"of":[9],"edges,":[10],"natural":[12],"question":[13],"is":[14,53,57],"whether":[15,48],"the":[16,51,62],"presently":[18,54],"admits":[19],"planar":[21],"embedding.":[22],"We":[23],"give":[24],"deterministic":[26],"fully-dynamic":[27],"algorithm":[28,65],"for":[29],"general":[30],"graphs,":[31],"running":[32],"in":[33],"amortized":[34,73],"O(log3":[35],"n)":[36],"time":[37,75],"per":[38,76],"edge":[39],"insertion":[40],"or":[41,49],"deletion,":[42],"that":[43],"maintains":[44],"bit":[46],"indicating":[47],"not":[50],"planar.":[55],"This":[56],"an":[58],"exponential":[59],"improvement":[60],"over":[61],"previous":[63],"best":[64],"[Eppstein,":[66],"Galil,":[67],"Italiano,":[68],"Spencer,":[69],"1996]":[70],"which":[71],"spends":[72],"O(\u221an)":[74],"update.":[77]},"counts_by_year":[],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}