Browsing by Author Asdre, K.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Jump to: Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω
or enter first few letters:  
View Option
Showing results 1 to 8 of 8
TitleAuthor(s)Issue date???itemlist.???
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
The harmonious coloring problem is NP-complete for interval and permutation graphsAsdre, K.; Ioannidou, K.; Nikolopoulos, S. D.24-Nov-2015-
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
NP-completeness results for some problems on subclasses of bipartite and chordal graphsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
Optimal algorithms for the path cover problem on P4-sparse graphsPapadopoulos, C.; Asdre, K.; Nikolopoulos, S.24-Nov-2015-
An optimal parallel solution for the path cover problem on P-4-sparse graphsAsdre, K.; Nikolopoulos, S. D.; Papadopoulos, C.24-Nov-2015-
P-tree structures and event horizon: Efficient event-set implementationsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphsAsdre, K.; Nikolopoulos, S. D.24-Nov-2015-