From post

On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.

, , , , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 300-311. Springer, (2007)

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.

 

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

Competitive Online Routing in Geometric Graphs., и . SIROCCO, том 8 из Proceedings in Informatics, стр. 35-44. Carleton Scientific, (2001)Efficient Algorithms for Petersen's Matching Theorem., , , и . SODA, стр. 130-139. ACM/SIAM, (1999)Routing with guaranteed delivery in ad hoc wireless networks., , , и . DIAL-M, стр. 48-55. ACM, (1999)Constrained generalized Delaunay graphs are plane spanners., , и . Comput. Geom., (2018)Constructing Plane Spanners of Bounded Degree and Low Weight., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 234-246. Springer, (2002)Maximum Plane Trees in Multipartite Geometric Graphs., , , , , , и . Algorithmica, 81 (4): 1512-1534 (2019)The θ 5-Graph is a Spanner., , , и . WG, том 8165 из Lecture Notes in Computer Science, стр. 100-114. Springer, (2013)Location Oblivious Distributed Unit Disk Graph Coloring., , , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 222-233. Springer, (2007)Efficient Construction of Near-Optimal Binary and Multiway Search Trees., и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 230-241. Springer, (2009)On Generalized Diamond Spanners., , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 325-336. Springer, (2007)