Journal Papers
H. Z. Zahedani and M. Farshi,
The SingerWermer conjecture.
J. of Iranian Math. Soc. (Farhang va Andisheye Riyazi), 18(2)(1999), 3752. (in Persian)

S. M. Vaezpour and M. Farshi,
A comment on the algebra of Toeplitz operators.
J. of Math. & Stat. (Golchin I Riyazi), Shiraz Univ. 8(2) and 9(1)(1999 & 2000). (in Persian)

M. Farshi,
The image of inner and generalized inner derivations on Banach algebras.
J. Sciences, Azzahra University, 13(1)(2000). (in Persian)

B. Davvaz and M. A. Iranmanesh and M. Farshi,
Matroid hypergroups defined on the same set.
J. Institute of Math. & Computer Sciences14(2) (2001), 8795.

M. Farshi,
Complex numbers in complex bases.
ETTEHAD (J. of Scientific Association of Mathematics Teachers in Iran) , 1 (1), Summer 2004. (in Persian).

M. Farshi,
Fractal tiling patterns generated by complex bases.
J. of Math. & Stat., (Golchin I Riyazi), Shiraz University, 13 (1), Fall 2005. (in Persian)

H. Khorshidi and M. Farshi,
On the number of topologies on a finite set: Algorithms and numbers.
J. of Math. & Stat. (Golchin I Riyazi ), Shiraz University, 14(2), 3078, 2005. (in Persian)

M. Farshi and J. Gudmundsson and P. Giannopoulos, Improving the stretch factor of a geometric network by edge augmentation.
SIAM Journal on Computing, Vol. 38(1), 226240, 2008.

M. A. Abam and M. de Berg and M. Farshi and J. Gudmundsson, Regionfault tolerant geometric spanners. Journal of Discrete & Computational Geometry, Vol. 41, 556582, 2009.

M. Farshi, J. Gudmundsson, Experimental study of geometric tspanners. The ACM Journal of Experimental Algorithmics, Volume 14, December 2009.

H.K. Ahn and M. Farshi and C. Knauer and M. Smid and Y. Wang, Dilationoptimal edge deletion in polygonal cycles. International Journal of Computational Geometry and Applications, Vol. 20, No. 1, 6987, 2010.

P. Bose and P. Carmi and M. Farshi and A. Maheshvari and M. Smid, Computing the greedy spanner in nearquadratic time. Algorithmica, Vol. 58, 711729, 2010.

M. A. Abam, M. de Berg, M. Farshi, J. Gudmundsson and M. Smid, Geometric spanners for weighted point sets. Algorithmica, Volume 61 (1), 207225, 2011 .

M. A. Abam, P. Carmi, M. Farshi, and M. Smid, On the Power of the SemiSeparated Pair Decomposition. Computational Geometry, Volume 46, Issue 6, August 2013, Pages 631–639 .

M. Farshi and M. J. HekmatNasab, Greedy Spanner Algorithms in Practice. Scientia Iranica D, 21 (6), 21422152, 2014.

M. Farshi and A. Poureidi, A lower bound for computing geometric spanners, COMPUTATIONAL GEOMETRY: Theory and Applications, Volume 53, 21–26, 2016.

D. Bakhshesh and M. Farshi, Improving space and time complexity of the gapgreedy spanner algorithm, CSI Journal on Computer Science and Engineering, Vol. 14, No. 1, 2016, Pages 618. 
D. Bakhshesh, M. Farshi and M. Hasheminezhad, Complexity results for kdomination and αdomination problems and their variants, Ars Combinatoria, to appear.

D. Bakhshesh and M. Farshi, Angleconstrained spanners with angle at least π/3, Information Processing Letters, Volume 120, April 2017, Pages 44–46.

D. Bakhshesh, L. Barba, P. Bose, J.L. De Carufel, M. Damian, R. Fagerberg, M. Farshi, A. van Renssen, P. Taslakian, and S. Verdonschot, Continuous Yao Graphs, COMPUTATIONAL GEOMETRY: Theory and Applications, Volume 67, Pages 4252, 2018. 
D. Bakhshesh, M. Farshi and M. R.
Hooshmandasl, 2domination number of generalized Petersen graphs, Proc. Math. Sci. 128: 17, 2018.

