6 citations · 9 across the 7 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2013
Output sensitive algorithm for covering many points
Hossein Ghasemalizadeh, Mohammadreza Razzazi
A set of points and a positive integer are given and our goal is to cover the maximum number of these point with disks. We devise the first output sensitive algorithm for t…
cs.CG2009
Complexity of Planar Embeddability of Trees inside Simple Polygons
Alireza Bagheri, Mohammadreza Razzazi
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a s…