P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. - Katerina Asdre; Stavros D. Nikolopoulos (J. Comput. Sci. Technol., 2006)

The harmonious coloring problem is NP-complete for interval and permutation graphs. - Katerina Asdre; Kyriaki Ioannidou; Stavros D. Nikolopoulos (Discret. Appl. Math., 2007)

An optimal parallel solution for the path cover problem on P4-sparse graphs. - Katerina Asdre; Stavros D. Nikolopoulos; Charis Papadopoulos (J. Parallel Distributed Comput., 2007)

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. - Katerina Asdre; Stavros D. Nikolopoulos (Networks, 2007)

NP-completeness results for some problems on subclasses of bipartite and chordal graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Theor. Comput. Sci., 2007)

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. - Katerina Asdre; Stavros D. Nikolopoulos (FAW, 2008)

The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph - Katerina Asdre; Stavros D. Nikolopoulos (CoRR, 2008)

Αλγόριθμοι και αποτελέσματα NP-πληρότητας για προβλήματα χρωματισμού και επικάλυψης με μονοπάτια σε τέλεια γραφήματα - Katerina Asdre (2008)

The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Algorithmica, 2010)

A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs. - Katerina Asdre; Stavros D. Nikolopoulos (Theor. Comput. Sci., 2010)