research
∙
09/19/2019
Hardness and approximation for the geodetic set problem in some graph classes
In this paper, we study the computational complexity of finding the geod...
share
research
∙
04/18/2019
On conflict-free chromatic guarding of simple polygons
We study the problem of colouring the vertices of a polygon, such that e...
research
∙
12/15/2017
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
The art gallery problem enquires about the least number of guards suffic...
research
∙
09/22/2015
