Author of the publication

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.

, , , , , , , and . J. Comput. Geom., 7 (1): 444-472 (2016)

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

Approximating the Visible Region of a Point on a Terrain., , and . ALENEX/ANALC, page 120-128. SIAM, (2004)Network Optimization on Partitioned Pairs of Points., , , , , , , and . ISAAC, volume 92 of LIPIcs, page 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss., , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 8 (2): 551-556 (2011)Computing maximum independent set on outerstring graphs and their relatives., , , , , , and . Comput. Geom., (2022)Connectivity guarantees for wireless networks with directional antennas., , , and . Comput. Geom., 44 (9): 477-485 (2011)On a family of strong geometric spanners that admit local routing strategies., , , , and . Comput. Geom., 44 (6-7): 319-328 (2011)Dual Power Assignment via Second Hamiltonian Cycle., , and . CoRR, (2014)Bounded-Hop Communication Networks., , and . Algorithmica, 80 (11): 3050-3077 (2018)Parameterized Study of Steiner Tree on Unit Disk Graphs., , , and . SWAT, volume 162 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Non-Crossing Matching of Online Points., , , , and . CCCG, page 233-239. (2020)