An experimental analysis of event set algorithms for discrete event simulation. - Stavros D. Nikolopoulos; Roderick MacLeod (Microprocess. Microprogramming, 1993)

Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. - Stavros D. Nikolopoulos (CONPAR, 1994)

Odd-even, compare-exchange parallel sorting. - Stavros D. Nikolopoulos; Stylianos D. Danielopoulos (Microprocess. Microprogramming, 1994)

Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs. - Stavros D. Nikolopoulos; Stylianos D. Danielopoulos (Parallel Algorithms Appl., 1994)

Constant-Time Parallel Recognition of Split Graphs. - Stavros D. Nikolopoulos (Inf. Process. Lett., 1995)

Parallel Block-finding Using Distance Matrices. - Stavros D. Nikolopoulos (Parallel Algorithms Appl., 1996)

Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph. - Stavros D. Nikolopoulos; Andreas Pitsillides; David Tipper (INFOCOM, 1997)

On complete systems of invariants for small graphs. - Frank Harary; Stavros D. Nikolopoulos (Int. J. Comput. Math., 1997)

Sub-optimal solutions to track detection problem using graph theoretic concepts. - Stavros D. Nikolopoulos; George Samaras (J. Syst. Archit., 1997)

On the Number of Spanning Trees of Multi-Star Related Graphs. - Stavros D. Nikolopoulos; Panos Rondogiannis (Inf. Process. Lett., 1998)

NC Coloring Algorithms for Permutation Graphs. - Maria I. Andreou; Stavros D. Nikolopoulos (Nord. J. Comput., 1999)

Recognizing cographs and threshold graphs through a classification of their edges. - Stavros D. Nikolopoulos (Inf. Process. Lett., 2000)

On the performance of the first-fit coloring algorithm on permutation graphs. - Stavros D. Nikolopoulos; Charis Papadopoulos (Inf. Process. Lett., 2000)

Recognition and Orientation Algorithms for P4-Comparability Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (ISAAC, 2001)

Hamiltonian Cycles in Quasi-threshold Graphs. - Stavros D. Nikolopoulos (Electron. Notes Discret. Math., 2001)

Optimal Gray-code labeling and recognition algorithms for hypercubes. - Stavros D. Nikolopoulos (Inf. Sci., 2001)

On the Recognition of P4-Comparability Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2002)

Coloring permutation graphs in parallel. - Stavros D. Nikolopoulos (Discret. Appl. Math., 2002)

Recognizing Bipolarizable and P 4-Simplicial Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2003)

Counting Spanning Trees in Cographs. - Stavros D. Nikolopoulos; Charis Papadopoulos (Electron. Notes Discret. Math., 2003)

Hole and antihole detection in graphs. - Stavros D. Nikolopoulos; Leonidas Palios (SODA, 2004)

Recognizing HHD-free and Welsh-Powell Opposition Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2004)

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. - Stavros D. Nikolopoulos; Leonidas Palios (Algorithmica, 2004)

On the Strongly Connected and Biconnected Components of the Complement of Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Electron. Notes Discret. Math., 2004)

The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. - Stavros D. Nikolopoulos; Charis Papadopoulos (Graphs Comb., 2004)

A limit characterization for the number of spanning trees of graphs. - Stavros D. Nikolopoulos; Christos Nomikos; Panos Rondogiannis (Inf. Process. Lett., 2004)

Parallel algorithms for P4-comparability graphs. - Stavros D. Nikolopoulos; Leonidas Palios (J. Algorithms, 2004)

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs. - Stavros D. Nikolopoulos (J. Parallel Distributed Comput., 2004)

An Optimal Parallel Co-Connectivity Algorithm. - Ka Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2004)

Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Parallel Process. Lett., 2004)

Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. - Paraskevi Fragopoulou; Stavros D. Nikolopoulos; Leonidas Palios (ISAAC, 2005)

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. - Stavros D. Nikolopoulos; Leonidas Palios (Panhellenic Conference on Informatics, 2005)

