3 citations · 9 across the 9 of their papers we have counts for
9 papers
Adding a Tail in Classes of Perfect Graphs
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Consider a graph which belongs to a graph class . We are interested in connecting a node to by a single edge where ; we call su…
The Rectilinear Steiner Forest Arborescence problem
Łukasz Mielewczyk, Leonidas Palios, Paweł Żyliński
Let be a point in the first quadrant of the plane and let be a set of points such that for any , its - and -coordinate is at…
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility
Bengt J. Nilsson, David Orden, Leonidas Palios +2
We present an time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction , w…
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers as reducible permutation flow-graphs…
Capturing points with a rotating polygon (and a 3D extension)
Carlos Alegría-Galicia, David Orden, Leonidas Palios +2
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the ro…
Optimizing generalized kernels of polygons
Alejandra Martinez-Moraian, David Orden, Leonidas Palios +2
Let be a set of orientations in the plane, and let be a simple polygon in the plane. Given two points inside , we say that -\emph{se…