Follow
Leonidas Palios
Leonidas Palios
Professor, Dept of Computer Science and Engineering, University of Ioannina
Verified email at cs.uoi.gr - Homepage
Title
Cited by
Cited by
Year
Triangulating a non-convex polytype
B Chazelle, L Palios
Proceedings of the fifth annual symposium on Computational geometry, 393-400, 1989
2161989
Decomposition algorithms in geometry
B Chazelle, L Palios
Algebraic Geometry and its Applications: Collections of Papers from Shreeram …, 1994
611994
Hole and antihole detection in graphs
SD Nikolopoulos, L Palios
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
482004
Detecting holes and antiholes in graphs
SD Nikolopoulos, L Palios
Algorithmica 47, 119-138, 2007
312007
On the Hamiltonicity of the Cartesian product
VV Dimakopoulos, L Palios, AS Poulakidas
Information processing letters 96 (2), 49-53, 2005
312005
Decomposing the boundary of a nonconvex polyhedron
B Chazelle, L Palios
Algorithmica 17, 245-265, 1997
261997
An O (n)-time algorithm for the paired domination problem on permutation graphs
E Lappas, SD Nikolopoulos, L Palios
European Journal of Combinatorics 34 (3), 593-608, 2013
222013
An optimal parallel co-connectivity algorithm
KW Chong, SD Nikolopoulos, L Palios
Theory of Computing Systems 37 (4), 527-546, 2004
182004
Diagnostic expert system inference engine based on the certainty factors model
S Tzafestas, L Palios, F Cholin
Knowledge-Based Systems 7 (1), 17-26, 1994
181994
Computing the Newton polygon of the implicit equation
IZ Emiris, C Konaxis, L Palios
Mathematics in Computer Science 4, 25-44, 2010
152010
An efficient shape-based approach to image retrieval
I Fudos, L Palios
Pattern Recognition Letters 23 (6), 731-741, 2002
152002
An O (n)-time algorithm for the paired-domination problem on permutation graphs
E Lappas, SD Nikolopoulos, L Palios
Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec …, 2009
132009
Adding an edge in a cograph
SD Nikolopoulos, L Palios
Graph-Theoretic Concepts in Computer Science: 31st International Workshop …, 2005
132005
Decomposing the boundary of a nonconvex polyhedron
B Chazelle, L Palios
Scandinavian Workshop on Algorithm Theory, 364-375, 1992
131992
A fully dynamic algorithm for the recognition of P4-sparse graphs
SD Nikolopoulos, L Palios, C Papadopoulos
Theoretical Computer Science 439, 41-57, 2012
122012
Detecting features from sliced point clouds
I Kyriazis, I Fudos, L Palios
International Conference on Computer Graphics Theory and Applications 2, 188-192, 2007
122007
Computing the Newton polytope of specialized resultants
IZ Emiris, C Konaxis, L Palios
Proceeding of the MEGA 2007 conference, 2007
112007
Minimal separators in P4-sparse graphs
SD Nikolopoulos, L Palios
Discrete mathematics 306 (3), 381-392, 2006
112006
A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
SD Nikolopoulos, L Palios, C Papadopoulos
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006
112006
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs
SD Nikolopoulos, L Palios, C Papadopoulos
Discrete mathematics 309 (10), 3049-3060, 2009
102009
The system can't perform the operation now. Try again later.
Articles 1–20