1. S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, A Fully Dynamic Algorithm for the Recognition of P4-sparse Graphs, Theoretical Comuter Science (to appear)

2. K. Ioannidou and S.D. Nikolopoulos, The Longest Path Problem is Polynomial on Cocomparability Graphs, Algorithmica (to appear)

3. E. Lappas, S.D. Nikolopoulos, and L. Palios, An O(n)-time Algorithm for the Paired-Domination Problem on Permutation Graphs, European Journal of Combinatorics (to appear)

4. K. Ioannidou, G.B. Mertzios, and S.D. Nikolopoulos, The longest path problem has a polynomial solution on interval graphs, Algorithmica, 2011

5. S.D. Nikolopoulos and C. Papadopoulos, A simple linear-time recognition algorithm for weakly quasi-threshold graphs, Graphs and Combinatorics, 2011

6. K. Asdre and S.D. Nikolopoulos, The 1-fixed-endpoint path cover problem is polynomial on interval graphs, Algorithmica, 2010

7. K. Asdre and S.D. Nikolopoulos, A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs, Theoretical Computer Science, 2010

8. S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, Maximizing the Number of Spanning Trees in Kn-complements of Asteroidal Graphs, Discrete Mathematics, 2009

9. S.D. Nikolopoulos and C. Papadopoulos, Counting spanning trees in cographs: an algorithmic approach, Ars Combinatoria, 2009

10. K. Asdre, K. Ioannidou, and S.D. Nikolopoulos, The Harmonious coloring problem is NP-complete for interval and permutation graphs, Discrete Applied Mathematics, 2007

11. K. Asdre and S.D. Nikolopoulos, NP-completeness results for some problems on subclasses of bipartite and chordal graphs, Theoretical Computer Science, 2007

12. K. Asdre and S.D. Nikolopoulos, A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs, Networks, 2007

13. S.D. Nikolopoulos and L. Palios, On the parallel computation of the biconnected and strongly connected co-components of graphs, Discrete Applied Mathematics, 2007

14. K. Asdre, S.D. Nikolopoulos, and C. Papadopoulos, An optimal parallel solution for the path cover problem on P4-sparse graphs, J. Parallel and Distributed Computing, 2007

15. S.D. Nikolopoulos and L. Palios, Detecting holes and antiholes in graphs, Algorithmica, 2007

16. S.D. Nikolopoulos and C. Papadopoulos, On the number of spanning trees of Kn +/- G graphs, Discrete Mathematics and Theoretical Computer Science, 2006

17. K. Asdre and S.D. Nikolopoulos, P-tree structures and event horizon: efficient event-set implementations, J. Computer Science and Technology, 2006

18. S.D. Nikolopoulos and L. Palios, Minimal separators in P4-sparse graphs, Discrete Mathematics, 2006

19. S.D. Nikolopoulos and L. Palios, Recognizing HH-free, HHD-free and Welsh-Powell opposition graphs, Discrete Mathematics and Theoretical Computer Science, 2006

20. S.D. Nikolopoulos and L. Palios, Efficient parallel recognition of cographs, Discrete Applied Mathematics, 2005

21. S.D. Nikolopoulos and L. Palios, On the recognition of bipolarizable and P4-simplicial graphs, Discrete Mathematics and Theoretical Computer Science, 2005

22. S.D. Nikolopoulos, C. Nomikos, and P. Rondogiannis, A limit characterization for the number of spanning trees of graphs, Information Processing Letters, 2004

23. S.D. Nikolopoulos and L. Palios, Parallel algorithms for P4-comparability graphs, J. Algorithms, 2004

24. S.D. Nikolopoulos and L. Palios, Parallel algorithms for recognizing P5-free and coP5-free weakly chordal graphs, Parallel Processing Letters, 2004

25. S.D. Nikolopoulos and L. Palios, Algorithms for P4-comparability graph recognition and acyclic P4-transitive orientation, Algorithmica, 2004

26. S.D. Nikolopoulos and C. Papadopoulos, The number of spanning trees in Kn-complements of quasi-threshold graphs, Graphs and Combinatorics, 2004

27. S.D. Nikolopoulos, Parallel algorithms for Hamiltonian problems on quasi-threshold graphs, J. Parallel and Distributed Computing, 2004

28. K.W. Chong, S.D. Nikolopoulos, and L. Palios, An optimal parallel co-connectivity algorithm, Theory of Computing Systems, 2004

29. S.D. Nikolopoulos, Coloring permutation graphs in parallel, Discrete Applied Mathematics, 2002

