For a graph G = (V,E) where each vertex is coloured by one of k colours,...
We show that the Max-Cut problem is NP-complete on interval graphs of
in...
Given a simple polygon P, in the Art Gallery problem, the goal is to
fin...
This paper studies a variant of the Art-gallery problem in which "walls"...
We study the complexity of finding the geodetic number on subclasses
of ...
We resolve the longstanding open problem concerning the computational
co...
In this paper, we study the computational complexity of finding the
geod...
We study the problem of colouring visibility graphs of polygons. In
part...
We study the problem of colouring the vertices of a polygon, such that e...
Over the past two decades the main focus of research into first-order (F...
We consider extending visibility polygon (VP) of a given point q
(VP(q))...
We study the problem of assigning non-overlapping geometric objects cent...