research
∙
07/12/2023
Relative Fractional Independence Number and Its Applications
We define the relative fractional independence number of two graphs, G a...
share
research
∙
03/14/2021
On distributed algorithms for minimum dominating set problem and beyond
In this paper, we study the minimum dominating set (MDS) problem and the...
research
∙
03/14/2021
On Planar Visibility Counting Problem
For a set S of n disjoint line segments in ℝ^2, the visibility counting ...
research
∙
02/20/2021
On guarding polygons with holes
There is an old conjecture by Shermer <cit.> that in a polygon with n ve...
research
∙
12/09/2020
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
In this paper, we propose a distributed algorithm for the minimum domina...
research
∙
09/23/2018
Improved constant approximation factor algorithms for k-center problem for uncertain data
In real applications, database systems should be able to manage and proc...
research
∙
09/01/2018
On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment
Let P be a simple polygonal environment with k vertices in the plane. A...
research
∙
05/20/2018
Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles
Consider SAT with the following restrictions. An input formula is in CNF...
research
∙
08/30/2017