Mohammad Farshi

Available identifiers

zbMath Open farshi.mohammadMaRDI QIDQ265716

List of research outcomes

Publication	Date of Publication	Type
On algorithmic complexity of imprecise spanners	2023-11-23	Paper
Algorithmic results on locating-total domination in graphs	2023-05-11	Paper
On the plane angle-monotone graphs	2021-12-15	Paper
Angle-monotonicity of Delaunay triangulation	2021-01-07	Paper
Complexity results for $k$-domination and $\alpha$-domination problems and their variants	2019-12-18	Paper
Fault tolerancy of continuous Yao graph of angle less than \(2\pi/5\)	2019-06-04	Paper
(Weakly) self-approaching geometric graphs and spanners	2018-12-07	Paper
Continuous Yao graphs	2018-02-12	Paper
Visualization of Geometric Spanner Algorithms	2018-01-30	Paper
Finding the best shortcut in a geometric network	2017-10-20	Paper
Angle-constrained spanners with angle at least \(\pi/3\)	2017-01-31	Paper
A lower bound for computing geometric spanners	2016-04-12	Paper
Some Properties of Continuous Yao Graph	2016-04-01	Paper
https://portal.mardi4nfdi.de/entity/Q2934575	2014-12-18	Paper
Experimental study of geometric t -spanners	2014-04-01	Paper
On the power of the semi-separated pair decomposition	2013-04-29	Paper
Geometric spanners for weighted point sets	2011-08-16	Paper
Computing the greedy spanner in near-quadratic time	2010-09-27	Paper
Geometric Spanners for Weighted Point Sets	2009-10-29	Paper
On the Power of the Semi-Separated Pair Decomposition	2009-10-20	Paper
Region-fault tolerant geometric spanners	2009-05-06	Paper
Improving the Stretch Factor of a Geometric Network by Edge Augmentation	2009-03-16	Paper
Computing the Greedy Spanner in Near-Quadratic Time	2008-07-15	Paper
Experimental Study of Geometric t-Spanners: A Running Time Comparison	2008-01-02	Paper
Algorithms – ESA 2005	2006-06-27	Paper

Research outcomes over time

This page was built for person: Mohammad Farshi