Back
Return
Biography

Prof. Stavros D. Nikolopoulos

University of Ioannina, Greece

Email: stavros@cs.uoi.gr


Qualifications

1991  Ph.D., University of Ioannina, Greece

1985  M.Sc., University of Dundee, UK

1982  B.Sc., University of Ioannina, Greece

Publications (Selected)


  1. S.D. Nikolopoulos and L. Palios, \An O(nm) certifying algorithm for recognizing HHD-free graphs", Theoretical Computer Science (to appear), 2012.
  2. K. Ioannidou and S.D. Nikolopoulos, The longest path problem is polynomial on cocomparability graphs, Algorithmica (to appear), 2012.
  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), 2012.
  4. S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, \A fully dynamic algorithm for the recognition of P4-sparse graphs", Theoretical Computer Science 439(1): 41{57, 2012.
  5. K. Ioannidou, G.B. Mertzios, and S.D. Nikolopoulos, \The longest path problem has a polynomial solution on interval graphs", Algorithmica 61(2): 320{341, 2011.
  6. S.D. Nikolopoulos and C. Papadopoulos, \A simple linear-time recognition algorithm for weakly quasi-threshold graphs", Graphs and Combinatorics 27(4): 557{565, 2011.
  7. K. Asdre and S.D. Nikolopoulos, \The 1-xed-endpoint path cover problem is polynomial on interval graphs", Algorithmica 58(3): 679{710, 2010.
  8. K. Asdre and S.D. Nikolopoulos, \A polynomial solution to the k-xed-endpoint path cover problem on proper interval graphs", Theoretical Computer Science 411(6-7): 967{975, 2010.
  9. S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, \Maximizing the number of spanning trees in Kn-complements of asteroidal graphs", Discrete Mathematics 309(10): 3049{3060, 2009.
  10. S.D. Nikolopoulos and C. Papadopoulos, \Counting spanning trees in cographs: an algorithmic approach", Ars Combinatoria 90(1): 257{274, 2009.
  11. K. Asdre, K. Ioannidou, and S.D. Nikolopoulos, \The Harmonious coloring problem is NP-complete for interval and permutation graphs", Discrete Applied Mathematics 155(17): 2377{2382, 2007.
  12. K. Asdre and S.D. Nikolopoulos, \NP-completeness results for some problems on subclasses of bipartite and chordal graphs", Theoretical Computer Science 381(1{3): 248{259, 2007.
  13. K. Asdre and S.D. Nikolopoulos, \A linear-time algorithm for the k-xed-endpoint path cover problem on cographs", Networks 50(4): 231{240, 2007.
  14. S.D. Nikolopoulos and L. Palios, \On the parallel computation of the biconnected and strongly connected co-components of graphs", Discrete Applied Mathematics 155(14): 1858{1877, 2007.
  15. 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 67(1): 63{76, 2007.
  16. S.D. Nikolopoulos and L. Palios, \Detecting holes and antiholes in graphs", Algorithmica 47(2): 119{138, 2007.
  17. S.D. Nikolopoulos and C. Papadopoulos, \On the number of spanning trees of Kn G graphs", Discrete Math. & Theoret. Comput. Science 8(1): 235{248, 2006.
  18. K. Asdre and S.D. Nikolopoulos, \P-tree structures and event horizon: cient event-set implementations", J. Computer Science and Technology 21(1): 19{26, 2006.
  19. S.D. Nikolopoulos and L. Palios, \Minimal separators in P4-sparse graphs", Discrete Mathematics 306(3): 381{392, 2006.
  20. S.D. Nikolopoulos and L. Palios, \Recognizing HH-free, HHD-free and Welsh-Powell opposition graphs", Discrete Math. & Theoret. Comput. Science 8(1): 65{82, 2006.