7 papers
Duration-Aware Dissimilarity in Temporal Networks
Giuseppe F. Italiano, Anna Mpanti
Temporal-network comparison becomes substantially more challenging when interactions are associated with explicit traversal times, since both event timing and duration determine te…
Beer Path Problems in Temporal Graphs
Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos +3
Computing paths in graph structures is a fundamental operation in a wide range of applications, from transportation networks to data analysis. The beer path problem, which captures…
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…
Adding an Edge in a -sparse Graph
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
For a graph family~, the minimum -completion problem asks for the minimum number of non-edges to be added to a given graph~ so that the resulting graph belon…
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…
Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
In this work we propose a graph-based model that, utilizing relations between groups of System-calls, distinguishes malicious from benign software samples and classifies the detect…
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…