Author of the publication

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound.

, , and . SoCG, volume 224 of LIPIcs, page 54:1-54:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light. CoRR, (2011)Fast Constructions of Lightweight Spanners for General Graphs., and . ACM Trans. Algorithms, 12 (3): 29:1-29:21 (2016)On an infinite family of solvable Hanoi graphs., , and . ACM Trans. Algorithms, 5 (1): 13:1-13:22 (2008)Wireless Expanders., , , and . SPAA, page 13-22. ACM, (2018)The Tower of Hanoi problem on Pathh graphs., , and . Discret. Appl. Math., 160 (10-11): 1465-1483 (2012)Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach., and . ACM Trans. Parallel Comput., 8 (1): 5:1-5:26 (2021)Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More., , , , , and . CoRR, (2023)Dynamic Matching Algorithms Under Vertex Updates., , , and . ITCS, volume 215 of LIPIcs, page 96:1-96:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function., , and . SoCG, volume 258 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fast Constructions of Light-Weight Spanners for General Graphs., and . SODA, page 513-525. SIAM, (2013)