A. Mesrikhani, M. Farshi, Progressive sorting in the external memory model, CSI Journal on Computer Science and Engineering, Vol. 15, No. 2, 2018, Pages 14. 
D. Bakhshesh, M. Farshi ,(Weakly) Selfapproaching geometric graphs and spanners, COMPUTATIONAL GEOMETRY: Theory and Applications, Volume 78, Pages 2036, 2019. 
A. Poureidi, M. Farshi, Computing imprecise spanners using the wellseparated pair decomposition of a set of balls, submitted.

A. Poureidi, D. Bakhshesh, M. Farshi, IncreasingChord Planar Graphs for Points in Convex Position, submitted.

M. Farshi and A. Poureidi, Computing precise minimumdilation spanner from an imprecise spanner is NPhard, submitted.

A. Mesrikhani, M. Farshi, B. Iranfar, Solving the convex hull problem progressively in the external memory model, submitted.

A. Mesrikhani, M. Farshi, B. Iranfar, A Progressive Algorithm for The Closest Pair Problem, submitted.

A. Mesrikhani, M. Farshi, M. Davoodi, Progressive Algorithm For Euclidean Minimum Spanning Tree, submitted.


Conference Papers
M. Farshi and S. M. Vaezpour,
Computing eigenvalues and eigenvectors without determinant.
Second seminar on linear algebra and its applications, Persian Gulf University, Booshehr, Iran (2001). (in Persian)

M. Farshi,
The image of higher derivations on Banach algebras.
The 32nd Annual Iranian Mathematics Conference, University of Mazandaran, Babolsar, Iran. (2001). (in Persain)

M. Farshi,
Generating selfsimilar patterns with computer and its application in textile.
The 4th national conference in textile engineering, Yazd University, Yazd, Iran (May 2002). (in Persian)

