The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonidas Palios: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  38. Optimal Algorithms for Detecting Network Stability. [Citation Graph (, )][DBLP]


  39. An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. [Citation Graph (, )][DBLP]


  40. Editorial. [Citation Graph (, )][DBLP]


  41. Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002