Η σελίδα είναι υπο κατασκευή...

under construction...

    Katerina Asdre, PhD

 

  Lab Associate  
  Department of Information and Electronic Engineering  
  International Hellenic University
Phone: +30-2310 013013
  57400, Sindos, Thessaloniki, Greece
e-mail: asdre@it.teithe.gr
   
   
   
Education
2018-2020 M.Sc. in Management & Organization of Educational Units, Dept. of Organisation Management, Marketing and Tourism, International Hellenic University
2003-2008 Ph.D., Dept. of Computer Science, University of Ioannina
1999-2001 M.Sc., Dept. of Computer Science, University of Ioannina
1995-1999 B. Sc., Dept. of Computer Science, University of Ioannina
 

 

Research Interests
·
 Design and Analysis of Algorithms - Graph Algorithms
·
 Graph Theory - Perfect Graphs
·
 Complexity, Computability
·
 Graph Databases
·
 Discrete Event Simulation - Algorithms and Data Structures
   
   
   
Journal and Conference Publications
°

Synchronous and Asynchronous Education: The case of an Evening Vocational High School of Northern Greece
K. Asdre and S. Avdimiotis
3rd International Conference on Management of Educational Units (ICOMEU 2020), Thessaloniki, Greece, 2020

°

Exploitation of Synchronous and Asynchronous Education Forms in the Educational Organization
K. Asdre and S. Avdimiotis
2nd International Conference on Management of Educational Units (ICOMEU 2019), Thessaloniki, Greece, 2019

°

Trust Relations in School Community and their Importance for the Effectiveness of School Unit
K. Asdre
1st International Conference on Management of Educational Units (ICOMEU 2018), Thessaloniki, Greece, 2018

·

A Polynomial Solution to the k-fixed-endpoint Path Cover Problem on Proper Interval Graphs
K. Asdre and S.D. Nikolopoulos
Theoretical Computer Science, 2010

·

The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graphs
K. Asdre and S.D. Nikolopoulos
Algorithmica, 2009
·

The Harmonious Coloring Problem is NP-complete for Interval and Permutation Graphs
K. Asdre, K. Ioannidou, and S.D. Nikolopoulos
Discrete Applied Mathematics, 2007
·

NP-completeness Results for some Problems on Subclasses of Bipartite and Chordal Graphs
K. Asdre and S.D. Nikolopoulos
Theoretical Computer Science, 2007
·

A Linear-time Algorithm for the k-fixed-endpoint Path Cover Problem on Cographs
K. Asdre and S.D. Nikolopoulos
Networks, 2007
·

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

P-tree Structures and Event Horizon: Efficient Event-set Implementations
K. Asdre and S.D. Nikolopoulos
Journal of Computer Science and Technology, 2006
°

The 2-terminal-set Path Cover Problem and its Polynomial Solution on Cographs
K. Asdre and S.D. Nikolopoulos
Frontiers of Algorithmics Workshop (FAW '08), Changsha, China, 2008
°

A polynomial solution for the k-fixed-endpoint path cover problem on proper interval graphs
K. Asdre and S.D. Nikolopoulos
18th International Conference on Combinatorial Algorithms (IWOCA'07), Newcastle, Australia, 2007
°

P-tree structures and event horizon: Efficient event-set implementations
K. Asdre and S.D. Nikolopoulos
Winter Simulation Conference (WSC'05), Orlando, Florida, 2005
°

Optimal algorithms for the path cover problem on P4-sparse graphs
K. Asdre, S.D. Nikolopoulos, and C. Papadopoulos
Graphs and Combinatorial Optimization (CTW '05), Cologne, Germany, 2005

   
   
   
Teaching Experience
1999-2008 Teaching Assistant, CS-442: Design and Analysis of Algorithms
  Teaching Assistant, CS-E15: Parallel Algorithms
... ...