scispace - formally typeset
S

Stavros D. Nikolopoulos

Researcher at University of Ioannina

Publications -  159
Citations -  1512

Stavros D. Nikolopoulos is an academic researcher from University of Ioannina. The author has contributed to research in topics: Chordal graph & Indifference graph. The author has an hindex of 20, co-authored 148 publications receiving 1377 citations. Previous affiliations of Stavros D. Nikolopoulos include Pierre-and-Marie-Curie University & National and Kapodistrian University of Athens.

Papers
More filters
Journal ArticleDOI

A graph-based framework for malicious software detection and classification utilizing temporal-graphs

TL;DR: A graph-based framework that, utilizing relations between groups of System-calls, detects whether an unknown software sample is malicious or benign, and classifies a malicious software to one of a set of known malware families.
Posted Content

Watermarking PDF Documents using Various Representations of Self-inverting Permutations

TL;DR: This work provides to web users copyright protection of their Portable Document Format (PDF) documents by proposing efficient and easily implementable techniques for PDF watermarking; these techniques are based on the ideas of recently proposed water marking techniques for software, image, and audio.
Journal ArticleDOI

Join-Reachability Problems in Directed Graphs

TL;DR: In this article, the authors consider two versions of the join-reachability problem, the explicit and implicit versions, and present optimal and near-optimal structures for paths and trees.
Journal ArticleDOI

An integrated simulation framework for the prevention and mitigation of pandemics caused by airborne pathogens

TL;DR: In this paper , the authors developed an integrated simulation framework for pandemic prevention and mitigation of pandemics caused by airborne pathogens, incorporating three sub-models, namely the spatial model, the mobility model, and the propagation model, to create a realistic simulation environment for the evaluation of different countermeasures on the epidemic dynamics.
Book ChapterDOI

The Number of Spanning Trees in P4-Reducible Graphs

TL;DR: In this paper, the authors presented an algorithm for computing the number of spanning trees in a P 4-reducible graph in O(n+m) time and space, where the complexity of arithmetic operations is measured under the uniform cost criterion.