Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMohammad Farshi
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j10]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: 42-52 (2018)- 2017
- [j9]Davood Bakhshesh, Mohammad Farshi:
Angle-constrained spanners with angle at least π/3. Inf. Process. Lett. 120: 44-46 (2017) - [i3]Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad:
Complexity results for k-domination and α-domination problems and their variants. CoRR abs/1702.00533 (2017) - [i2]Abolfazl Poureidi, Mohammad Farshi:
The well-separated pair decomposition for balls. CoRR abs/1706.06287 (2017) - 2016
- [j8]Mohammad Farshi, Abolfazl Poureidi:
A lower bound for computing geometric spanners. Comput. Geom. 53: 21-26 (2016) - [c11]Davood Bakhshesh, Mohammad Farshi:
Geometric Spanners Merging and its Applications. CCCG 2016: 133-139 - [c10]Mohammad Farshi, Seyed Hossein Hosseini:
Visualization of Geometric Spanner Algorithms. Symposium on Computational Geometry 2016: 67:1-67:4 - 2015
- [c9]
- 2013
- [j7]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the power of the semi-separated pair decomposition. Comput. Geom. 46(6): 631-639 (2013) - 2011
- [j6]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011) - 2010
- [j5]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) - [j4]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geometry Appl. 20(1): 69-87 (2010)
2000 – 2009
- 2009
- [j3]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-Fault Tolerant Geometric Spanners. Discrete & Computational Geometry 41(4): 556-582 (2009) - [j2]Mohammad Farshi, Joachim Gudmundsson:
Experimental study of geometric t-spanners. ACM Journal of Experimental Algorithmics 14 (2009) - [c8]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 - [c7]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12 - 2008
- [j1]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38(1): 226-240 (2008) - [c6]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 - 2007
- [c5]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99 - [c4]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-fault tolerant geometric spanners. SODA 2007: 1-10 - [c3]Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284 - 2005
- [c2]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. Symposium on Computational Geometry 2005: 327-335 - [c1]
- [i1]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. EuroCG 2005: 29-32
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-26 16:10 CEST by the dblp team