M. Farshi

most citedComplexity results for

k

-domination and

α

-domination problems and their variants

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2017

The well-separated pair decomposition for balls

Abolfazl Poureidi, Mohammad Farshi

Given a real number $t > 1$ , a geometric $t$ -spanner is a geometric graph for a point set in $R^{d}$ with straight lines between vertices such that the ratio of the shortest-p…

cs.CC2017★ 2 cited

Complexity results for $k$ -domination and $α$ -domination problems and their variants

Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad

Let $G = (V, E)$ be a simple and undirected graph. For some integer $k \geq 1$ , a set $D \subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has…

cs.CG2014★ 1 cited

Continuous Yao Graphs

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5

In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points $S \subset R^{2}$ and an angle $0 < θ \leq 2 π$ , we define the continuous Yao grap…

The well-separated pair decomposition for balls

Complexity results for k-domination and α-domination problems and their variants

Continuous Yao Graphs

Complexity results for $k$ -domination and $α$ -domination problems and their variants