default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Farshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Mina Mohammadi, Fatemeh BahraniPour, Sepehr Ebrahimi Mood, Mohammad Farshi:
Security-aware resource allocation in fog computing using a meta-heuristic algorithm. Clust. Comput. 28(2): 104 (2025)- 2024
- [j18]Abolfazl Poureidi, Mohammad Farshi
:
On algorithmic complexity of imprecise spanners. Comput. Geom. 117: 102051 (2024) - [j17]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): 4037-4050 (2024) - 2023
- [j16]Abolfazl Poureidi, Mohammad Farshi:
Algorithmic results on locating-total domination in graphs. Discret. Appl. Math. 334: 36-44 (2023) - 2022
- [j15]Davood Bakhshesh, Mohammad Farshi:
On the plane angle-monotone graphs. Comput. Geom. 100: 101818 (2022) - 2021
- [j14]Davood Bakhshesh, Mohammad Farshi:
Angle-monotonicity of Delaunay triangulation. Comput. Geom. 94: 101711 (2021) - [j13]Amir Mesrikhani, Mohammad Farshi, Behnam Iranfar:
A progressive algorithm for the closest pair problem. Int. J. Comput. Math. Comput. Syst. Theory 6(2): 130-136 (2021) - 2020
- [c12]Davood Bakhshesh, Mohammad Farshi:
A Degree 3 Plane 5.19-Spanner for Points in Convex Position. CCCG 2020: 226-232
2010 – 2019
- 2019
- [j12]Davood Bakhshesh, Mohammad Farshi:
(Weakly) Self-approaching geometric graphs and spanners. Comput. Geom. 78: 20-36 (2019) - [j11]Davood Bakhshesh, Mohammad Farshi:
Fault tolerancy of continuous Yao graph of angle less than 2π/5. Inf. Process. Lett. 148: 13-18 (2019) - 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. SoCG 2016: 67:1-67:4 - 2015
- [c9]Davood Bakhshesh, Mohammad Farshi:
Some Properties of Continuous Yao Graph. TTCS 2015: 44-55 - 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. Geom. 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. Discret. Comput. Geom. 41(4): 556-582 (2009) - [j2]Mohammad Farshi, Joachim Gudmundsson:
Experimental study of geometric t-spanners. ACM J. Exp. 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. SCG 2005: 327-335 - [c1]Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners. ESA 2005: 556-567 - [i1]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. EuroCG 2005: 29-32
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
