Palios, Leonidas - Department of Computer Science, University of Ioannina

Advanced Search

Palios, Leonidas - Department of Computer Science, University of Ioannina

An efficient shape-based approach to image retrieval Ioannis Fudos *, Leonidas Palios
Available online at www.sciencedirect.com Journal of Algorithms 51 (2004) 77104
Triangulating a Nonconvex Polytope. Chazelle, B.; Palios, L.
On the Strongly Connected and Biconnected Components of the Complement of Graphs
DOI: 10.1007/s00224-003-1074-x Theory Comput. Systems 37, 527546 (2004)
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
Recognizing HHD-free and Welsh-Powell Opposition Graphs
Recognizing Bipolarizable and P4-Simplicial Stavros D. Nikolopoulos and Leonidas Palios
DOI: 10.1007/s00453-003-1075-9 Algorithmica (2004) 39: 95126
On the Recognition of P4-Comparability Graphs Stavros D. Nikolopoulos and Leonidas Palios
Triangulating a Nonconvex Polytope This paper is concerned with the problem of partitioning
ARTICLE IN PRESS Discrete Applied Mathematics ( )
Hole and Antihole Detection in Graphs Stavros D. Nikolopoulos
. : 26510-08807 e-mail: palios@cs.uoi.gr
Recognition and Orientation Algorithms for P4-Comparability Graphs
Counting Spanning Trees in Graphs using Modular Decomposition
Verification of Partitions of 2d and 3d Objects Leonidas Palios
On the Hamiltonicity of the Cartesian Product Vassilios V. Dimakopoulos #
Reaching the Kernel of an Unknown Polygon Fast Leonidas Palios
Multisource Trees: Algorithms for Minimizing Eccentricity Cost Metrics
A LinearTime Algorithm for Computing the Optimal Bridge Connecting Two Disjoint Convex Polygons
Upper and Lower Bounds for Optimal Tree Partitions + Leonidas Palios
Verification of Partitions of 2d and 3d Objects Leonidas Palios
A LinearTime Algorithm to Compute the Optimal Bridge Connecting Two Disjoint Convex Polygons
Lineartime Algorithms for Tree Partitions with Small Cutsize
Z .JOURNAL OF ALGORITHMS 22, 57 92 1997 ARTICLE NO. AL950798
Computational Theory and Applications