 | 2009 |
|---|
| 41 |       | Evaggelos Lappas,
Stavros D. Nikolopoulos,
Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs.
IWOCA 2009: 368-379 |
| 2008 |
|---|
| 40 | | Dimitrios Koukopoulos,
Stavros D. Nikolopoulos,
Leonidas Palios,
Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability.
WALCOM 2008: 188-199 |
| 39 | | Ioannis Z. Emiris,
Leonidas Palios:
Editorial.
Comput. Geom. 41(1-2): 1 (2008) |
| 2007 |
|---|
| 38 | | Stavros D. Nikolopoulos,
Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs.
FAW 2007: 281-292 |
| 37 |  | Ioannis Kyriazis,
Ioannis Fudos,
Leonidas Palios:
Detecting features from sliced point clouds.
GRAPP (GM/R) 2007: 188-196 |
| 36 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Detecting Holes and Antiholes in Graphs.
Algorithmica 47(2): 119-138 (2007) |
| 35 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs.
Discrete Applied Mathematics 155(14): 1858-1877 (2007) |
| 2006 |
|---|
| 34 | | Stavros D. Nikolopoulos,
Leonidas Palios,
Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.
WG 2006: 256-268 |
| 33 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Minimal separators in P4-sparse graphs.
Discrete Mathematics 306(3): 381-392 (2006) |
| 32 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 65-82 (2006) |
| 2005 |
|---|
| 31 | | Paraskevi Fragopoulou,
Stavros D. Nikolopoulos,
Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics.
ISAAC 2005: 1080-1089 |
| 30 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.
Panhellenic Conference on Informatics 2005: 68-79 |
| 29 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Adding an Edge in a Cograph.
WG 2005: 214-226 |
| 28 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HHDS-Free Graphs.
WG 2005: 456-467 |
| 27 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Efficient parallel recognition of cographs.
Discrete Applied Mathematics 150(1-3): 182-215 (2005) |
| 26 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Recognition of Bipolarizable and P4-simplicial Graphs.
Discrete Mathematics & Theoretical Computer Science 7(1): 231-254 (2005) |
| 25 | | Vassilios V. Dimakopoulos,
Leonidas Palios,
Athanasios S. Poulakidas:
On the hamiltonicity of the cartesian product.
Inf. Process. Lett. 96(2): 49-53 (2005) |
| 2004 |
|---|
| 24 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Hole and antihole detection in graphs.
SODA 2004: 850-859 |
| 23 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HHD-free and Welsh-Powell Opposition Graphs.
WG 2004: 105-116 |
| 22 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation.
Algorithmica 39(2): 95-126 (2004) |
| 21 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs.
Electronic Notes in Discrete Mathematics 17: 229-235 (2004) |
| 20 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Parallel algorithms for P4-comparability graphs.
J. Algorithms 51(1): 77-104 (2004) |
| 19 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs.
Parallel Processing Letters 14(1): 119-129 (2004) |
| 18 | | Ka Wong Chong,
Stavros D. Nikolopoulos,
Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm.
Theory Comput. Syst. 37(4): 527-546 (2004) |
| 2003 |
|---|
| 17 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs.
WG 2003: 358-369 |
| 2002 |
|---|
| 16 | | Ioannis Fudos,
Leonidas Palios,
Evaggelia Pitoura:
Geometric-Similarity Retrieval in Large Image Bases.
ICDE 2002: 441- |
| 15 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Recognition of P4-Comparability Graphs.
WG 2002: 355-366 |
| 14 | | Ioannis Fudos,
Leonidas Palios:
An efficient shape-based approach to image retrieval.
Pattern Recognition Letters 23(6): 731-741 (2002) |
| 2001 |
|---|
| 13 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognition and Orientation Algorithms for P4-Comparability Graphs.
ISAAC 2001: 320-331 |
| 2000 |
|---|
| 12 | | Ioannis Fudos,
Leonidas Palios:
An Efficient Shape-Based Approach to Image Retrieval.
DGCI 2000: 505-517 |
| 11 | | Leonidas Palios:
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon.
SWAT 2000: 367-382 |
| 1997 |
|---|
| 10 | | Bernard Chazelle,
Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron.
Algorithmica 17(3): 245-265 (1997) |
| 9 | | Leonidas Palios:
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments.
J. Algorithms 22(1): 57-92 (1997) |
| 1996 |
|---|
| 8 | | Leonidas Palios:
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon.
Comput. Geom. 6: 263-276 (1996) |
| 1994 |
|---|
| 7 | | Leonidas Palios:
On the Number of Extrema of a Polyhedron.
CCCG 1994: 320-325 |
| 6 | | Leonidas Palios:
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon.
CCCG 1994: 350-356 |
| 5 | | Leonidas Palios:
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments.
SWAT 1994: 255-266 |
| 4 | | Spyros G. Tzafestas,
Leonidas Palios,
F. Cholin:
Diagnostic expert system inference engine based on the certainty factors model.
Knowl.-Based Syst. 7(1): 17-26 (1994) |
| 1992 |
|---|
| 3 | | Bernard Chazelle,
Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron.
SWAT 1992: 364-375 |
| 1990 |
|---|
| 2 | | Bernard Chazelle,
Leonidas Palios:
Triangulating a Nonconvex Polytope.
Discrete & Computational Geometry 5: 505-526 (1990) |
| 1989 |
|---|
| 1 | | Bernard Chazelle,
Leonidas Palios:
Triangulating a Non-Convex Polytype.
Symposium on Computational Geometry 1989: 393-400 |
