Search the dblp DataBase

Publications of Author

1. Katerina Asdre, Stavros D. Nikolopoulos
   P-tree structures and event horizon: efficient event-set implementations. [Citation Graph (0, 0)][DBLP]
   Winter Simulation Conference, 2005, pp:2700-2709 [Conf]
   
2. Katerina Asdre, Stavros D. Nikolopoulos
   P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. [Citation Graph (0, 0)][DBLP]
   J. Comput. Sci. Technol., 2006, v:21, n:1, pp:19-26 [Journal]
   
3. Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
   An optimal parallel solution for the path cover problem on P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:63-76 [Journal]
   
4. Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
   The harmonious coloring problem is NP-complete for interval and permutation graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:17, pp:2377-2382 [Journal]
   
5. Katerina Asdre, Stavros D. Nikolopoulos
   NP-completeness results for some problems on subclasses of bipartite and chordal graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:248-259 [Journal]
   
6. 
   The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. [Citation Graph (, )][DBLP]
   
   
7. 
   The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph [Citation Graph (, )][DBLP]