M. Farshi, J. Gudmundsson and P. Giannopoulos
Finding the best shortcut in a geometric network.
21st Annual Symposium on Computational Geometry (SCG'05), Pisa, Italy, June 2005.

M. Farshi and J. Gudmundsson,
Experimental study of geometric tspanners.
13th Annual European Symposium on Algorithms (ESA 2005), Spain, October 36, 2005,
Lecture Note in Computer Science, Vol 3669, pp. 556567.

M. Farshi and J. Gudmundsson,
On algorithms for computing the diameter of a tspanner.
37th Annual Iranian Mathematics Conference (AIMC37), Tabriz, Iran, September 26, 2006.

M. A. Abam, M. de Berg, M. Farshi and J. Gudmundsson,
Regionfault tolerant geometric spanners.
ACMSIAM Symposium on Discrete Algorithms (SODA 2007) , New Orleans, USA, 79 January 2007..

M. Farshi and J. Gudmundsson,
Experimental study of geometric tspanners: a running time comparison.
6th Workshop on Experimental Algorithms (WEA '07), Rome, Italy,
Lecture Notes Computer Science, Vol. 4525, pages 270284, 2007.

H.K. Ahn, M. Farshi, C. Knauer, M. Smid and Y. Wang, Dilationoptimal edge deletion in polygonal cycles. 18th International Symposium on Algorithms and Computation (ISAAC '07), Lecture Notes Computer Science, Vol. 4835, pages 8899, 2007.

P. Bose, P. Carmi, M. Farshi, A. Maheshvari and M. Smid, Computing the greedy spanner in nearquadratic time. SWAT'08: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Lecture Notes Computer Science, Vol. 5124, pages 390401, 2008.

M. A. Abam, P. Carmi, M. Farshi, and M. Smid, On the Power of the SemiSeparated Pair Decomposition. WADS'09:
Proceedings of the 11th International Symposium on Algorithms and Data Structures, Lecture Notes in Computer Science , 2009, Volume 5664/2009, 112.

M. A. Abam, M. de Berg, M. Farshi, J. Gudmundsson and M. Smid, Geometric spanners for weighted point sets. ESA'09: Proceedings of the 17th Annual European Symposium on Algorithms, Lecture Notes in Computer Science , 2009, Volume 5757/2009, 190202.

D. Bakhshesh, M. Farshi, Some properties of continuous Yao graph, 1st Topics in Theoretical Computer Science (TTCS2015), August 2015, IPM, Tehran, Iran, Lecture Note in Computer Science, Vol. 9541, Springer, 2016. DOI: 10.1007/9783319286785 4 
D. Bakhshesh, M. Farshi, M. Hasheminezhad, A generalization of alphadominating set and its complexity, 46th Annual Iranian Mathematics Conference (AIMC46), August 2015, Yazd, Iran. 
M. Farshi, A. Poureidi, Z. Soltani, Sorting pairs of points based on their distances, 46th Annual Iranian Mathematics Conference (AIMC46), August 2015, Yazd, Iran. (In Persian) 
M. Farshi, A. Poureidi, Lower bound of Computing a gometric Spanner from an Imprecise Geometric Graph (in Persian), 20th National Computer Society of Iran Computer Conference (CSICC 2016), March 2016, IPM, Tehran, Iran.

M. Farshi,, S. H. Hosseini, Visualization of Geometric Spanner Algorithms, 32nd International Symposium on Computational Geometry (SoCG 2016): Multimedia Exposition, June 2016, Boston. USA. 
D. Bakhshesh, M. Farshi, Geometric Spanners Merging and its Applications, 28th Canadian Conference on Computational Geometry (CCCG2016), 35 August 2016, Simon Fraser University, Vancouver, Canada. 
M. Farshi, A. Poureidi, The Complexity of a problem of imprecise geometric spanners (in Persian) 47th Annual Iranian Mathematics Conference (AIMC47), August 2016, Karaj, Iran. 
D. Bakhshesh, M. Farshi, The Firm Gap Property and Its Applications, 47th Annual Iranian Mathematics Conference (AIMC47), August 2016, Karaj, Iran. 
A. Mesrikhani, M. Farshi, Progressive sorting in the external memory model, 48th Annual Iranian Mathematics Conference (AIMC48), August 2017, Hamadan, Iran. 
A. Mesrikhani, M. Farshi and M. Davoodi, Progressive Algorithm For Euclidean Minimum Spanning Tree, 1st Iranian Conference on Computational Geometry (ICCG 2018), February 2018, Amirkabir University of Technology, Tehran, Iran. 
D. Bakhshesh and M. Farshi, Fault Tolerancy of Continuous Yao Graph, 1st Iranian Conference on Computational Geometry (ICCG 2018), February 2018, Amirkabir University of Technology, Tehran, Iran. 
A. Poureidi, D. Bakhshesh and M. Farshi, IncreasingChord Planar Graphs for Points in Convex Position, 1st Iranian Conference on Computational Geometry (ICCG 2018), February 2018, Amirkabir University of Technology, Tehran, Iran. 
D. Bakhshesh and M. Farshi, A New Construction of the Greedy Spanner in Linear Space, 1st Iranian Conference on Computational Geometry (ICCG 2018), February 2018, Amirkabir University of Technology, Tehran, Iran. 






Theses
Master Thesis: The SingerWermer Conjecture. Department of Mathematics, Shiraz University, Shiraz, Iran. 1999. (in Persian)

PhD Thesis: A Theoretical and Experimental Study of Geometric Networks. Department of Mathematics and Computer Science, Eindhoven University of Technology (TU/e), The Netherlands. 2008. ISBN: 9789038611358.

Prepared the followings:
 The Proceedings of the 11th seminar on Mathematical Analysis and its Applications EnglishPart PersianPart
 مجموعه مقالات یازدهمین سمینار آنالیز ریاضی و کاربردهای آن1379دانشگاه یزد مقالات انگلیسی مقالات فارسی
Last update: January 2, 2019