A disk graph is an intersection graph of disks in the Euclidean plane, w...
Given a set P of points in the plane, a point burning process is a discr...
Given a set P of points and a set U of axis-parallel unit squares in the...
The burning process on a graph G starts with a single burnt vertex, and ...
Chvátal and Klincsek (1980) gave an O(n^3)-time algorithm for the
proble...
A grounded 1-bend string graph is an intersection graph of a set of poly...
A graph G with n vertices is called an outerstring graph if it has an
in...
Let P be a polygon with r>0 reflex vertices and possibly with holes and
...
Given a set of n points (sites) inside a rectangle R and n points
(label...
We investigate the computational complexity of the following problem. We...