1.
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 (2025),
Journal of supercomputing
,
81(8),
1-28 (No:
33795)
(
10.1007/s11227-025-07531-0)
2.
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, Alireza Souri (2025),
Concurrency and computation-practice and experience
,
37(0),
70207-1-70207-23 (No:
34883)
3. تنبيه: عملگري جديد براي كنترل فشار انتخاب و بهبود كارايي الگوريتم كپك مخاطي
آرزو رحيمي زمان آبادي, محمد فرشي, سپهر ابراهيمي مود (1403)،
پژوهش هاي نظري و كاربردي هوش ماشيني،
2(2)،
145-161 (شماره:
33794)
4.
Security-aware resource allocation in fog computing using a meta-heuristic algorithm
Mina Mohammadi, Fatemeh Bahranipour, Sepehr Ebrahimi, Mohammad Farshi (2024),
Cluster computing-the journal of networks software tools and applications
,
28(),
104-1-104-18 (No:
32602)
(
10.1007/s10586-024-04794-9)
5.
On algorithmic complexity of imprecise spanners
Abolfazl Poureidi, Mohammad Farshi (2024),
Computational geometry-theory and applications
,
117(),
102051-1-102051-16 (No:
29570)
(
10.1016/j.comgeo.2023.102051)
6.
Algorithmic results on locating-total domination in graphs
Abolfazl Poureidi, Mohammad Farshi (2023),
Discrete applied mathematics
,
334(),
36-44 (No:
28912)
(
10.1016/j.dam.2023.03.007)
7.
Energy-delay aware request scheduling in hybrid cloud and fog computing using improved multi-objective cs algorithm
Fatemeh Bahranipour, Sepehr Ebrahimi, Mohammad Farshi (2023),
Soft computing
,
1(),
1-14 (No:
30025)
(
10.1007/s00500-023-09381-5)
8.
Angle-monotonicity of theta-graphs for points in convex position
Davood Bakhshesh, Mohammad Farshi (2023),
Scientia iranica
,
30(6),
2116-2123 (No:
30126)
(
10.24200/SCI.2023.61034.7110)
9. يك الگوريتم حريصانه براي ساخت پوشاننده هندسي تحمل پذير ناحيه-خطا
داود بخشش, محمد فرشي (1401)،
پدافند الكترونيكي و سايبري،
10(4)،
75-80 (شماره:
28911)
(
20.1001.1.23224347.1401.10.4.8.8)
10.
On the plane angle-monotone graphs
Davood Bakhshesh, Mohammad Farshi (2022),
Computational geometry-theory and applications
,
100(),
101818-1-101818-11 (No:
26096)
(
10.1016/j.comgeo.2021.101818)
11.
A lower bound on the stretch factor of yao graph y4
Davood Bakhshesh, Mohammad Farshi (2022),
Scientia iranica
,
29(6),
3244-3248 (No:
28234)
12.
A progressive algorithm for the closest pair problem
Amir Mesrikhani, Mohammad Farshi, Behnam Iranfar (2021),
International journal of computer mathematics: computer systems theory
,
6(2),
130-136 (No:
23704)
(
10.1080/23799927.2020.1862302)
13.
A framework for text mining on twitter: a case study on joint comprehensive plan of action (jcpoa)- between 2015 and 2019
Rashid Behzadidoost, , Mohammad Farshi, Vali Derhami, Farinaz Alamiyan-Harandi (2021),
Quality and quantity
,
1(1),
1-32 (No:
25818)
(
10.1007/s11135-021-01239-y)
14.
A degree 3 plane 5.19-spanner for points in convex position
Davood Bakhshesh, Mohammad Farshi (2021),
Scientia iranica
,
28(6),
3324-3331 (No:
26095)
(
10.24200/SCI.2021.56576.4796)
15.
Angle-monotonicity of delaunay triangulation
Davood Bakhshesh, Mohammad Farshi (2021),
Computational geometry-theory and applications
,
94(),
101711-1-101711-9 (No:
23366)
(
10.1016/j.comgeo.2020.101711)
16. اندازه گيري ميزان تشابه مسيرهاي جهت دار بر روي داده هاي هندسي
زينب سعيدي مسينه, محمد فرشي (1399)،
فناوري اطلاعات و ارتباطات ايران،
12(45-46)،
145-158 (شماره:
24954)
17. بيشينه يابي با استفاده از مقايسه هاي نادقيق: بررسي نظري و تجربي
محمد فرشي, پريا قلي پورلوائي (1399)،
علوم رايانشي،
(17)،
116-125 (شماره:
23015)
18.
On the expected weight of the theta graph on uncertain points
Behnam Iranfar, Mohammad Farshi (2020),
Journal of algorithms and computation
,
52(1),
163-174 (No:
23064)
19.
(weakly) self-approaching geometric graphs and spanners
Davood Bakhshesh, Mohammad Farshi (2019),
Computational geometry-theory and applications
,
78(),
20-36 (No:
19477)
(
10.1016/j.comgeo.2018.10.002)
20.
Fault tolerancy of continuous yao graph of angle less than 2n/5
Davood Bakhshesh, Mohammad Farshi (2019),
Information processing letters
,
148(),
13-18 (No:
21548)
(
10.1016/j.ipl.2019.03.014)
21.
Complexity results for k-domination and a-domination problems and their variants
Davood Bakhshesh, Mohammad Farshi, (2019),
Ars combinatoria
,
145(),
11-27 (No:
21710)
22.
Frechet and hausdorff queries on x-monotone trajectories
Zeinab Saeidi Masineh, Mohammad Farshi (2019),
Journal of algorithms and computation
,
51(2),
9-17 (No:
22488)
23.
Minimum spanning tree of imprecise points under l1-metric
Amir Mesrikhani, Mohammad Farshi, Behnam Iranfar (2019),
Journal of algorithms and computation
,
51(2),
99-110 (No:
23063)
24.
On the spread of a uniformly distributed point set
Behnam Iranfar, Mohammad Farshi, Amir Mesrikhani (2019),
Journal on computer science and engineering
,
17(1),
49-54 (No:
23703)
25.
2-domination number of generalized petersen graphs
Davood Bakhshesh, Mohammad Farshi, Mohammad Reza Hooshmandasl (2018),
Proceedings of the indian academy of sciences-mathematical sciences
,
128(17),
1-12 (No:
15925)
26.
Progressive sorting in the external memory model
Amir Mesrikhani, Mohammad Farshi (2018),
Journal on computer science and engineering
,
15(2),
1-4 (No:
19473)
27.
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 (2018),
Computational geometry-theory and applications
,
67(),
42-52 (No:
15921)
(
10.1016/j.comgeo.2017.10.002)
28.
Angle-constrained spanners with angle at least pi/3
Davood Bakhshesh, Mohammad Farshi (2017),
Information processing letters
,
120(),
44-46 (No:
15920)
(
10.1016/j.ipl.2017.01.002)
29.
Improving space and time complexity of the gap-greedy spanner algorithm
Davood Bakhshesh, Mohammad Farshi (2016),
Journal on computer science and engineering
,
14(1),
6-18 (No:
15924)
30.
A lower bound for computing geometric spanners
Mohammad Farshi, Abolfazl Poureidi (2016),
Computational geometry-theory and applications
,
53(),
21-26 (No:
9290)
(
10.1016/j.comgeo.2015.12.004)
31. راهنماي نصب و استفاده از LaTeX
محمد فرشي (1394)،
آيينه پژوهش،
2()،
4-7 (شماره:
9293)
32. معرفي سيستم حروف چيني TeX
محمد فرشي (1393)،
آيينه پژوهش،
1(1)،
- (شماره:
3850)
33.
F n -hypergroups based on fuzzy hyperoperations and fundamental relations
Mohammad Farshi, Bijan Davvaz (2014),
Journal of intelligent and fuzzy systems
,
26(3),
1453-1464 (No:
7174)
34.
Krasner f (m n) -hyperrings
Mohammad Farshi, Bijan Davvaz (2014),
Iranian journal of fuzzy systems
,
11(6),
67-88 (No:
7698)
35.
Fuzzy spanners
Mohammad Farshi (2014),
Journal of advanced computer science and technology
,
3(2),
249-252 (No:
3655)
36.
On the power of the semi-separated pair decomposition
MohammadAli Abam, Carmi Paz, Mohammad Farshi, Smid Michiel (2013),
Computational geometry-theory and applications
,
46(),
631-639 (No:
3200)
37.
Geometric spanners for weighted point sets
Abam Mohammad Ali , de Berg Mark , Mohammad Farshi, Gudmundsson Joachim , Smid Michiel (2011),
Algorithmica
,
61(1),
207-225 (No:
1580)
38.
Computing the greedy spanner in near-quadratic time
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshvari, Michiel Smid (2010),
Algorithmica
,
58(),
711-729 (No:
422)
39.
Dilation-optimal edge deletion in polygonal cycles
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang (2010),
International journal of computational geometry and applications
,
20(1),
69-87 (No:
421)
40.
Experimental study of geometric t-spanners
Mohammad Farshi, Joachim Gudmundsson (2009),
Journal of experimental algorithmics
,
14(),
1.3.1-1.3.39 (No:
1579)
41.
Improving the stretch factor of a geometric network by edge augmentation
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson (2008),
Siam journal on computing
,
38(1),
226-240 (No:
419)
42.
Region-fault tolerant geometric spanners
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson (2008),
Discrete and computational geometry
,
41(4),
556-582 (No:
420)