3 papers
cs.DS2023
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…
cs.DS2023
Adding an Edge in a -sparse Graph
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
The minimum completion (fill-in) problem is defined as follows: Given a graph family (more generally, a property ) and a graph , the completion problem asks for…
cs.MM2016
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations
Anna Mpanti, Stavros D. Nikolopoulos
Software watermarking has received considerable attention and was adopted by the software development community as a technique to prevent or discourage software piracy and copyrigh…