Adding an Edge in a Cograph. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2005)

Recognizing HHDS-Free Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2005)

The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs - Stavros D. Nikolopoulos; Charis Papadopoulos (CoRR, 2005)

Efficient parallel recognition of cographs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2005)

On the Recognition of Bipolarizable and P4-simplicial Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math. Theor. Comput. Sci., 2005)

Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. - Dimitrios Koukopoulos; Stavros D. Nikolopoulos (CIAC, 2006)

A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (WG, 2006)

Minimal separators in P4-sparse graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math., 2006)

On the number of spanning trees of Knm±G graphs. - Stavros D. Nikolopoulos; Charis Papadopoulos (Discret. Math. Theor. Comput. Sci., 2006)

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math. Theor. Comput. Sci., 2006)

P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. - Katerina Asdre; Stavros D. Nikolopoulos (J. Comput. Sci. Technol., 2006)

An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (FAW, 2007)

An Experimental Study of Stability in Heterogeneous Networks. - Maria Chroni; Dimitrios Koukopoulos; Stavros D. Nikolopoulos (WEA, 2007)

Detecting Holes and Antiholes in Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Algorithmica, 2007)

The harmonious coloring problem is NP-complete for interval and permutation graphs. - Katerina Asdre; Kyriaki Ioannidou; Stavros D. Nikolopoulos (Discret. Appl. Math., 2007)

On the parallel computation of the biconnected and strongly connected co-components of graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2007)

An optimal parallel solution for the path cover problem on P4-sparse graphs. - Katerina Asdre; Stavros D. Nikolopoulos; Charis Papadopoulos (J. Parallel Distributed Comput., 2007)

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. - Katerina Asdre; Stavros D. Nikolopoulos (Networks, 2007)

NP-completeness results for some problems on subclasses of bipartite and chordal graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Theor. Comput. Sci., 2007)

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. - Katerina Asdre; Stavros D. Nikolopoulos (FAW, 2008)

Optimal Algorithms for Detecting Network Stability. - Dimitrios Koukopoulos; Stavros D. Nikolopoulos; Leonidas Palios; Paul G. Spirakis (WALCOM, 2008)

The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph - Katerina Asdre; Stavros D. Nikolopoulos (CoRR, 2008)

Linear Coloring and Linear Graphs - Kyriaki Ioannidou; Stavros D. Nikolopoulos (CoRR, 2008)

The Longest Path Problem Is Polynomial on Interval Graphs. - Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos (MFCS, 2009)

Colinear Coloring on Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (WALCOM, 2009)

Counting Spanning Trees in Cographs: An Algorithmic Approach. - Stavros D. Nikolopoulos; Charis Papadopoulos (Ars Comb., 2009)

Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Discret. Math., 2009)

Encoding watermark integers as self-inverting permutations. - Maria Chroni; Stavros D. Nikolopoulos (CompSysTech, 2010)

Harmonious Coloring on Subclasses of Colinear Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (WALCOM, 2010)

The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Algorithmica, 2010)

A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Theor. Comput. Sci., 2010)

Encoding watermark numbers as cographs using self-inverting permutations. - Maria Chroni; Stavros D. Nikolopoulos (CompSysTech, 2011)

Counting Spanning Trees in Graphs Using Modular Decomposition. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (WALCOM, 2011)

The Longest Path Problem has a Polynomial Solution on Interval Graphs. - Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos (Algorithmica, 2011)

Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs - Maria Chroni; Stavros D. Nikolopoulos (CoRR, 2011)

A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. - Stavros D. Nikolopoulos; Charis Papadopoulos (Graphs Comb., 2011)

An Efficient Graph Codec System for Software Watermarking. - Maria Chroni; Stavros D. Nikolopoulos (COMPSAC Workshops, 2012)

Multiple encoding of a watermark number into reducible permutation graphs using cotrees. - Maria Chroni; Stavros D. Nikolopoulos (CompSysTech, 2012)