30. S.D. Nikolopoulos, Optimal Gray-code labeling and recognition algorithms for hypercubes, Information Sciences, 2001

31. S.D. Nikolopoulos and C. Papadopoulos, On the performance of the First-Fit coloring algorithm on permutation graphs, Information Processing Letters, 2000

32. S.D. Nikolopoulos, Recognizing cographs and threshold graphs through a classification of their edges, Information Processing Letters, 2000

33. M. Andreou and S.D. Nikolopoulos, NC coloring algorithms for permutation graphs, Nordic J. Computing, 1999

34. S.D. Nikolopoulos and P. Rondogiannis, On the number of spanning trees of multi-star related graphs, Information Processing Letters, 1998

35. F. Harary and S.D. Nikolopoulos, On complete systems of invariants for small graphs, Intern. J. Computer Mathematics, 1997

36. S.D. Nikolopoulos and G. Samaras, Sub-optimal solutions to track detection problem using graph theoretic concepts, J. Systems Architecture, 1997

37. S.D. Nikolopoulos, Parallel block-finding using distance matrices, J. Parallel Algorithms and Applications, 1996

38. S.D. Nikolopoulos, Constant-time parallel recognition of split graphs, Information Processing Letters, 1995

39. S.D. Nikolopoulos and S.D. Danielopoulos, Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs, Computers and Mathematics with Applications, 1995

40. S.D. Nikolopoulos and S.D. Danielopoulos, On the parallel evaluation of DWBA integrals, Intern. J. Computer Mathematics, 1994

41. S.D. Nikolopoulos and S.D. Danielopoulos, Odd-even, compare-exchange parallel sorting, Microprocessing and Microprogramming, 1994

42. S.D. Nikolopoulos and S.D. Danielopoulos, Fast parallel algorithms for finding cutpoints and bridges of undirected graphs, J. Parallel Algorithms and Applications, 1994

43. S.D. Nikolopoulos and R. MacLeod, An experimental analysis of event set algorithms for discrete event simulation, Microprocessing and Microprogramming, 1993

• M. Chroni and S.D. Nikolopoulos, An Embedding Graph-based Model for Software Watermarking, 8th Int'l Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP'12), IEEE Proceedings, 2012

• M. Chroni, A. Fylakis, and S.D. Nikolopoulos, Watermarking Images using 2D Representations of Self-inverting Permutations, 8th Int'l Conference on Web Information Systems and Technologies (WEBIST'12), SciTePress Digital Library, 2012

• M. Chroni, A. Fylakis, and S.D. Nikolopoulos, A Watermarking System for Teaching Students to Respect Intellectual Property Rights, 4th Int'l Conference on Computer Supported Education (CSEDU'12), Poster paper, 2012

• L. Georgiadis, S.D. Nikolopoulos, and L. Palios, Join-reachability problems in directed graphs, 6th Int'l Computer Science Symposium in Russia (CSR'11), LNCS 6651, 2011

• M. Chroni and S.D. Nikolopoulos, Encoding watermark numbers as cographs using self-inverting permutations, 12th Int'l Conference on Computer Systems and Technologies (CompSysTech'11), ACM ICPS 578 (Best Paper Award), 2011

• M. Chroni and S.D. Nikolopoulos, Encoding numbers as reducible permutation graphs for software watermarking, 3rd Int'l Conference on Software, Services & Semantic Technologies (S3T'11), Poster paper, 2011

• S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, Counting spanning trees in graphs using modular decomposition, 5th Int'l Workshop on Algorithms and Computation (WALCOM'11), LNCS 6552, 2011

• M. Chroni and S.D. Nikolopoulos, Encoding watermark integers as self-inverting permutations, 11th Int'l Conference on Computer Systems and Technologies (CompSysTech'10), ACM ICPS 471, 2010

• K. Ioannidou and S.D. Nikolopoulos, The Longest Path Problem is Polynomial on Cocomparability Graphs, 36th Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'10), LNCS 6410, 2010

• K. Ioannidou and S.D. Nikolopoulos, Harmonious Coloring on Subclasses of Colinear Graphs, 4th Int'l Workshop on Algorithms and Computation (WALCOM'10), LNCS 5942, 2010

• K. Ioannidou, G.B. Mertzios, and S.D. Nikolopoulos, The Longest Path Problem is Polynomial on Interval Graphs, 34th Int'l Symposium on Mathematical Foundations of Computer Science (MFCS'09), LNCS 5734, 2009

• E. Lappas, S.D. Nikolopoulos, and L. Palios, An O(n)-time Algorithm for the Paired-Domination Problem on Permutation Graphs, 20th Int'l Workshop on Combinatorial Algorithms (IWOCA'09), LNCS 5874, 2009

