From post

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.

 

Другие публикации лиц с тем же именем

Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three., , и . SODA, стр. 282-291. ACM/SIAM, (1995)A Near-Linear Area Bound for Drawing Binary Trees.. SODA, стр. 161-168. ACM/SIAM, (1999)Closest-point problems simplified on the RAM.. SODA, стр. 472-473. ACM/SIAM, (2002)Finding the shortest bottleneck edge in a parametric minimum spanning tree.. SODA, стр. 917-918. SIAM, (2005)Selection and Sorting in the "Restore" Model., , и . ACM Trans. Algorithms, 14 (2): 11:1-11:18 (2018)Closest Pair and the Post Office Problem for Stochastic Points., , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 548-559. Springer, (2011)All-Pairs Shortest Paths in Geometric Intersection Graphs., и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 253-264. Springer, (2017)Geometric Optimization Problems Over Sliding Windows., и . ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 246-258. Springer, (2004)Voronoi diagrams in n·2osqrt(lg lg n) time., и . STOC, стр. 31-39. ACM, (2007)A Fully Dynamic Algorithm for Planar Width.. Discret. Comput. Geom., 30 (1): 17-24 (2003)