6 citations · 19 across the 17 of their papers we have counts for
5 papers · 1 filter
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…
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations
Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
Several graph theoretic watermark methods have been proposed to encode numbers as graph structures in software watermarking environments. In this paper, we propose an efficient and…
Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs
Maria Chroni, Stavros D. Nikolopoulos
In a software watermarking environment, several graph theoretic watermark methods use numbers as watermark values, where some of these methods encode the watermark numbers as graph…
Join-Reachability Problems in Directed Graphs
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
For a given collection G of directed graphs we define the join-reachability graph of G, denoted by J(G), as the directed graph that, for any pair of vertices a and b, contains a pa…
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
Katerina Asdre, Stavros D. Nikolopoulos
We consider a variant of the path cover problem, namely, the -fixed-endpoint path cover problem, or kPC for short, on interval graphs. Given a graph and a subset $\mathcal{T…