( en | de | ru )

 

Disambiguation of "Farshi, Mohammad"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the Greedy Spanner in Near-Quadratic Time.

, , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 390-401. Springer, (2008)

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.

Pershang Farshi

Pakhshan Farshi

Hamide Farshi

Mohammad Mohammad

Maziar Soltani Farshi

 

Other publications of authors with the same name

Computing the Greedy Spanner in Near-Quadratic Time., , , , and . Algorithmica, 58 (3): 711-729 (2010)A Degree 3 Plane 5.19-Spanner for Points in Convex Position., and . CCCG, page 226-232. (2020)Geometric Spanners for Weighted Point Sets., , , , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 190-202. Springer, (2009)Region-fault tolerant geometric spanners., , , and . SODA, page 1-10. SIAM, (2007)Finding the best shortcut in a geometric network., , and . SCG, page 327-335. ACM, (2005)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)Computing the Greedy Spanner in Near-Quadratic Time., , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 390-401. Springer, (2008)Algorithmic results on locating-total domination in graphs., and . Discret. Appl. Math., (July 2023)Dilation-Optimal Edge Deletion in Polygonal Cycles., , , , and . Int. J. Comput. Geom. Appl., 20 (1): 69-87 (2010)Some Properties of Continuous Yao Graph., and . TTCS, volume 9541 of Lecture Notes in Computer Science, page 44-55. Springer, (2015)