Katerina Asdre, PhD 


Computer Science Department  
University of Ioannina  Phone: +302651098832 

GR45110 Ioannina, Greece  email: katerina@cs.uoi.gr 
Education 
20032008  Ph.D., Dept. of Computer Science, University of Ioannina 
19992001  M.Sc., Dept. of Computer Science, University of Ioannina 
19951999  B. Sc., Dept. of Computer Science, University of Ioannina 
Research Interests 
· 
Design and Analysis of Algorithms  Graph Algorithms 
· 
Graph Theory  Perfect Graphs 
· 
Discrete Event Simulation  Algorithms and Data Structures 
Journal and Conference Publications 
·  A Polynomial Solution to the kfixedendpoint Path Cover Problem on Proper Interval Graphs 
·  The 1fixedendpoint Path Cover Problem is Polynomial on Interval Graphs 
·  The Harmonious
Coloring Problem is NPcomplete for Interval and Permutation Graphs 
·  NPcompleteness
Results for some Problems on Subclasses of Bipartite and Chordal Graphs 
·  A Lineartime Algorithm
for the kfixedendpoint Path Cover Problem on Cographs 
·  An optimal parallel solution
for the path cover problem on P4sparse graphs 
·  Ptree Structures and
Event Horizon: Efficient Eventset Implementations 
°  The 2terminalset Path
Cover Problem and its Polynomial Solution on Cographs 
°  A polynomial solution
for the kfixedendpoint path cover problem on proper interval
graphs 
°  Ptree structures and
event horizon: Efficient eventset implementations 
°  Optimal algorithms for the
path cover problem on P4sparse graphs 
Teaching Experience 
1999current  Teaching Assistant, CS442: Design and Analysis of Algorithms 
Teaching Assistant, CSE15: Parallel Algorithms 