Mohammad Farshi

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 16

Top Topics

Delaunay Triangulation

Top Venues

Inf. Process. Lett.

Publications

Fatemeh BahraniPour, Sepehr Ebrahimi Mood, Mohammad Farshi
Energy-delay aware request scheduling in hybrid Cloud and Fog computing using improved multi-objective CS algorithm. Soft Comput. 28 (5) (2024)
Abolfazl Poureidi, Mohammad Farshi
On algorithmic complexity of imprecise spanners. Comput. Geom. 117 (2024)
Abolfazl Poureidi, Mohammad Farshi
Algorithmic results on locating-total domination in graphs. Discret. Appl. Math. 334 (2023)
Davood Bakhshesh, Mohammad Farshi
On the plane angle-monotone graphs. Comput. Geom. 100 (2022)
Amir Mesrikhani, Mohammad Farshi, Behnam Iranfar
A progressive algorithm for the closest pair problem. Int. J. Comput. Math. Comput. Syst. Theory 6 (2) (2021)
Davood Bakhshesh, Mohammad Farshi
Angle-monotonicity of Delaunay triangulation. Comput. Geom. 94 (2021)
Davood Bakhshesh, Mohammad Farshi
A Degree 3 Plane 5.19-Spanner for Points in Convex Position. CCCG (2020)
Davood Bakhshesh, Mohammad Farshi
(Weakly) Self-approaching geometric graphs and spanners. Comput. Geom. 78 (2019)
Davood Bakhshesh, Mohammad Farshi
/5. Inf. Process. Lett. 148 (2019)
Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot
Continuous Yao graphs. Comput. Geom. 67 (2018)
Abolfazl Poureidi, Mohammad Farshi
The well-separated pair decomposition for balls. CoRR (2017)
Davood Bakhshesh, Mohammad Farshi
Angle-constrained spanners with angle at least π/3. Inf. Process. Lett. 120 (2017)
Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad
Complexity results for k-domination and α-domination problems and their variants. CoRR (2017)
Davood Bakhshesh, Mohammad Farshi
Geometric Spanners Merging and its Applications. CCCG (2016)
Mohammad Farshi, Abolfazl Poureidi
A lower bound for computing geometric spanners. Comput. Geom. 53 (2016)
Mohammad Farshi, Seyed Hossein Hosseini
Visualization of Geometric Spanner Algorithms. SoCG (2016)
Davood Bakhshesh, Mohammad Farshi
Some Properties of Continuous Yao Graph. TTCS (2015)
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
On the power of the semi-separated pair decomposition. Comput. Geom. 46 (6) (2013)
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
Geometric Spanners for Weighted Point Sets. Algorithmica 61 (1) (2011)
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. 20 (1) (2010)
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58 (3) (2010)
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
On the Power of the Semi-Separated Pair Decomposition. WADS (2009)
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
Region-Fault Tolerant Geometric Spanners. Discret. Comput. Geom. 41 (4) (2009)
Mohammad Farshi, Joachim Gudmundsson
-spanners. ACM J. Exp. Algorithmics 14 (2009)
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
Geometric Spanners for Weighted Point Sets. ESA (2009)
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
Computing the Greedy Spanner in Near-Quadratic Time. SWAT (2008)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38 (1) (2008)
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
Region-fault tolerant geometric spanners. SODA (2007)
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC (2007)
Mohammad Farshi, Joachim Gudmundsson
Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA (2007)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Finding the best shortcut in a geometric network. SCG (2005)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Finding the best shortcut in a geometric network. EuroCG (2005)
Mohammad Farshi, Joachim Gudmundsson
-Spanners. ESA (2005)