default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStavros D. Nikolopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i18]Iosif Polenakis, Vasileios Vouronikos, Maria Chroni, Stavros D. Nikolopoulos:
Towards a real-time distributed feedback system for the transportation assistance of PwD. CoRR abs/2406.06154 (2024)- 2023
- [j58]Anna Mpanti, Stavros D. Nikolopoulos
, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. Algorithms 16(6): 289 (2023) - [j57]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. 31(2): 107-128 (2023) - [j56]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): 97-123 (2023) - [c62]Maria Chroni, Athanasia Katsi, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos:
Tamper Detection and Localization in Forensic Images. CompSysTech 2023: 117-122 - [c61]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: 1-8 - [i17]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a P4-sparse Graph. CoRR abs/2302.00112 (2023) - [i16]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. CoRR abs/2302.00657 (2023) - 2022
- [j55]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): 42 (2022) - [j54]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): 383-406 (2022) - [c60]Georgios Grigoriadis Kotsalis, Stavros D. Nikolopoulos, Iosif Polenakis:
A Synonym-based Approach for the Semantic Indexing of Texts. CompSysTech 2022: 95-102 - [c59]Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos:
A Repetitive Watermarking Scheme for Digital Images based on Self-Inverting Permutations. IISA 2022: 1-8 - [c58]Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos:
Digital Image Watermarking using Self Inverting Permutations - A Comparative Study. IISA 2022: 1-8 - [c57]Maria Chroni, Stavros D. Nikolopoulos, Iosif Polenakis, Vasileios Vouronikos:
A Multiple Watermarking Scheme for Digital Audio Signals. PCI 2022: 279-284 - [c56]Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos:
An Experimental Study of Algorithms for Packing Arborescences. SEA 2022: 14:1-14:16 - 2021
- [j53]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): 651-688 (2021) - [c55]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: 28-33 - [i15]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 abs/2106.14567 (2021) - [i14]Christos Chondros, Stavros D. Nikolopoulos, Iosif Polenakis:
A Stochastic Graph-based Model for the Simulation of SARS-CoV-2 Transmission. CoRR abs/2111.05802 (2021) - 2020
- [c54]Alvaro Chysi, Stavros D. Nikolopoulos, Iosif Polenakis:
An Algorithmic Framework for Malicious Software Detection Exploring Structural Characteristics of Behavioral Graphs. CompSysTech 2020: 43-50
2010 – 2019
- 2019
- [c53]Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis:
Malicious Software Detection utilizing Temporal-Graphs. CompSysTech 2019: 49-55 - 2018
- [j52]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. 250: 145-164 (2018) - [j51]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740: 76-84 (2018) - [c52]Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis:
A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups. CompSysTech 2018: 20-26 - [i13]Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis:
Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations. CoRR abs/1812.10748 (2018) - [i12]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR abs/1812.11080 (2018) - 2017
- [j50]Stavros D. Nikolopoulos, Iosif Polenakis:
Preventing malware pandemics in mobile devices by establishing response-time bounds. J. Inf. Secur. Appl. 37: 1-14 (2017) - [j49]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): 29-46 (2017) - [c51]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON 2017: 346-358 - [c50]Anna Mpanti, Stavros D. Nikolopoulos, Iosif Polenakis:
Defending Hardware-based Attacks on Trusted Computing using a Hardware-Integrity Attestation Protocol. CompSysTech 2017: 155-162 - [c49]Anna Mpanti, Stavros D. Nikolopoulos, Maria Rini:
Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications. PCI 2017: 34:1-34:6 - [i11]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR abs/1712.08482 (2017) - 2016
- [c48]Stavros D. Nikolopoulos, Iosif Polenakis:
A Model for Establishing Response-time Bounds to Prevent Malware Pandemics in Mobile Devices. CompSysTech 2016: 97-104 - [c47]Anna Mpanti, Stavros D. Nikolopoulos:
Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations. PCI 2016: 13 - [i10]Stavros D. Nikolopoulos, Iosif Polenakis:
Preventing Malware Pandemics in Mobile Devices by Establishing Response-time Bounds. CoRR abs/1607.00827 (2016) - [i9]Anna Mpanti, Stavros D. Nikolopoulos:
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations. CoRR abs/1607.02281 (2016) - 2015
- [c46]Stavros D. Nikolopoulos, Iosif Polenakis:
A graph-based model for malicious code detection exploiting dependencies of system-call groups. CompSysTech 2015: 228-235 - [c45]Stavros D. Nikolopoulos, Iosif Polenakis:
Malicious software classification based on relations of system-call groups. Panhellenic Conference on Informatics 2015: 59-60 - [c44]Maria Chroni, Stavros D. Nikolopoulos:
Encoding numbers into reducible permutation graphs using heap-ordered trees. Panhellenic Conference on Informatics 2015: 311-316 - [c43]Maria Chroni, Stavros D. Nikolopoulos:
Watermarking PDF Documents using Various Representations of Self-inverting Permutations. WEBIST 2015: 73-80 - [i8]Maria Chroni, Stavros D. Nikolopoulos:
Watermarking PDF Documents using Various Representations of Self-inverting Permutations. CoRR abs/1501.02686 (2015) - 2014
- [j48]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55(2): 347-379 (2014) - [j47]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526: 41-57 (2014) - [c42]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
From Image to Audio Watermarking Using Self-Inverting Permutations. WEBIST (1) 2014: 177-184 - [i7]Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos:
WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection. CoRR abs/1403.6658 (2014) - [i6]Stavros D. Nikolopoulos, Iosif Polenakis:
Detecting Malicious Code by Exploiting Dependencies of System-call Groups. CoRR abs/1412.8712 (2014) - 2013
- [j46]Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Cocomparability Graphs. Algorithmica 65(1): 177-205 (2013) - [j45]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): 593-608 (2013) - [c41]Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos:
Watermarking Java application programs using the WaterRpg dynamic model. CompSysTech 2013: 291-298 - [c40]Maria Chroni, Stavros D. Nikolopoulos:
Design and Evaluation of a Graph Codec System for Software Watermarking. DATA 2013: 277-284 - [c39]Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos:
Evaluating the WaterRpg software watermarking model on Java application programs. Panhellenic Conference on Informatics 2013: 144-151 - [c38]Ioannis Chionis, Maria Chroni, Stavros D. Nikolopoulos:
A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software. SECRYPT 2013: 74-85 - [c37]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations. WEBIST 2013: 45-54 - [c36]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues. WEBIST (Selected Papers) 2013: 68-84 - 2012
- [j44]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P4-sparse graphs. Theor. Comput. Sci. 439: 41-57 (2012) - [j43]Stavros D. Nikolopoulos, Leonidas Palios:
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452: 117-131 (2012) - [c35]Maria Chroni, Stavros D. Nikolopoulos:
An Efficient Graph Codec System for Software Watermarking. COMPSAC Workshops 2012: 595-600 - [c34]Maria Chroni, Stavros D. Nikolopoulos:
Multiple encoding of a watermark number into reducible permutation graphs using cotrees. CompSysTech 2012: 118-125 - [c33]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
A Watermarking System for Teaching Students to Respect Intellectual Property Rights. CSEDU (1) 2012: 336-339 - [c32]Maria Chroni, Stavros D. Nikolopoulos:
An Embedding Graph-based Model for Software Watermarking. IIH-MSP 2012: 261-264 - [c31]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
A watermarking system for teaching intellectual property rights: Implementation and performance. ITHET 2012: 1-8 - [c30]Maria Chroni, Angelos Fylakis, Stavros D. Nikolopoulos:
Watermarking Images using 2D Representations of Self-inverting Permutations. WEBIST 2012: 380-385 - 2011
- [j42]Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos:
The Longest Path Problem has a Polynomial Solution on Interval Graphs. Algorithmica 61(2): 320-341 (2011) - [j41]Stavros D. Nikolopoulos, Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. 27(4): 557-565 (2011) - [c29]Maria Chroni, Stavros D. Nikolopoulos:
Encoding watermark numbers as cographs using self-inverting permutations. CompSysTech 2011: 142-148 - [c28]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CSR 2011: 195-208 - [c27]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM 2011: 202-213 - [i5]Maria Chroni, Stavros D. Nikolopoulos:
Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs. CoRR abs/1110.1194 (2011) - 2010
- [j40]Katerina Asdre, Stavros D. Nikolopoulos:
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica 58(3): 679-710 (2010) - [j39]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): 967-975 (2010) - [c26]Maria Chroni, Stavros D. Nikolopoulos:
Encoding watermark integers as self-inverting permutations. CompSysTech 2010: 125-130 - [c25]Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Harmonious Coloring on Subclasses of Colinear Graphs. WALCOM 2010: 136-148 - [c24]Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The Longest Path Problem is Polynomial on Cocomparability Graphs. WG 2010: 27-38 - [i4]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CoRR abs/1012.4938 (2010)
2000 – 2009
- 2009
- [j38]Stavros D. Nikolopoulos, Charis Papadopoulos:
Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. 90 (2009) - [j37]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. Discret. Math. 309(10): 3049-3060 (2009) - [c23]Stavros D. Nikolopoulos, Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW 2009: 23-27 - [c22]Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA 2009: 368-379 - [c21]Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Interval Graphs. MFCS 2009: 403-414 - [c20]Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Colinear Coloring on Graphs. WALCOM 2009: 117-128 - 2008
- [c19]Katerina Asdre, Stavros D. Nikolopoulos:
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. FAW 2008: 208-220 - [c18]Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability. WALCOM 2008: 188-199 - [i3]Katerina Asdre, Stavros D. Nikolopoulos:
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph. CoRR abs/0806.4372 (2008) - [i2]Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Linear Coloring and Linear Graphs. CoRR abs/0807.4234 (2008) - 2007
- [j36]Stavros D. Nikolopoulos, Leonidas Palios:
Detecting Holes and Antiholes in Graphs. Algorithmica 47(2): 119-138 (2007) - [j35]Stavros D. Nikolopoulos, Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. 155(14): 1858-1877 (2007) - [j34]Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The harmonious coloring problem is NP-complete for interval and permutation graphs. Discret. Appl. Math. 155(17): 2377-2382 (2007) - [j33]Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos:
An optimal parallel solution for the path cover problem on P4-sparse graphs. J. Parallel Distributed Comput. 67(1): 63-76 (2007) - [j32]Katerina Asdre, Stavros D. Nikolopoulos:
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. Networks 50(4): 231-240 (2007) - [j31]Katerina Asdre, Stavros D. Nikolopoulos:
NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381(1-3): 248-259 (2007) - [c17]Stavros D. Nikolopoulos, Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. FAW 2007: 281-292 - [c16]Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos:
An Experimental Study of Stability in Heterogeneous Networks. WEA 2007: 189-202 - 2006
- [j30]Stavros D. Nikolopoulos, Leonidas Palios:
Minimal separators in P4-sparse graphs. Discret. Math. 306(3): 381-392 (2006) - [j29]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 65-82 (2006) - [j28]Stavros D. Nikolopoulos, Charis Papadopoulos:
On the number of spanning trees of Knm±G graphs. Discret. Math. Theor. Comput. Sci. 8(1): 235-248 (2006) - [j27]Katerina Asdre, Stavros D. Nikolopoulos:
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. J. Comput. Sci. Technol. 21(1): 19-26 (2006) - [c15]Dimitrios Koukopoulos, Stavros D. Nikolopoulos:
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. CIAC 2006: 93-104 - [c14]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268 - 2005
- [j26]Stavros D. Nikolopoulos, Leonidas Palios:
Efficient parallel recognition of cographs. Discret. Appl. Math. 150(1-3): 182-215 (2005) - [j25]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of Bipolarizable and P4-simplicial Graphs. Discret. Math. Theor. Comput. Sci. 7(1): 231-254 (2005) - [c13]Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC 2005: 1080-1089 - [c12]Stavros D. Nikolopoulos, Leonidas Palios:
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics 2005: 68-79 - [c11]Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a Cograph. WG 2005: 214-226 - [c10]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHDS-Free Graphs. WG 2005: 456-467 - [c9]Katerina Asdre, Stavros D. Nikolopoulos:
P-tree structures and event horizon: efficient event-set implementations. WSC 2005: 2700-2709 - [i1]Stavros D. Nikolopoulos, Charis Papadopoulos:
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs. CoRR abs/cs/0502038 (2005) - 2004
- [j24]Stavros D. Nikolopoulos, Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. Algorithmica 39(2): 95-126 (2004) - [j23]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. Electron. Notes Discret. Math. 17: 229-235 (2004) - [j22]Stavros D. Nikolopoulos, Charis Papadopoulos:
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. Graphs Comb. 20(3): 383-397 (2004) - [j21]Stavros D. Nikolopoulos, Christos Nomikos, Panos Rondogiannis:
A limit characterization for the number of spanning trees of graphs. Inf. Process. Lett. 90(6): 307-313 (2004) - [j20]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel algorithms for P4-comparability graphs. J. Algorithms 51(1): 77-104 (2004) - [j19]Stavros D. Nikolopoulos:
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs. J. Parallel Distributed Comput. 64(1): 48-67 (2004) - [j18]Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37(4): 527-546 (2004) - [j17]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. Parallel Process. Lett. 14(1): 119-129 (2004) - [c8]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. CTW 2004: 201-206 - [c7]Stavros D. Nikolopoulos, Leonidas Palios:
Hole and antihole detection in graphs. SODA 2004: 850-859 - [c6]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHD-free and Welsh-Powell Opposition Graphs. WG 2004: 105-116 - 2003
- [j16]Stavros D. Nikolopoulos, Charis Papadopoulos:
Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. 13: 84-92 (2003) - [c5]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs. WG 2003: 358-369 - 2002
- [j15]Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel. Discret. Appl. Math. 120(1-3): 165-195 (2002) - [c4]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of P4-Comparability Graphs. WG 2002: 355-366 - 2001
- [j14]Stavros D. Nikolopoulos:
Hamiltonian Cycles in Quasi-threshold Graphs. Electron. Notes Discret. Math. 8: 67 (2001) - [j13]Stavros D. Nikolopoulos:
Optimal Gray-code labeling and recognition algorithms for hypercubes. Inf. Sci. 137(1-4): 189-210 (2001) - [c3]Stavros D. Nikolopoulos, Leonidas Palios:
Recognition and Orientation Algorithms for P4-Comparability Graphs. ISAAC 2001: 320-331 - 2000
- [j12]Stavros D. Nikolopoulos:
Recognizing cographs and threshold graphs through a classification of their edges. Inf. Process. Lett. 74(3-4): 129-139 (2000) - [j11]Stavros D. Nikolopoulos, Charis Papadopoulos:
On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. 75(6): 265-273 (2000)
1990 – 1999
- 1999
- [j10]Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel. Electron. Notes Discret. Math. 3: 146-152 (1999) - [j9]Maria I. Andreou, Stavros D. Nikolopoulos:
NC Coloring Algorithms for Permutation Graphs. Nord. J. Comput. 6(4): 422-445 (1999) - 1998
- [j8]Stavros D. Nikolopoulos, Panos Rondogiannis:
On the Number of Spanning Trees of Multi-Star Related Graphs. Inf. Process. Lett. 65(4): 183-188 (1998) - 1997
- [j7]Frank Harary, Stavros D. Nikolopoulos:
On complete systems of invariants for small graphs. Int. J. Comput. Math. 64(1-2): 35-46 (1997) - [j6]Stavros D. Nikolopoulos, George Samaras:
Sub-optimal solutions to track detection problem using graph theoretic concepts. J. Syst. Archit. 42(9-10): 743-760 (1997) - [c2]Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper:
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph. INFOCOM 1997: 370-377 - 1996
- [j5]Stavros D. Nikolopoulos:
Parallel Block-finding Using Distance Matrices. Parallel Algorithms Appl. 9(1-2): 1-13 (1996) - 1995
- [j4]Stavros D. Nikolopoulos:
Constant-Time Parallel Recognition of Split Graphs. Inf. Process. Lett. 54(1): 1-8 (1995) - 1994
- [j3]Stavros D. Nikolopoulos, Stylianos D. Danielopoulos:
Odd-even, compare-exchange parallel sorting. Microprocess. Microprogramming 40(7): 487-497 (1994) - [j2]Stavros D. Nikolopoulos, Stylianos D. Danielopoulos:
Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs. Parallel Algorithms Appl. 3(1-2): 45-55 (1994) - [c1]Stavros D. Nikolopoulos:
Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. CONPAR 1994: 349-358 - 1993
- [j1]Stavros D. Nikolopoulos, Roderick MacLeod:
An experimental analysis of event set algorithms for discrete event simulation. Microprocess. Microprogramming 36(2): 71-81 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
