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

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)Sparse geometric graphs with small dilation., , , , , , and . Comput. Geom., 40 (3): 207-219 (2008)Chips on wafers, or packing rectangles into grids., , and . Comput. Geom., 30 (2): 95-111 (2005)Algorithms for radius-optimally augmenting trees in a metric space., and . Comput. Geom., (October 2023)Restricted Mesh Simplification Using Edge Contractions., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 196-204. Springer, (2006)Constructing Plane Spanners of Bounded Degree and Low Weight., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 234-246. Springer, (2002)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)A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract)., and . FCT, volume 1279 of Lecture Notes in Computer Science, page 305-316. Springer, (1997)Computing longest duration flocks in trajectory data., and . GIS, page 35-42. ACM, (2006)