Stavros D. Nikolopoulos

141 papers A* 2B 15C 9Misc 5Journal 78Unranked 32

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A code-based multiple watermarking scheme for the preservation of authenticity of digital video. Multim. Tools Appl. Iosif Polenakis, Vasileios Vouronikos, Konstantinos Balis, Stavros D. Nikolopoulos
2025	J	`jnl`	A PDF watermarking scheme utilizing invisible QR code embedding in the spatial domain. J. Comput. Secur. Iosif Polenakis, Vasileios Vouronikos, Angjele Merolli, Stavros D. Nikolopoulos
2024	—	`conf`	ProtAIN: Protecting the Authenticity and Integrity Properties of NFT Images. CompSysTech Iosif Polenakis, Vasileios Vouronikos, Eftychia Kiafa, Maria Chroni, Stavros D. Nikolopoulos
2024	J	`jnl`	Towards a real-time distributed feedback system for the transportation assistance of PwD. CoRR Iosif Polenakis, Vasileios Vouronikos, Maria Chroni, Stavros D. Nikolopoulos
2023	—	`conf`	A Code-Based Multiple Watermarking Scheme for the Preservation of Authenticity of Forensic Images. IISA Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2023	J	`jnl`	Adding a Tail in Classes of Perfect Graphs. Algorithms Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
2023	J	`jnl`	Adding a Tail in Classes of Perfect Graphs. CoRR Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
2023	J	`jnl`	Adding an Edge in a P CoRR Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
2023	J	`jnl`	Detection and classification of malicious software utilizing Max-Flows between system-call groups. J. Comput. Virol. Hacking Tech. Alvaro Chysi, Stavros D. Nikolopoulos, Iosif Polenakis
2023	J	`jnl`	Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
2023	—	`conf`	Tamper Detection and Localization in Forensic Images. CompSysTech Maria Chroni, Athanasia Katsi, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2022	—	`conf`	A Multiple Watermarking Scheme for Digital Audio Signals. PCI Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2022	—	`conf`	A Repetitive Watermarking Scheme for Digital Images based on Self-Inverting Permutations. IISA Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2022	—	`conf`	A Synonym-based Approach for the Semantic Indexing of Texts. CompSysTech Georgios Grigoriadis Kotsalis, Stavros D. Nikolopoulos, Iosif Polenakis
2022	B	`conf`	An Experimental Study of Algorithms for Packing Arborescences. SEA Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos
2022	J	`jnl`	An integrated simulation framework for the prevention and mitigation of pandemics caused by airborne pathogens. Netw. Model. Anal. Health Informatics Bioinform. Christos Chondros, Stavros D. Nikolopoulos, Iosif Polenakis
2022	J	`jnl`	Behavior-based detection and classification of malicious software utilizing structural characteristics of group sequence graphs. J. Comput. Virol. Hacking Tech. Stavros D. Nikolopoulos, Iosif Polenakis
2022	—	`conf`	Digital Image Watermarking using Self Inverting Permutations - A Comparative Study. IISA Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2021	J	`jnl`	A Stochastic Graph-based Model for the Simulation of SARS-CoV-2 Transmission. CoRR Christos Chondros, Stavros D. Nikolopoulos, Iosif Polenakis
2021	J	`jnl`	A graph-based framework for malicious software detection and classification utilizing temporal-graphs. J. Comput. Secur. Helen-Maria Dounavi, Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2021	—	`conf`	Detection and Classification of Malicious Software based on Regional Matching of Temporal Graphs. CompSysTech Helen-Maria Dounavi, Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2021	J	`jnl`	SARiSsa - A Mobile Application for the Proactive Control of SARS-CoV-2 Spread. CoRR Christos Chondros, Christos Georgiou-Mousses, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos
2020	—	`conf`	An Algorithmic Framework for Malicious Software Detection Exploring Structural Characteristics of Behavioral Graphs. CompSysTech Alvaro Chysi, Stavros D. Nikolopoulos, Iosif Polenakis
2019	—	`conf`	Malicious Software Detection utilizing Temporal-Graphs. CompSysTech Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2018	—	`conf`	A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups. CompSysTech Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2018	J	`jnl`	Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
2018	J	`jnl`	Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
2018	J	`jnl`	Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations. CoRR Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2018	J	`jnl`	Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
2017	J	`jnl`	A graph-based model for malware detection and classification using system-call groups. J. Comput. Virol. Hacking Tech. Stavros D. Nikolopoulos, Iosif Polenakis
2017	—	`conf`	Defending Hardware-based Attacks on Trusted Computing using a Hardware-Integrity Attestation Protocol. CompSysTech Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis
2017	J	`jnl`	Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
2017	—	`conf`	Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications. PCI Anna Mpanti, Stavros D. Nikolopoulos, Maria Rini
2017	J	`jnl`	Preventing malware pandemics in mobile devices by establishing response-time bounds. J. Inf. Secur. Appl. Stavros D. Nikolopoulos, Iosif Polenakis
2017	Misc	`conf`	Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
2016	—	`conf`	A Model for Establishing Response-time Bounds to Prevent Malware Pandemics in Mobile Devices. CompSysTech Stavros D. Nikolopoulos, Iosif Polenakis
2016	—	`conf`	Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations. PCI Anna Mpanti, Stavros D. Nikolopoulos
2016	J	`jnl`	Preventing Malware Pandemics in Mobile Devices by Establishing Response-time Bounds. CoRR Stavros D. Nikolopoulos, Iosif Polenakis
2016	J	`jnl`	Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations. CoRR Anna Mpanti, Stavros D. Nikolopoulos
2015	—	`conf`	A graph-based model for malicious code detection exploiting dependencies of system-call groups. CompSysTech Stavros D. Nikolopoulos, Iosif Polenakis
2015	—	`conf`	Encoding numbers into reducible permutation graphs using heap-ordered trees. Panhellenic Conference on Informatics Maria Chroni, Stavros D. Nikolopoulos
2015	—	`conf`	Malicious software classification based on relations of system-call groups. Panhellenic Conference on Informatics Stavros D. Nikolopoulos, Iosif Polenakis
2015	C	`conf`	Watermarking PDF Documents using Various Representations of Self-inverting Permutations. WEBIST Maria Chroni, Stavros D. Nikolopoulos
2015	J	`jnl`	Watermarking PDF Documents using Various Representations of Self-inverting Permutations. CoRR Maria Chroni, Stavros D. Nikolopoulos
2014	J	`jnl`	Counting spanning trees using modular decomposition. Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2014	J	`jnl`	Detecting Malicious Code by Exploiting Dependencies of System-call Groups. CoRR Stavros D. Nikolopoulos, Iosif Polenakis
2014	—	`conf`	From Image to Audio Watermarking Using Self-Inverting Permutations. WEBIST (1) Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2014	J	`jnl`	Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2014	J	`jnl`	WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection. CoRR Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
2013	C	`conf`	A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software. SECRYPT Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
2013	J	`jnl`	An O(n)-time algorithm for the paired domination problem on permutation graphs. Eur. J. Comb. Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
2013	C	`conf`	Design and Evaluation of a Graph Codec System for Software Watermarking. DATA Maria Chroni, Stavros D. Nikolopoulos
2013	—	`conf`	Evaluating the WaterRpg software watermarking model on Java application programs. Panhellenic Conference on Informatics Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
2013	J	`jnl`	The Longest Path Problem Is Polynomial on Cocomparability Graphs. Algorithmica Kyriaki Ioannidou, Stavros D. Nikolopoulos
2013	—	`conf`	Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues. WEBIST (Selected Papers) Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2013	C	`conf`	Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations. WEBIST Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2013	—	`conf`	Watermarking Java application programs using the WaterRpg dynamic model. CompSysTech Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos
2012	—	`conf`	A Watermarking System for Teaching Students to Respect Intellectual Property Rights. CSEDU (1) Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2012	J	`jnl`	A fully dynamic algorithm for the recognition of P Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2012	—	`conf`	A watermarking system for teaching intellectual property rights: Implementation and performance. ITHET Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2012	—	`conf`	An Efficient Graph Codec System for Software Watermarking. COMPSAC Workshops Maria Chroni, Stavros D. Nikolopoulos
2012	—	`conf`	An Embedding Graph-based Model for Software Watermarking. IIH-MSP Maria Chroni, Stavros D. Nikolopoulos
2012	J	`jnl`	An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios
2012	—	`conf`	Multiple encoding of a watermark number into reducible permutation graphs using cotrees. CompSysTech Maria Chroni, Stavros D. Nikolopoulos
2012	C	`conf`	Watermarking Images using 2D Representations of Self-inverting Permutations. WEBIST Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos
2011	J	`jnl`	A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2011	B	`conf`	Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2011	J	`jnl`	Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs CoRR Maria Chroni, Stavros D. Nikolopoulos
2011	—	`conf`	Encoding watermark numbers as cographs using self-inverting permutations. CompSysTech Maria Chroni, Stavros D. Nikolopoulos
2011	Misc	`conf`	Join-Reachability Problems in Directed Graphs. CSR Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2011	J	`jnl`	The Longest Path Problem has a Polynomial Solution on Interval Graphs. Algorithmica Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
2010	J	`jnl`	A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs. Theor. Comput. Sci. Katerina Asdre, Stavros D. Nikolopoulos
2010	—	`conf`	Encoding watermark integers as self-inverting permutations. CompSysTech Maria Chroni, Stavros D. Nikolopoulos
2010	B	`conf`	Harmonious Coloring on Subclasses of Colinear Graphs. WALCOM Kyriaki Ioannidou, Stavros D. Nikolopoulos
2010	J	`jnl`	Join-Reachability Problems in Directed Graphs CoRR Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2010	J	`jnl`	The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica Katerina Asdre, Stavros D. Nikolopoulos
2010	B	`conf`	The Longest Path Problem is Polynomial on Cocomparability Graphs. WG Kyriaki Ioannidou, Stavros D. Nikolopoulos
2009	C	`conf`	A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW Stavros D. Nikolopoulos, Charis Papadopoulos
2009	C	`conf`	An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
2009	B	`conf`	Colinear Coloring on Graphs. WALCOM Kyriaki Ioannidou, Stavros D. Nikolopoulos
2009	J	`jnl`	Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2009	J	`jnl`	Maximizing the number of spanning trees in K Discret. Math. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2009	B	`conf`	The Longest Path Problem Is Polynomial on Interval Graphs. MFCS Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
2008	J	`jnl`	Linear Coloring and Linear Graphs CoRR Kyriaki Ioannidou, Stavros D. Nikolopoulos
2008	B	`conf`	Optimal Algorithms for Detecting Network Stability. WALCOM Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis
2008	J	`jnl`	The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph CoRR Katerina Asdre, Stavros D. Nikolopoulos
2008	Misc	`conf`	The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. FAW Katerina Asdre, Stavros D. Nikolopoulos
2007	J	`jnl`	A linear-time algorithm for the Networks Katerina Asdre, Stavros D. Nikolopoulos
2007	Misc	`conf`	An FAW Stavros D. Nikolopoulos, Leonidas Palios
2007	—	`conf`	An Experimental Study of Stability in Heterogeneous Networks. WEA Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos
2007	J	`jnl`	An optimal parallel solution for the path cover problem on P J. Parallel Distributed Comput. Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
2007	J	`jnl`	Detecting Holes and Antiholes in Graphs. Algorithmica Stavros D. Nikolopoulos, Leonidas Palios
2007	J	`jnl`	NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. Katerina Asdre, Stavros D. Nikolopoulos
2007	J	`jnl`	On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. Stavros D. Nikolopoulos, Leonidas Palios
2007	J	`jnl`	The harmonious coloring problem is NP-complete for interval and permutation graphs. Discret. Appl. Math. Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
2006	B	`conf`	A Fully Dynamic Algorithm for the Recognition of WG Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2006	C	`conf`	Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. CIAC Dimitrios Koukopoulos, Stavros D. Nikolopoulos
2006	J	`jnl`	Minimal separators in Discret. Math. Stavros D. Nikolopoulos, Leonidas Palios
2006	J	`jnl`	On the number of spanning trees of K Discret. Math. Theor. Comput. Sci. Stavros D. Nikolopoulos, Charis Papadopoulos
2006	J	`jnl`	P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. J. Comput. Sci. Technol. Katerina Asdre, Stavros D. Nikolopoulos
2006	J	`jnl`	Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios
2005	B	`conf`	Adding an Edge in a Cograph. WG Stavros D. Nikolopoulos, Leonidas Palios
2005	J	`jnl`	Efficient parallel recognition of cographs. Discret. Appl. Math. Stavros D. Nikolopoulos, Leonidas Palios
2005	—	`conf`	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics Stavros D. Nikolopoulos, Leonidas Palios
2005	B	`conf`	Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios
2005	J	`jnl`	On the Recognition of Bipolarizable and Discret. Math. Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios
2005	Misc	`conf`	P-tree structures and event horizon: efficient event-set implementations. WSC Katerina Asdre, Stavros D. Nikolopoulos
2005	B	`conf`	Recognizing HHDS-Free Graphs. WG Stavros D. Nikolopoulos, Leonidas Palios
2005	J	`jnl`	The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs CoRR Stavros D. Nikolopoulos, Charis Papadopoulos
2004	J	`jnl`	A limit characterization for the number of spanning trees of graphs. Inf. Process. Lett. Stavros D. Nikolopoulos, Christos Nomikos, Panos Rondogiannis
2004	J	`jnl`	Algorithms for P Algorithmica Stavros D. Nikolopoulos, Leonidas Palios
2004	J	`jnl`	An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios
2004	A*	`conf`	Hole and antihole detection in graphs. SODA Stavros D. Nikolopoulos, Leonidas Palios
2004	C	`conf`	On the Strongly Connected and Biconnected Components of the Complement of Graphs. CTW Stavros D. Nikolopoulos, Leonidas Palios
2004	J	`jnl`	On the Strongly Connected and Biconnected Components of the Complement of Graphs. Electron. Notes Discret. Math. Stavros D. Nikolopoulos, Leonidas Palios
2004	J	`jnl`	Parallel Algorithms For Recognizing P5-Free And P Parallel Process. Lett. Stavros D. Nikolopoulos, Leonidas Palios
2004	J	`jnl`	Parallel algorithms for Hamiltonian problems on quasi-threshold graphs. J. Parallel Distributed Comput. Stavros D. Nikolopoulos
2004	J	`jnl`	Parallel algorithms for P J. Algorithms Stavros D. Nikolopoulos, Leonidas Palios
2004	B	`conf`	Recognizing HHD-free and Welsh-Powell Opposition Graphs. WG Stavros D. Nikolopoulos, Leonidas Palios
2004	J	`jnl`	The Number of Spanning Trees in Graphs Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2003	J	`jnl`	Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. Stavros D. Nikolopoulos, Charis Papadopoulos
2003	B	`conf`	Recognizing Bipolarizable and P 4-Simplicial Graphs. WG Stavros D. Nikolopoulos, Leonidas Palios
2002	J	`jnl`	Coloring permutation graphs in parallel. Discret. Appl. Math. Stavros D. Nikolopoulos
2002	B	`conf`	On the Recognition of P WG Stavros D. Nikolopoulos, Leonidas Palios
2001	J	`jnl`	Hamiltonian Cycles in Quasi-threshold Graphs. Electron. Notes Discret. Math. Stavros D. Nikolopoulos
2001	J	`jnl`	Optimal Gray-code labeling and recognition algorithms for hypercubes. Inf. Sci. Stavros D. Nikolopoulos
2001	B	`conf`	Recognition and Orientation Algorithms for P ISAAC Stavros D. Nikolopoulos, Leonidas Palios
2000	J	`jnl`	On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. Stavros D. Nikolopoulos, Charis Papadopoulos
2000	J	`jnl`	Recognizing cographs and threshold graphs through a classification of their edges. Inf. Process. Lett. Stavros D. Nikolopoulos
1999	J	`jnl`	Coloring permutation graphs in parallel. Electron. Notes Discret. Math. Stavros D. Nikolopoulos
1999	J	`jnl`	NC Coloring Algorithms for Permutation Graphs. Nord. J. Comput. Maria I. Andreou, Stavros D. Nikolopoulos
1998	J	`jnl`	On the Number of Spanning Trees of Multi-Star Related Graphs. Inf. Process. Lett. Stavros D. Nikolopoulos, Panos Rondogiannis
1997	A*	`conf`	Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph. INFOCOM Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper
1997	J	`jnl`	On complete systems of invariants for small graphs. Int. J. Comput. Math. Frank Harary, Stavros D. Nikolopoulos
1997	J	`jnl`	Sub-optimal solutions to track detection problem using graph theoretic concepts. J. Syst. Archit. Stavros D. Nikolopoulos, George Samaras
1996	J	`jnl`	Parallel Block-finding Using Distance Matrices. Parallel Algorithms Appl. Stavros D. Nikolopoulos
1995	J	`jnl`	Constant-Time Parallel Recognition of Split Graphs. Inf. Process. Lett. Stavros D. Nikolopoulos
1994	J	`jnl`	Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs. Parallel Algorithms Appl. Stavros D. Nikolopoulos, Stylianos D. Danielopoulos
1994	J	`jnl`	Odd-even, compare-exchange parallel sorting. Microprocess. Microprogramming Stavros D. Nikolopoulos, Stylianos D. Danielopoulos
1994	—	`conf`	Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. CONPAR Stavros D. Nikolopoulos
1993	J	`jnl`	An experimental analysis of event set algorithms for discrete event simulation. Microprocess. Microprogramming Stavros D. Nikolopoulos, Roderick MacLeod