
On distributed algorithms for minimum dominating set problem and beyond
In this paper, we study the minimum dominating set (MDS) problem and the...
read it

On Planar Visibility Counting Problem
For a set S of n disjoint line segments in ℝ^2, the visibility counting ...
read it

On guarding polygons with holes
There is an old conjecture by Shermer <cit.> that in a polygon with n ve...
read it

On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
In this paper, we propose a distributed algorithm for the minimum domina...
read it

Improved constant approximation factor algorithms for kcenter problem for uncertain data
In real applications, database systems should be able to manage and proc...
read it

On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment
Let P be a simple polygonal environment with k vertices in the plane. A...
read it

Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles
Consider SAT with the following restrictions. An input formula is in CNF...
read it

Improvements on the kcenter problem for uncertain data
In real applications, there are situations where we need to model some p...
read it
Sharareh Alipour
is this you? claim profile