research
∙
03/04/2023
Some results on Minimum Consistent Subsets of Trees
For a graph G = (V,E) where each vertex is coloured by one of k colours,...
share
research
∙
03/13/2022
Maximum cut on interval graphs of interval count two is NP-complete
We show that the Max-Cut problem is NP-complete on interval graphs of in...
research
∙
08/24/2021
Art Gallery Plus Single Specular-reflection
Given a simple polygon P, in the Art Gallery problem, the goal is to fin...
research
∙
11/05/2020
Visibility Extension via Reflection
This paper studies a variant of the Art-gallery problem in which "walls"...
research
∙
06/30/2020
Algorithms and complexity for geodetic sets on planar and chordal graphs
We study the complexity of finding the geodetic number on subclasses of ...
research
∙
05/29/2020
Complexity of Maximum Cut on Interval Graphs
We resolve the longstanding open problem concerning the computational co...
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...
research
∙
06/05/2019
On Colourability of Polygon Visibility Graphs
We study the problem of colouring visibility graphs of polygons. In part...
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
∙
09/12/2017
FO model checking of geometric graphs
Over the past two decades the main focus of research into first-order (F...
research
∙
07/29/2017
Expanding Visibility Polygons by Mirrors upto at least K units
We consider extending visibility polygon (VP) of a given point q (VP(q))...
research
∙
05/25/2017