A Watermarking System for Teaching Students to Respect Intellectual Property Rights. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (CSEDU (1), 2012)

An Embedding Graph-based Model for Software Watermarking. - Maria Chroni; Stavros D. Nikolopoulos (IIH-MSP, 2012)

A watermarking system for teaching intellectual property rights: Implementation and performance. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (ITHET, 2012)

Watermarking Images using 2D Representations of Self-inverting Permutations. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (WEBIST, 2012)

An O(nm)-time certifying algorithm for recognizing HHD-free graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Theor. Comput. Sci., 2012)

A fully dynamic algorithm for the recognition of P4-sparse graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Theor. Comput. Sci., 2012)

Watermarking Java application programs using the WaterRpg dynamic model. - Ioannis Chionis; Maria Chroni; Stavros D. Nikolopoulos (CompSysTech, 2013)

Design and Evaluation of a Graph Codec System for Software Watermarking. - Maria Chroni; Stavros D. Nikolopoulos (DATA, 2013)

Evaluating the WaterRpg software watermarking model on Java application programs. - Ioannis Chionis; Maria Chroni; Stavros D. Nikolopoulos (Panhellenic Conference on Informatics, 2013)

A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software. - Ioannis Chionis; Maria Chroni; Stavros D. Nikolopoulos (SECRYPT, 2013)

Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (WEBIST, 2013)

Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (WEBIST (Selected Papers), 2013)

The Longest Path Problem Is Polynomial on Cocomparability Graphs. - Kyriaki Ioannidou; Stavros D. Nikolopoulos (Algorithmica, 2013)

An O(n)-time algorithm for the paired domination problem on permutation graphs. - Evaggelos Lappas; Stavros D. Nikolopoulos; Leonidas Palios (Eur. J. Comb., 2013)

From Image to Audio Watermarking Using Self-Inverting Permutations. - Maria Chroni; Angelos Fylakis; Stavros D. Nikolopoulos (WEBIST (1), 2014)

WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection. - Ioannis Chionis; Maria Chroni; Stavros D. Nikolopoulos (CoRR, 2014)

Detecting Malicious Code by Exploiting Dependencies of System-call Groups. - Stavros D. Nikolopoulos; Iosif Polenakis (CoRR, 2014)

Join-Reachability Problems in Directed Graphs. - Loukas Georgiadis; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2014)

Counting spanning trees using modular decomposition. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Theor. Comput. Sci., 2014)

A graph-based model for malicious code detection exploiting dependencies of system-call groups. - Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2015)

Encoding numbers into reducible permutation graphs using heap-ordered trees. - Maria Chroni; Stavros D. Nikolopoulos (Panhellenic Conference on Informatics, 2015)

Malicious software classification based on relations of system-call groups. - Stavros D. Nikolopoulos; Iosif Polenakis (Panhellenic Conference on Informatics, 2015)

Watermarking PDF Documents using Various Representations of Self-inverting Permutations. - Maria Chroni; Stavros D. Nikolopoulos (WEBIST, 2015)

A Model for Establishing Response-time Bounds to Prevent Malware Pandemics in Mobile Devices. - Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2016)

Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations. - Anna Mpanti; Stavros D. Nikolopoulos (PCI, 2016)

Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations. - Anna Mpanti; Stavros D. Nikolopoulos (CoRR, 2016)

Defending Hardware-based Attacks on Trusted Computing using a Hardware-Integrity Attestation Protocol. - Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2017)

Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications. - Anna Mpanti; Stavros D. Nikolopoulos; Maria Rini (PCI, 2017)

Preventing malware pandemics in mobile devices by establishing response-time bounds. - Stavros D. Nikolopoulos; Iosif Polenakis (J. Inf. Secur. Appl., 2017)

A graph-based model for malware detection and classification using system-call groups. - Stavros D. Nikolopoulos; Iosif Polenakis (J. Comput. Virol. Hacking Tech., 2017)

