Finding the best shortcut in a geometric network. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (EuroCG, 2005)

Experimental Study of Geometric t-Spanners: A Running Time Comparison. - Mohammad Farshi; Joachim Gudmundsson (WEA, 2007)

Improving the Stretch Factor of a Geometric Network by Edge Augmentation. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (SIAM J. Comput., 2008)

Region-Fault Tolerant Geometric Spanners. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson (Discret. Comput. Geom., 2009)

Experimental study of geometric t-spanners. - Mohammad Farshi; Joachim Gudmundsson (ACM J. Exp. Algorithmics, 2009)

Computing the Greedy Spanner in Near-Quadratic Time. - Prosenjit Bose; Paz Carmi; Mohammad Farshi; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2010)

Dilation-Optimal Edge Deletion in Polygonal Cycles. - Hee-Kap Ahn; Mohammad Farshi; Christian Knauer; Michiel H. M. Smid; Yajun Wang (Int. J. Comput. Geom. Appl., 2010)

Geometric Spanners for Weighted Point Sets. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson; Michiel H. M. Smid (Algorithmica, 2011)

On the power of the semi-separated pair decomposition. - Mohammad Ali Abam; Paz Carmi; Mohammad Farshi; Michiel H. M. Smid (Comput. Geom., 2013)

Some Properties of Continuous Yao Graph. - Davood Bakhshesh; Mohammad Farshi (TTCS, 2015)

Geometric Spanners Merging and its Applications. - Davood Bakhshesh; Mohammad Farshi (CCCG, 2016)

Visualization of Geometric Spanner Algorithms. - Mohammad Farshi; Seyed Hossein Hosseini (SoCG, 2016)

A lower bound for computing geometric spanners. - Mohammad Farshi; Abolfazl Poureidi (Comput. Geom., 2016)

Complexity results for k-domination and α-domination problems and their variants. - Davood Bakhshesh; Mohammad Farshi; Mahdieh Hasheminezhad (CoRR, 2017)

The well-separated pair decomposition for balls. - Abolfazl Poureidi; Mohammad Farshi (CoRR, 2017)

Angle-constrained spanners with angle at least π/3. - Davood Bakhshesh; Mohammad Farshi (Inf. Process. Lett., 2017)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

(Weakly) Self-approaching geometric graphs and spanners. - Davood Bakhshesh; Mohammad Farshi (Comput. Geom., 2019)

Fault tolerancy of continuous Yao graph of angle less than 2π/5. - Davood Bakhshesh; Mohammad Farshi (Inf. Process. Lett., 2019)

A Degree 3 Plane 5.19-Spanner for Points in Convex Position. - Davood Bakhshesh; Mohammad Farshi (CCCG, 2020)

Angle-monotonicity of Delaunay triangulation. - Davood Bakhshesh; Mohammad Farshi (Comput. Geom., 2021)

A progressive algorithm for the closest pair problem. - Amir Mesrikhani; Mohammad Farshi; Behnam Iranfar (Int. J. Comput. Math. Comput. Syst. Theory, 2021)

On the plane angle-monotone graphs. - Davood Bakhshesh; Mohammad Farshi (Comput. Geom., 2022)

Algorithmic results on locating-total domination in graphs. - Abolfazl Poureidi; Mohammad Farshi (Discret. Appl. Math., 2023)

On algorithmic complexity of imprecise spanners. - Abolfazl Poureidi; Mohammad Farshi (Comput. Geom., 2024)

Energy-delay aware request scheduling in hybrid Cloud and Fog computing using improved multi-objective CS algorithm. - Fatemeh BahraniPour; Sepehr Ebrahimi Mood; Mohammad Farshi (Soft Comput., 2024)

Enhancing the Harris Hawks Optimization Algorithm With Ambush-Based Operators for Feature Selection in UAV-Based Intrusion Detection Systems. - Sayed Zabihullah Musawi; Mohammad Farshi; Sepehr Ebrahimi Mood; Alireza Souri (Concurr. Comput. Pract. Exp., 2025)

Security-aware resource allocation in fog computing using a meta-heuristic algorithm. - Mina Mohammadi; Fatemeh BahraniPour; Sepehr Ebrahimi Mood; Mohammad Farshi (Clust. Comput., 2025)

Enhanced multi-objective cuckoo search with migration operator for benchmark optimization and IoT task scheduling in cloud-fog computing. - Fatemeh BahraniPour; Mohammad Farshi; Sepehr Ebrahimi Mood (J. Supercomput., 2025)