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)

S.D. Nikolopoulos and L. Palios, \An O(nm) certifying algorithm for
recognizing HHDfree graphs", Theoretical Computer Science (to appear),
2012.

K. Ioannidou and S.D. Nikolopoulos, The longest path problem is
polynomial on cocomparability graphs, Algorithmica (to appear), 2012.

E. Lappas, S.D. Nikolopoulos, and L. Palios, \An O(n)time algorithm for
the paireddomination problem on permutation graphs", European Journal of
Combinatorics (to appear), 2012.

S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, \A fully dynamic
algorithm for the recognition of P4sparse graphs", Theoretical Computer
Science 439(1): 41{57, 2012.

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.

S.D. Nikolopoulos and C. Papadopoulos, \A simple lineartime recognition
algorithm for weakly quasithreshold graphs", Graphs and Combinatorics
27(4): 557{565, 2011.

K. Asdre and S.D. Nikolopoulos, \The 1xedendpoint path cover problem is
polynomial on interval graphs", Algorithmica 58(3): 679{710, 2010.

K. Asdre and S.D. Nikolopoulos, \A polynomial solution to the
kxedendpoint path cover problem on proper interval graphs", Theoretical
Computer Science 411(67): 967{975, 2010.

S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, \Maximizing the number
of spanning trees in Kncomplements of asteroidal graphs", Discrete
Mathematics 309(10): 3049{3060, 2009.

S.D. Nikolopoulos and C. Papadopoulos, \Counting spanning trees in
cographs: an algorithmic approach", Ars Combinatoria 90(1): 257{274, 2009.

K. Asdre, K. Ioannidou, and S.D. Nikolopoulos, \The Harmonious coloring
problem is NPcomplete for interval and permutation graphs", Discrete
Applied Mathematics 155(17): 2377{2382, 2007.

K. Asdre and S.D. Nikolopoulos, \NPcompleteness results for some
problems on subclasses of bipartite and chordal graphs", Theoretical
Computer Science 381(1{3): 248{259, 2007.

K. Asdre and S.D. Nikolopoulos, \A lineartime algorithm for the
kxedendpoint path cover problem on cographs", Networks 50(4): 231{240,
2007.

S.D. Nikolopoulos and L. Palios, \On the parallel computation of the
biconnected and strongly connected cocomponents of graphs", Discrete
Applied Mathematics 155(14): 1858{1877, 2007.

K. Asdre, S.D. Nikolopoulos, and C. Papadopoulos, \An optimal parallel
solution for the path cover problem on P4sparse graphs", J. Parallel and
Distributed Computing 67(1): 63{76, 2007.

S.D. Nikolopoulos and L. Palios, \Detecting holes and antiholes in
graphs", Algorithmica 47(2): 119{138, 2007.

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.

K. Asdre and S.D. Nikolopoulos, \Ptree structures and event horizon:
cient eventset implementations", J. Computer Science and Technology
21(1): 19{26, 2006.

S.D. Nikolopoulos and L. Palios, \Minimal separators in P4sparse
graphs", Discrete Mathematics 306(3): 381{392, 2006.

S.D. Nikolopoulos and L. Palios, \Recognizing HHfree, HHDfree and
WelshPowell opposition graphs", Discrete Math. & Theoret. Comput.
Science 8(1): 65{82, 2006.
