( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Experimental Study of Geometric t-Spanners: A Running Time Comparison.

, и . WEA, том 4525 из Lecture Notes in Computer Science, стр. 270-284. 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.

Pershang Farshi

Pakhshan Farshi

Hamide Farshi

Mohammad Mohammad

Maziar Soltani Farshi

 

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

Computing the Greedy Spanner in Near-Quadratic Time., , , , и . Algorithmica, 58 (3): 711-729 (2010)A Degree 3 Plane 5.19-Spanner for Points in Convex Position., и . CCCG, стр. 226-232. (2020)Geometric Spanners for Weighted Point Sets., , , , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 190-202. Springer, (2009)Region-fault tolerant geometric spanners., , , и . SODA, стр. 1-10. SIAM, (2007)Finding the best shortcut in a geometric network., , и . SCG, стр. 327-335. ACM, (2005)On the Power of the Semi-Separated Pair Decomposition., , , и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2009)Energy-delay aware request scheduling in hybrid Cloud and Fog computing using improved multi-objective CS algorithm., , и . Soft Comput., 28 (5): 4037-4050 (марта 2024)Some Properties of Continuous Yao Graph., и . TTCS, том 9541 из Lecture Notes in Computer Science, стр. 44-55. Springer, (2015)Dilation-Optimal Edge Deletion in Polygonal Cycles., , , , и . Int. J. Comput. Geom. Appl., 20 (1): 69-87 (2010)Computing the Greedy Spanner in Near-Quadratic Time., , , , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 390-401. Springer, (2008)