Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Item Type
Advanced Search
Help
About DSpace
Sign on to:
My DSpace
Receive email
updates
Edit Profile
Saved Searches
Favorites
Repository of UOI "Olympias"
Repository of OAI
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
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 2 to 8 of 8
< previous
Title
Author(s)
Issue date
???itemlist.???
The harmonious coloring problem is NP-complete for interval and permutation graphs
Asdre, K.
;
Ioannidou, K.
;
Nikolopoulos, S. D.
24-Nov-2015
-
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
Asdre, K.
;
Nikolopoulos, S. D.
24-Nov-2015
-
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Asdre, K.
;
Nikolopoulos, S. D.
24-Nov-2015
-
Optimal algorithms for the path cover problem on P4-sparse graphs
Papadopoulos, C.
;
Asdre, K.
;
Nikolopoulos, S.
24-Nov-2015
-
An optimal parallel solution for the path cover problem on P-4-sparse graphs
Asdre, K.
;
Nikolopoulos, S. D.
;
Papadopoulos, C.
24-Nov-2015
-
P-tree structures and event horizon: Efficient event-set implementations
Asdre, K.
;
Nikolopoulos, S. D.
24-Nov-2015
-
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Asdre, K.
;
Nikolopoulos, S. D.
24-Nov-2015
-