3 citations · 7 across the 6 of their papers we have counts for
12 papers
On distributed algorithms for minimum dominating set problem and beyond
Sharareh Alipour, Mohammadhadi Salari
In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set MTDS) problem which have many applications in real world. We propose a new ide…
On Planar Visibility Counting Problem
Sharareh Alipour
For a set of disjoint line segments in , the visibility counting problem is to preprocess such that the number of visible segments in from any query…
On guarding polygons with holes
Sharareh Alipour
There is an old conjecture by Shermer \cite{sher} that in a polygon with vertices and holes, vertex guards are sufficient to guard the enti…
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
Sharareh Alipour, Ehsan Futuhi, Shayan Karimi
In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our propose…
On decomposing complete tripartite graphs into 5-cycles
M. Abdolmaleki, S. Gh. Ilchi, E. S. Mahmoodian +1
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph into 5-cycles was first considered by E.S. Mahmoodian and Maryam Mir…
Improved constant approximation factor algorithms for -center problem for uncertain data
Sharareh Alipour
In real applications, database systems should be able to manage and process data with uncertainty. Any real dataset may have missing or rounded values, also the values of data may…