1. Repository of OAI
Ελληνικά   English  

Browsing by Author Palios, L.

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 17 to 31 of 31 < previous 
TitleAuthor(s)Issue date???itemlist.???
An O(n)-time algorithm for the paired-domination problem on permutation graphsLappas, E.; Nikolopoulos, S.; Palios, L.11-Dec-2015-
On the hamiltonicity of the cartesian productDimakopoulos, V. V.; Palios, L.; Poulakidas, A. S.24-Nov-2015-
On the parallel computation of the biconnected and strongly connected co-components of graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
On the recognition of bipolarizable and P-4-simplicial graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
On the recognition of P-4-comparability graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Optimal algorithms for detecting network stabilityKoukopoulos, D.; Nikolopoulos, S.; Palios, L.; Spirakis, P.11-Dec-2015-
An optimal parallel co-connectivity algorithmChong, K. W.; Nikolopoulos, S. D.; Palios, L.24-Nov-2015-
Parallel algorithms for P-4-comparability graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Parallel algorithms p5 free and co p5 free weakly chordal graphsPalios, L.; Nikolopoulos, D.24-Nov-2015-
Recognition and orientation algorithms for P-4-comparability graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Recognizing bipolarizable and P-4-simplicial graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Recognizing HHD-free and Welsh-Powell opposition graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Recognizing HHDS-free graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Triangulating a Non-Convex PolytpePalios, L.; Chazelle, Bernard24-Nov-2015-
Showing results 17 to 31 of 31 < previous