{"id":"https://openalex.org/W7078773314","doi":"https://doi.org/10.4230/lipics.wads.2025.2","title":"Unintuitive Facts About Distances on Planar Graphs (Invited Talk)","display_name":"Unintuitive Facts About Distances on Planar Graphs (Invited Talk)","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7078773314","doi":"https://doi.org/10.4230/lipics.wads.2025.2"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24233","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.2/LIPIcs.WADS.2025.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.2/LIPIcs.WADS.2025.2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chang, Hsien-Chih","orcid":"https://orcid.org/0000-0001-6714-7988"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chang, Hsien-Chih","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH, USA"],"raw_orcid":"https://orcid.org/0000-0001-6714-7988","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39747014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.3610000014305115,"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/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.3610000014305115,"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/T13177","display_name":"Geological and Geophysical Studies","score":0.04569999873638153,"subfield":{"id":"https://openalex.org/subfields/1907","display_name":"Geology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13067","display_name":"Geological Modeling and Analysis","score":0.027400000020861626,"subfield":{"id":"https://openalex.org/subfields/1906","display_name":"Geochemistry and Petrology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7671999931335449},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.7324000000953674},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6276999711990356},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4959999918937683},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4812999963760376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47530001401901245},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4417000114917755},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.42750000953674316}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7671999931335449},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7324000000953674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6888999938964844},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6276999711990356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5648000240325928},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4959999918937683},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4417000114917755},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43149998784065247},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40950000286102295},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.3831999897956848},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.3720000088214874},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.35839998722076416},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.3181000053882599},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.28139999508857727},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.2800999879837036},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24233","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.2/LIPIcs.WADS.2025.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.wads.2025.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wads.2025.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24233","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.2/LIPIcs.WADS.2025.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5867846204","display_name":"CAREER: Efficient Distance Sketching on Graphs with Geometric Structures","funder_award_id":"2443017","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7078773314.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Conventional":[0],"wisdom":[1],"told":[2],"us":[3],"that":[4,56,64,104,141,156,161,175,209,275,310,331,367],"planar":[5,65,88,102,129,203,233,254,329,343],"graphs":[6,66,103,234,237,330],"are":[7,67,244,256,286,332,353],"essentially":[8],"edge-weighted":[9],"grids,":[10],"with":[11,238],"more":[12],"or":[13,355],"less":[14],"equal":[15],"side-lengths.":[16],"An":[17],"n-node":[18],"n^{1/2}-by-n^{1/2}":[19],"square":[20],"grid":[21,119],"has":[22,112,125],"treewidth":[23],"\u0398(n^{1/2});":[24],"and":[25,48,69,83,111,168,179,228,278,299,338,345],"if":[26,242],"we":[27,40,78,95,142,196,243,261,352],"want":[28],"to":[29,42,62,98,149,222,246,318,364],"preserve":[30],"shortest-path":[31],"distances":[32,107],"between":[33,108],"every":[34],"pair":[35,164],"of":[36,152,165,232,266,307,313,349],"boundary":[37],"nodes,":[38],"intuitively":[39],"have":[41,374],"keep":[43],"all":[44],"the":[45,91,118,122,139,150,153,194,206,220,223,248,264,273,276,279,291,300,341,347,362,369,372,377],"n^{1/2}":[46],"column":[47],"row":[49],"paths,":[50],"which":[51,285,334],"together":[52],"create":[53],"n":[54],"\"crossings\"":[55],"cannot":[57],"be":[58,132,365],"removed.":[59],"This":[60],"seems":[61],"suggest":[63],"incompressible":[68],"not":[70,288],"tree-like.":[71],"Or":[72],"does":[73],"it?":[74],"In":[75],"this":[76,296],"talk":[77],"will":[79,197,262],"discuss":[80,263],"three":[81],"unintuitive,":[82],"perhaps":[84],"surprising,":[85],"facts":[86],"about":[87],"metrics":[89,130,204,255],"in":[90,138,219,229,290,324,346,371],"(1+\u03b5)-approximation":[92],"regime.":[93],"First":[94],"demonstrate":[96],"how":[97],"construct":[99,144,326],"emulator":[100,124,277],"for":[101,117,328],"preserves":[105],"all-pair":[106],"k":[109],"terminals,":[110],"size":[113,126,151],"O\u0303_\u03b5(k).":[114],"(This":[115],"implies,":[116],"example":[120],"above,":[121],"resulting":[123],"O\u0303(n^{1/2}).)":[127],"Second,":[128],"can":[131,143,323],"covered":[133],"using":[134],"constantly(!)":[135],"many":[136,146],"trees,":[137],"sense":[140],"O(1)":[145],"trees":[147,363,373],"independent":[148],"input":[154,293,342,378],"graph":[155,379],"never":[157],"shrinks":[158],"distances,":[159],"so":[160],"given":[162],"any":[163],"nodes":[166,287,309],"x":[167,178],"y,":[169],"there":[170],"is":[171,185,297,303,317],"one":[172,354],"tree":[173,212,280,350],"T":[174,184],"contains":[176],"both":[177],"y":[180],"whose":[181],"distance":[182,249,301],"on":[183,202,272],"stretched":[186],"by":[187,250],"at":[188],"most":[189],"a":[190,199,251],"1+\u03b5":[191],"factor.":[192],"Along":[193],"way":[195],"introduce":[198],"novel":[200],"structure":[201],"-":[205,208],"gridtrees":[207],"enables":[210],"such":[211],"covers,":[213,351],"as":[214,216,380],"well":[215],"its":[217],"applications":[218],"resolution":[221],"Steiner":[224],"point":[225],"removal":[226],"problem,":[227],"constructing":[230],"embeddings":[231],"into":[235],"polylog-treewidth":[236],"(1+\u03b5)-distortion.":[239],"(Which":[240],"means,":[241],"willing":[245],"distort":[247],"small":[252],"amount,":[253],"very":[257],"much":[258],"tree-like.)":[259],"Finally,":[260],"issue":[265],"spanning.":[267],"Both":[268],"results":[269],"above":[270],"rely":[271],"fact":[274,325],"cover":[281],"use":[282],"\"Steiner":[283],"nodes\",":[284],"presented":[289],"original":[292],"graph.":[294],"Maybe":[295],"cheating,":[298],"compression":[302],"only":[304,335],"possible":[305],"because":[306],"these":[308],"appear":[311],"out":[312],"nowhere?":[314],"Our":[315],"goal":[316],"convince":[319],"you":[320],"otherwise:":[321],"We":[322],"emulators":[327],"minors,":[333],"uses":[336],"paths":[337],"edges":[339,370],"from":[340,360,376],"graph;":[344],"case":[348],"two":[356],"new":[357],"structures":[358],"away":[359],"enforcing":[361],"spanning,":[366],"is,":[368],"come":[375],"well.":[381]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}