Sledovat
M Farshi
M Farshi
Associate Prof. of Computer Science, Combinatorial & Geometric Algorithms lab, Yazd University
E-mailová adresa ověřena na: yazd.ac.ir - Domovská stránka
Název
Citace
Citace
Rok
Region-fault tolerant geometric spanners
MA Abam, M De Berg, M Farshi, J Gudmundsson
Discrete & Computational Geometry 41 (4), 556-582, 2009
612009
Computing the greedy spanner in near-quadratic time
P Bose, P Carmi, M Farshi, A Maheshwari, M Smid
Algorithmica 58 (3), 711-729, 2010
462010
Improving the stretch factor of a geometric network by edge augmentation
M Farshi, P Giannopoulos, J Gudmundsson
SIAM Journal on Computing 38 (1), 226-240, 2008
362008
Experimental study of geometric t-spanners
M Farshi, J Gudmundsson
Journal of Experimental Algorithmics (JEA) 14, 1.3-1.39, 2010
272010
Experimental Study of Geometric t-Spanners
M Farshi, J Gudmundsson
European Symposium on Algorithms, 556-567, 2005
262005
Finding the best shortcut in a geometric network
M Farshi, P Giannopoulos, J Gudmundsson
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
222005
Geometric spanners for weighted point sets
MA Abam, M De Berg, M Farshi, J Gudmundsson, M Smid
Algorithmica 61 (1), 207-225, 2011
202011
On the power of the semi-separated pair decomposition
MA Abam, P Carmi, M Farshi, M Smid
Computational Geometry 46 (6), 631-639, 2013
182013
Computing the greedy spanner in near-quadratic time
P Bose, P Carmi, M Farshi, A Maheshwari, M Smid
Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008
18*2008
Experimental study of geometric t-spanners: A running time comparison
M Farshi, J Gudmundsson
International Workshop on Experimental and Efficient Algorithms, 270-284, 2007
17*2007
On the power of the semi-separated pair decomposition
MA Abam, P Carmi, M Farshi, M Smid
Workshop on Algorithms and Data Structures, 1-12, 2009
152009
On the Power of the Semi-Separated Pair Decomposition
MA Abam, P Carmi, M Farshi, M Smid
Algorithms and Data Structures: 11th International Symposium, WADS 2009 5664 …, 2009
152009
A theoretical and experimental study of geometric networks
M Farshi
Eindhoven University of Technology, 2008
13*2008
2-domination number of generalized Petersen graphs
D Bakhshesh, M Farshi, MR Hooshmandasl
Proceedings-Mathematical Sciences 128, 1-12, 2018
82018
Progressive sorting in the external memory model
A Mesrikhani, M Farshi
CSI Journal on Computer Science and Engineering (JCSE) 15 (2), 1-4, 2018
72018
A Degree 3 Plane 5.19-Spanner for Points in Convex Position
D Bakhshesh, M Farshi.
The 32nd Canadian Conference on Computational Geometry (CCCG 2020), August …, 2020
62020
Continuous yao graphs
D Bakhshesh, L Barba, P Bose, JL De Carufel, M Damian, R Fagerberg, ...
Computational Geometry 67, 42-52, 2018
62018
A framework for text mining on Twitter: a case study on joint comprehensive plan of action (JCPOA)-between 2015 and 2019
R Behzadidoost, M Hasheminezhad, M Farshi, V Derhami, ...
Quality & Quantity, 1-32, 2021
52021
Progressive algorithm for Euclidean minimum spanning tree
A Mesrikhani, M Farshi, M Davoodi
First Iranian Conference on Computational Geometry (ICCG 2018), 29, 2018
52018
Fault tolerancy of continuous Yao graph of angle less than 2π/5
D Bakhshesh, M Farshi
Information Processing Letters 148, 13-18, 2019
42019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20