• K. Ioannidou and S.D. Nikolopoulos, Colinear Coloring on Graphs, 3rd Int'l Workshop on Algorithms and Computation (WALCOM'09), LNCS 5431, 2009

• K. Asdre and S.D. Nikolopoulos, The 2-terminal-set Path Cover Problem and its Polynomial Solution on Cographs, 2nd Int'l Frontiers of Algorithmics Workshop (FAW'08), LNCS 5059, 2008

• D. Koukopoulos, S.D. Nikolopoulos, L. Palios, and P.G. Spirakis, Optimal Algorithms for Detecting Network Stability, 2ed Int'l Workshop on Algorithms and Computation (WALCOM'08), LNCS 4921, 2008

• K. Asdre and S.D. Nikolopoulos, A polynomial solution for the k-fixed-endpoint path cover problem on proper interval graphs, 18th Int'l Workshop on Combinatorial Algorithms (IWOCA'07), College Publications, Texts in Algorithmics Vol. 10, 2007

• S.D. Nikolopoulos and L. Palios, An O(nm)-time certifying algorithm for recognizing HHDfree graphs, 1st Int'l Frontiers in Algorithmics Workshop (FAW'07), LNCS 4613, 2007

• M. Chroni, D. Koukopoulos, and S.D. Nikolopoulos, An experimental study of stability in heterogenous networks, 6th Workshop on Experimental Algorithms (WEA'07), LNCS 4525, 2007

• S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, A fully dynamic algorithm for the recognition of P4-sparse graphs, 32nd Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), LNCS 4271, 2006

• D. Koukopoulos and S.D. Nikolopoulos, Heterogenous networks can be unstable at arbitrarily low injection rates, 6th Conference on Algorithms and Complexity (CIAC'06), LNCS 3998, 2006

• P. Fragopoulou, S.D. Nikolopoulos, and L. Palios, Multi-source trees: Algorithms for minimizing eccentricity metrics, 16th Int'l Symposium on Algorithms and Computation (ISAAC'05), LNCS 3827, 2005

• S.D. Nikolopoulos and L. Palios, Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching, 10th Panhellenic Conference on Informatics (PCI'05), LNCS 3746, 2005

• S.D. Nikolopoulos and L. Palios, Recognizing HHDS-free graphs, 31st Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), LNCS 3787, 2005

• S.D. Nikolopoulos and L. Palios, Adding an edge in a cograph, 31st Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), LNCS 3787, 2005

• S.D. Nikolopoulos and L. Palios, Recognizing HHD-free and Welsh-Powell opposition graphs, 30th Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'04), LNCS 3353, 2004

• S.D. Nikolopoulos and L. Palios, Hole and antihole detection in graphs, 15th ACM-SIAM Symposium on Discrete Algorithms (SODA'04), Vol. 1, 2004

• S.D. Nikolopoulos and L. Palios, Recognizing bipolarizable and P4-simplicial graphs, 29th Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'03), LNCS 2880, 2003

• S.D. Nikolopoulos and L. Palios, On the recognition of P4-comparability graphs, 28th Int'l Workshop on Graph-Theoretic Concepts in Computer Science (WG'02), LNCS 2573, 2002

• S.D. Nikolopoulos and L. Palios, Recognition and orientation algorithms for P4-comparability graphs, 12th Int'l Symposium on Algorithms and Computation (ISAAC'01), LNCS 2223, 2001

• S.D. Nikolopoulos, A. Pitsillides, and D. Tipper, Addressing network survivability issues by finding the K-best paths through a trellis graph, 16th IEEE Conference on Computer Communications (INFOCOM'97), IEEE Proceedings, 1997

• G. Samaras, S.D. Nikolopoulos, K. Britton, and A. Cirton, Managing transaction identifiers in the Peer-to-Peer distributed transactional environment, 9th Int'l Conference on Parallel and Distributed Computing Systems (PDCS'96), Vol. 2, 1996

• S.D. Nikolopoulos and G. Samaras, Sub-optimal approach to track detection for real-time systems, 21st Euromicro Conference on Design of Hardware and Software Systems (EUROMICRO'95), Vol. 1, 1995

• F. Harary and S.D. Nikolopoulos, Graph isomorphism problem for small graphs, 2nd Int'l Conference on Digital Signal Processing (DSP'95), Vol. 1, 1995

• S.D. Nikolopoulos, Parallel recognition and location algorithms for chordal graphs using distance matrices, 3rd Int'l Conference on Parallel and Vector Processing (CONPAR'94), LNCS 854, 1994

       (*) Selected