- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j7 |      | Katerina Asdre, Stavros D. Nikolopoulos: The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs. Algorithmica 58(3): 679-710 (2010) |
| j6 | | 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): 967-975 (2010) |
| 2008 | ||
| c2 | | Katerina Asdre, Stavros D. Nikolopoulos: The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. FAW 2008: 208-220 |
| i1 | | Katerina Asdre, Stavros D. Nikolopoulos: The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph. CoRR abs/0806.4372 (2008) |
| 2007 | ||
| j5 | | Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos: The harmonious coloring problem is NP-complete for interval and permutation graphs. Discrete Applied Mathematics 155(17): 2377-2382 (2007) |
| j4 | | Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos: An optimal parallel solution for the path cover problem on P4-sparse graphs. J. Parallel Distrib. Comput. 67(1): 63-76 (2007) |
| j3 | | Katerina Asdre, Stavros D. Nikolopoulos: A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. Networks 50(4): 231-240 (2007) |
| j2 | | Katerina Asdre, Stavros D. Nikolopoulos: NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381(1-3): 248-259 (2007) |
| 2006 | ||
| j1 | | Katerina Asdre, Stavros D. Nikolopoulos: P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. J. Comput. Sci. Technol. 21(1): 19-26 (2006) |
| 2005 | ||
| c1 | | Katerina Asdre, Stavros D. Nikolopoulos: P-tree structures and event horizon: efficient event-set implementations. Winter Simulation Conference 2005: 2700-2709 |
| 1 | Kyriaki Ioannidou | |
| 2 | Stavros D. Nikolopoulos | |
| 3 | Charis Papadopoulos |
Data released under the ODC-BY 1.0 license — See also our legal information page