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 3 to 22 of 31 < previous   next >
TitleAuthor(s)Issue date???itemlist.???
Decomposition algorithms in geometryPalios, L.; Chazelle, B.11-Dec-2015-
Detecting features from sliced point cloudsPalios, L.; Fudos, I.; Kyriazis, N.24-Nov-2015-
Detecting holes and antiholes in graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Diagnostic expert system inference engine based on the certainty factors modelTzafestas, S.; Palios, L.; Cholin, F.24-Nov-2015-
Efficient parallel recognition of cographsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
An efficient shape-based approach to image retrievalFudos, I.; Palios, L.24-Nov-2015-
A Fully Dynamic Algorithm for the Recognition of P4-sparse GraphsPapadopoulos, C.; Nikolopoulos, S. D.; Palios, L.24-Nov-2015-
Join-Reachability Problems in Directed GraphsGeorgiadis, L.; Nikolopoulos, S.; Palios, L.24-Nov-2015-
Maximizing the number of spanning trees in K(n)-complements of asteroidal graphsNikolopoulos, S. D.; Palios, L.; Papadopoulos, C.24-Nov-2015-
Maximizing the number of spanning trees in K-n-complements of asteroidal graphsNikolopoulos, S. D.; Palios, L.; Papadopoulos, C.24-Nov-2015-
Maximum-size subgraphs of P4-sparse graphs admitting a perfect matchingNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Minimal separators in P-4-sparse graphsNikolopoulos, S. D.; Palios, L.24-Nov-2015-
Multi-source trees: Algorithms for minimizing eccentricity cost metricsFragopoulou, P.; Nikolopoulos, S. D.; Palios, L.24-Nov-2015-
A new competitive strategy for reaching the kernel of an unknown polygonPalios, L.24-Nov-2015-
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-