Katerina Asdre

Publication Activity (10 Years)

Years Active: 2005-2010
Publications (10 Years): 0

Publications

Katerina Asdre, Stavros D. Nikolopoulos
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica 58 (3) (2010)
Katerina Asdre, Stavros D. Nikolopoulos
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs. Theor. Comput. Sci. 411 (7-9) (2010)
Katerina Asdre, Stavros D. Nikolopoulos
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph CoRR (2008)
Katerina Asdre, Stavros D. Nikolopoulos
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. FAW (2008)
Katerina Asdre, Stavros D. Nikolopoulos
NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381 (1-3) (2007)
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
The harmonious coloring problem is NP-complete for interval and permutation graphs. Discret. Appl. Math. 155 (17) (2007)
Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
-sparse graphs. J. Parallel Distributed Comput. 67 (1) (2007)
Katerina Asdre, Stavros D. Nikolopoulos
-fixed-endpoint path cover problem on cographs. Networks 50 (4) (2007)
Katerina Asdre, Stavros D. Nikolopoulos
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. J. Comput. Sci. Technol. 21 (1) (2006)
Katerina Asdre, Stavros D. Nikolopoulos
P-tree structures and event horizon: efficient event-set implementations. WSC (2005)