Author of the publication

Augmenting Graphs to Minimize the Radius.

, , and . ISAAC, volume 212 of LIPIcs, page 45:1-45:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Map matching queries on realistic input graphs under the Fréchet distance., , and . SODA, page 1464-1492. SIAM, (2023)A simple and efficient kinetic spanner., , and . SCG, page 306-310. ACM, (2008)Increasing-Chord Graphs On Point Sets., , and . GD, volume 8871 of Lecture Notes in Computer Science, page 464-475. Springer, (2014)Approximate distance oracles for geometric graphs., , , and . SODA, page 828-837. ACM/SIAM, (2002)On the Expected Maximum Degree of Gabriel and Yao Graphs, , and . CoRR, (2009)Experimental Study of Geometric t-Spanners: A Running Time Comparison., and . WEA, volume 4525 of Lecture Notes in Computer Science, page 270-284. Springer, (2007)Constructing Plane Spanners of Bounded Degree and Low Weight., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 234-246. Springer, (2002)Quickest Path Queries on Transportation Network., , and . CATS, volume 128 of CRPIT, page 37-46. Australian Computer Society, (2012)Planar Geometric Spanners., , and . Encyclopedia of Algorithms, (2016)Sparse geometric graphs with small dilation., , , , , , and . Comput. Geom., 40 (3): 207-219 (2008)