Stavros D. Nikolopoulos

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 36

Top Venues

CoRR

CompSysTech

J. Comput. Virol. Hacking Tech.

IISA

Publications

Iosif Polenakis, Vasileios Vouronikos, Maria Chroni, Stavros D. Nikolopoulos
Towards a real-time distributed feedback system for the transportation assistance of PwD. CoRR (2024)
Alvaro Chysi, Stavros D. Nikolopoulos, Iosif Polenakis
Detection and classification of malicious software utilizing Max-Flows between system-call groups. J. Comput. Virol. Hacking Tech. 19 (1) (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Adding a Tail in Classes of Perfect Graphs. Algorithms 16 (6) (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. 31 (2) (2023)
Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
A Code-Based Multiple Watermarking Scheme for the Preservation of Authenticity of Forensic Images. IISA (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
-sparse Graph. CoRR (2023)
Maria Chroni, Athanasia Katsi, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
Tamper Detection and Localization in Forensic Images. CompSysTech (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Adding a Tail in Classes of Perfect Graphs. CoRR (2023)
Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos
An Experimental Study of Algorithms for Packing Arborescences. SEA (2022)
Christos Chondros, Stavros D. Nikolopoulos, Iosif Polenakis
An integrated simulation framework for the prevention and mitigation of pandemics caused by airborne pathogens. Netw. Model. Anal. Health Informatics Bioinform. 11 (1) (2022)
Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
A Repetitive Watermarking Scheme for Digital Images based on Self-Inverting Permutations. IISA (2022)
Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
Digital Image Watermarking using Self Inverting Permutations - A Comparative Study. IISA (2022)
Georgios Grigoriadis Kotsalis, Stavros D. Nikolopoulos, Iosif Polenakis
A Synonym-based Approach for the Semantic Indexing of Texts. CompSysTech (2022)
Stavros D. Nikolopoulos, Iosif Polenakis
Behavior-based detection and classification of malicious software utilizing structural characteristics of group sequence graphs. J. Comput. Virol. Hacking Tech. 18 (4) (2022)
Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
A Multiple Watermarking Scheme for Digital Audio Signals. PCI (2022)
Helen-Maria Dounavi, Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
A graph-based framework for malicious software detection and classification utilizing temporal-graphs. J. Comput. Secur. 29 (6) (2021)
Helen-Maria Dounavi, Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
Detection and Classification of Malicious Software based on Regional Matching of Temporal Graphs. CompSysTech (2021)
Christos Chondros, Christos Georgiou-Mousses, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
SARiSsa - A Mobile Application for the Proactive Control of SARS-CoV-2 Spread. CoRR (2021)
Christos Chondros, Stavros D. Nikolopoulos, Iosif Polenakis
A Stochastic Graph-based Model for the Simulation of SARS-CoV-2 Transmission. CoRR (2021)
Alvaro Chysi, Stavros D. Nikolopoulos, Iosif Polenakis
An Algorithmic Framework for Malicious Software Detection Exploring Structural Characteristics of Behavioral Graphs. CompSysTech (2020)
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
Malicious Software Detection utilizing Temporal-Graphs. CompSysTech (2019)
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations. CoRR (2018)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR (2018)
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740 (2018)
Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. 250 (2018)
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups. CompSysTech (2018)
Stavros D. Nikolopoulos, Iosif Polenakis
A graph-based model for malware detection and classification using system-call groups. J. Comput. Virol. Hacking Tech. 13 (1) (2017)
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON (2017)
Stavros D. Nikolopoulos, Iosif Polenakis
Preventing malware pandemics in mobile devices by establishing response-time bounds. J. Inf. Secur. Appl. 37 (2017)
Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
Defending Hardware-based Attacks on Trusted Computing using a Hardware-Integrity Attestation Protocol. CompSysTech (2017)
Anna Mpanti, Stavros D. Nikolopoulos, Maria Rini
Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications. PCI (2017)
Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR (2017)
Stavros D. Nikolopoulos, Iosif Polenakis
A Model for Establishing Response-time Bounds to Prevent Malware Pandemics in Mobile Devices. CompSysTech (2016)
Anna Mpanti, Stavros D. Nikolopoulos
Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations. PCI (2016)
Anna Mpanti, Stavros D. Nikolopoulos
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations. CoRR (2016)
Stavros D. Nikolopoulos, Iosif Polenakis
Preventing Malware Pandemics in Mobile Devices by Establishing Response-time Bounds. CoRR (2016)
Stavros D. Nikolopoulos, Iosif Polenakis
A graph-based model for malicious code detection exploiting dependencies of system-call groups. CompSysTech (2015)
Maria Chroni, Stavros D. Nikolopoulos
Watermarking PDF Documents using Various Representations of Self-inverting Permutations. WEBIST (2015)
Stavros D. Nikolopoulos, Iosif Polenakis
Malicious software classification based on relations of system-call groups. Panhellenic Conference on Informatics (2015)
Maria Chroni, Stavros D. Nikolopoulos
Encoding numbers into reducible permutation graphs using heap-ordered trees. Panhellenic Conference on Informatics (2015)
Maria Chroni, Stavros D. Nikolopoulos
Watermarking PDF Documents using Various Representations of Self-inverting Permutations. CoRR (2015)
Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection. CoRR (2014)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
From Image to Audio Watermarking Using Self-Inverting Permutations. WEBIST (1) (2014)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55 (2) (2014)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526 (2014)
Stavros D. Nikolopoulos, Iosif Polenakis
Detecting Malicious Code by Exploiting Dependencies of System-call Groups. CoRR (2014)
Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software. SECRYPT (2013)
Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
Evaluating the WaterRpg software watermarking model on Java application programs. Panhellenic Conference on Informatics (2013)
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
An O(n)-time algorithm for the paired domination problem on permutation graphs. Eur. J. Comb. 34 (3) (2013)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues. WEBIST (Selected Papers) (2013)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations. WEBIST (2013)
Maria Chroni, Stavros D. Nikolopoulos
Design and Evaluation of a Graph Codec System for Software Watermarking. DATA (2013)
Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
Watermarking Java application programs using the WaterRpg dynamic model. CompSysTech (2013)
Kyriaki Ioannidou, Stavros D. Nikolopoulos
The Longest Path Problem Is Polynomial on Cocomparability Graphs. Algorithmica 65 (1) (2013)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
A Watermarking System for Teaching Students to Respect Intellectual Property Rights. CSEDU (1) (2012)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-sparse graphs. Theor. Comput. Sci. 439 (2012)
Maria Chroni, Stavros D. Nikolopoulos
An Efficient Graph Codec System for Software Watermarking. COMPSAC Workshops (2012)
Maria Chroni, Stavros D. Nikolopoulos
An Embedding Graph-based Model for Software Watermarking. IIH-MSP (2012)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
Watermarking Images using 2D Representations of Self-inverting Permutations. WEBIST (2012)
Maria Chroni, Stavros D. Nikolopoulos
Multiple encoding of a watermark number into reducible permutation graphs using cotrees. CompSysTech (2012)
Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
A watermarking system for teaching intellectual property rights: Implementation and performance. ITHET (2012)
Stavros D. Nikolopoulos, Leonidas Palios
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452 (2012)
Maria Chroni, Stavros D. Nikolopoulos
Encoding watermark numbers as cographs using self-inverting permutations. CompSysTech (2011)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM (2011)
Maria Chroni, Stavros D. Nikolopoulos
Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs CoRR (2011)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs. CSR (2011)
Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
The Longest Path Problem has a Polynomial Solution on Interval Graphs. Algorithmica 61 (2) (2011)
Stavros D. Nikolopoulos, Charis Papadopoulos
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. 27 (4) (2011)
Katerina Asdre, Stavros D. Nikolopoulos
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica 58 (3) (2010)
Katerina Asdre, Stavros D. Nikolopoulos
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs. Theor. Comput. Sci. 411 (7-9) (2010)
Kyriaki Ioannidou, Stavros D. Nikolopoulos
Harmonious Coloring on Subclasses of Colinear Graphs. WALCOM (2010)
Maria Chroni, Stavros D. Nikolopoulos
Encoding watermark integers as self-inverting permutations. CompSysTech (2010)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs CoRR (2010)
Kyriaki Ioannidou, Stavros D. Nikolopoulos
The Longest Path Problem is Polynomial on Cocomparability Graphs. WG (2010)
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA (2009)
Stavros D. Nikolopoulos, Charis Papadopoulos
Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. 90 (2009)
Stavros D. Nikolopoulos, Charis Papadopoulos
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW (2009)
Kyriaki Ioannidou, Stavros D. Nikolopoulos
Colinear Coloring on Graphs. WALCOM (2009)
Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
The Longest Path Problem Is Polynomial on Interval Graphs. MFCS (2009)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-complements of asteroidal graphs. Discret. Math. 309 (10) (2009)
Katerina Asdre, Stavros D. Nikolopoulos
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph CoRR (2008)
Katerina Asdre, Stavros D. Nikolopoulos
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. FAW (2008)
Kyriaki Ioannidou, Stavros D. Nikolopoulos
Linear Coloring and Linear Graphs CoRR (2008)
Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis
Optimal Algorithms for Detecting Network Stability. WALCOM (2008)
Katerina Asdre, Stavros D. Nikolopoulos
NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381 (1-3) (2007)
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
The harmonious coloring problem is NP-complete for interval and permutation graphs. Discret. Appl. Math. 155 (17) (2007)
Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos
An Experimental Study of Stability in Heterogeneous Networks. WEA (2007)
Stavros D. Nikolopoulos, Leonidas Palios
)-Time Certifying Algorithm for Recognizing HHD-Free Graphs. FAW (2007)
Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
-sparse graphs. J. Parallel Distributed Comput. 67 (1) (2007)
Stavros D. Nikolopoulos, Leonidas Palios
On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. 155 (14) (2007)
Katerina Asdre, Stavros D. Nikolopoulos
-fixed-endpoint path cover problem on cographs. Networks 50 (4) (2007)
Stavros D. Nikolopoulos, Leonidas Palios
Detecting Holes and Antiholes in Graphs. Algorithmica 47 (2) (2007)
Katerina Asdre, Stavros D. Nikolopoulos
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. J. Comput. Sci. Technol. 21 (1) (2006)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-Sparse Graphs. WG (2006)
Stavros D. Nikolopoulos, Leonidas Palios
-sparse graphs. Discret. Math. 306 (3) (2006)
Stavros D. Nikolopoulos, Charis Papadopoulos
graphs. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Dimitrios Koukopoulos, Stavros D. Nikolopoulos
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. CIAC (2006)
Stavros D. Nikolopoulos, Leonidas Palios
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics (2005)
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC (2005)

Stavros D. Nikolopoulos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stavros D. Nikolopoulos