A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups. - Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2018)

Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations. - Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (CoRR, 2018)

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (CoRR, 2018)

Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. - Maria Chroni; Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2018)

Strong triadic closure in cographs and graphs of low maximum degree. - Athanasios L. Konstantinidis; Stavros D. Nikolopoulos; Charis Papadopoulos (Theor. Comput. Sci., 2018)

Malicious Software Detection utilizing Temporal-Graphs. - Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2019)

An Algorithmic Framework for Malicious Software Detection Exploring Structural Characteristics of Behavioral Graphs. - Alvaro Chysi; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2020)

Detection and Classification of Malicious Software based on Regional Matching of Temporal Graphs. - Helen-Maria Dounavi; Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2021)

SARiSsa - A Mobile Application for the Proactive Control of SARS-CoV-2 Spread. - Christos Chondros; Christos Georgiou-Mousses; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (CoRR, 2021)

A Stochastic Graph-based Model for the Simulation of SARS-CoV-2 Transmission. - Christos Chondros; Stavros D. Nikolopoulos; Iosif Polenakis (CoRR, 2021)

A graph-based framework for malicious software detection and classification utilizing temporal-graphs. - Helen-Maria Dounavi; Anna Mpanti; Stavros D. Nikolopoulos; Iosif Polenakis (J. Comput. Secur., 2021)

A Synonym-based Approach for the Semantic Indexing of Texts. - Georgios Grigoriadis Kotsalis; Stavros D. Nikolopoulos; Iosif Polenakis (CompSysTech, 2022)

A Repetitive Watermarking Scheme for Digital Images based on Self-Inverting Permutations. - Maria Chroni; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (IISA, 2022)

Digital Image Watermarking using Self Inverting Permutations - A Comparative Study. - Maria Chroni; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (IISA, 2022)

A Multiple Watermarking Scheme for Digital Audio Signals. - Maria Chroni; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (PCI, 2022)

An Experimental Study of Algorithms for Packing Arborescences. - Loukas Georgiadis; Dionysios Kefallinos; Anna Mpanti; Stavros D. Nikolopoulos (SEA, 2022)

An integrated simulation framework for the prevention and mitigation of pandemics caused by airborne pathogens. - Christos Chondros; Stavros D. Nikolopoulos; Iosif Polenakis (Netw. Model. Anal. Health Informatics Bioinform., 2022)

Behavior-based detection and classification of malicious software utilizing structural characteristics of group sequence graphs. - Stavros D. Nikolopoulos; Iosif Polenakis (J. Comput. Virol. Hacking Tech., 2022)

Tamper Detection and Localization in Forensic Images. - Maria Chroni; Athanasia Katsi; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (CompSysTech, 2023)

A Code-Based Multiple Watermarking Scheme for the Preservation of Authenticity of Forensic Images. - Maria Chroni; Stavros D. Nikolopoulos; Iosif Polenakis; Vasileios Vouronikos (IISA, 2023)

Adding an Edge in a P4-sparse Graph. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (CoRR, 2023)

Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (J. Comput. Secur., 2023)

Detection and classification of malicious software utilizing Max-Flows between system-call groups. - Alvaro Chysi; Stavros D. Nikolopoulos; Iosif Polenakis (J. Comput. Virol. Hacking Tech., 2023)

Adding a Tail in Classes of Perfect Graphs. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (Algorithms, 2023)

ProtAIN: Protecting the Authenticity and Integrity Properties of NFT Images. - Iosif Polenakis; Vasileios Vouronikos; Eftychia Kiafa; Maria Chroni; Stavros D. Nikolopoulos (CompSysTech, 2024)

Towards a real-time distributed feedback system for the transportation assistance of PwD. - Iosif Polenakis; Vasileios Vouronikos; Maria Chroni; Stavros D. Nikolopoulos (CoRR, 2024)