Consider a graph G which belongs to a graph class C. We are
interested i...
The minimum completion (fill-in) problem is defined as follows: Given a ...
Let r be a point in the first quadrant Q_1 of the plane ℝ^2
and let P ⊂ ...
We present an O(nrG) time algorithm for computing and maintaining a mini...
In the domain of software watermarking, we have proposed several graph
t...
We study the problem of rotating a simple polygon to contain the maximum...
Given a set O of k orientations in the plane, two points inside
a simple...
Several graph theoretic watermark methods have been proposed to encode
n...