A beer graph is an undirected graph G, in which each edge has a
positive...
Chvátal and Klincsek (1980) gave an O(n^3)-time algorithm for the
proble...
We study upward planar straight-line embeddings (UPSE) of directed trees...
A 1-bend boundary labelling problem consists of an axis-aligned rectangl...
A 2-interval is the union of two disjoint intervals on the real line.
Tw...
We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
Consider a set P of n points on the boundary of an axis-aligned square
Q...
Let S and D each be a set of orthogonal line segments in the plane. A
li...
A strict orthogonal drawing of a graph G=(V, E) in R^2 is a
drawing of G...
A graph G with n vertices is called an outerstring graph if it has an
in...
Consider k robots initially located at a point inside a region T. Each
r...
Let P be a polygon with r>0 reflex vertices and possibly with holes and
...
Let P be a set of n colored points in the plane. Introduced by Hart
(196...
In COCOA 2015, Korman et al. studied the following geometric covering
pr...
Given a set of n points (sites) inside a rectangle R and n points
(label...
We consider the Minimum Dominating Set (MDS) problem on the intersection...
We consider the Dominating Set (DS) problem on the intersection graphs o...
An obstacle representation of a graph is a mapping of the vertices onto
...
A graph G is called B_k-VPG, for some constant k≥ 0, if it has a
string ...
In this paper, we study grid-obstacle representations of graphs where we...
There exist many variants of guarding an orthogonal polygon in an orthog...