Curriculum Vitae [pdf]

Publications

Journals

• S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, "Maximizing the Number of Spanning Trees in K_n-complements of Asteroidal Graphs," Discrete Mathematics 309(10) (2009), 3049-3060.
• S.D. Nikolopoulos and L. Palios, "Detecting Holes and Antiholes in Graphs," Algorithmica 47(2) (2007), 119-138.
• S.D. Nikolopoulos and L. Palios, "On the Parallel Computation of Biconnected and Strongly Connected Co-Components of Graphs," Discrete Applied Mathematics 155(14) (2007), 1858-1877.
• S.D. Nikolopoulos and L. Palios, "Minimal Separators in P4-sparse Graphs," Discrete Mathematics 306(3) (2006), 381-392.
• S.D. Nikolopoulos and L. Palios, "Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs," Discrete Mathematics & Theoretical Computer Science 8(1) (2006), 65-82.
• S.D. Nikolopoulos and L. Palios, "On the Recognition of Bipolarizable and P4-simplicial Graphs," Discrete Mathematics & Theoretical Computer Science 7(1) (2005), 231-254.
• S.D. Nikolopoulos and L. Palios, "Efficient Parallel Recognition of Cographs," Discrete Applied Mathematics, 2005 [pdf].
• V. Dimakopoulos, L. Palios, and A. Poulakidas, "On the Hamiltonicity of the Cartesian Product," Information Processing Letters, 2005 [ps].
• S.D. Nikolopoulos and L. Palios, "Algorithms for P4-comparability Graph Recognition and Acyclic P4-transitive Orientation," Algorithmica 39 (2004), 95-126 [pdf].
• K.W. Chong, S.D. Nikolopoulos, and L. Palios, "An optimal parallel Co-connectivity Algorithm," Theory of Computing Systems 37 (2004), 527-546 [pdf].
• S.D. Nikolopoulos and L. Palios, "Parallel Algorithms for P4-comparability Graphs," J. Algorithms 51 (2004), 77-104 [pdf].
• S.D. Nikolopoulos and L. Palios, "Parallel Algorithms for recognizing P5-free and co-P5-free Weakly Chordal Graphs," Parallel Processing Letters 14(1) (2004), 119-129 [pdf].
• I. Fudos and L. Palios, "An Efficient Shape-Based Approach to Image Retrieval," Pattern Recognition Letters 23 (2002), 731-741 [pdf].
• B. Chazelle and L. Palios, "Decomposing the Boundary of a Non-Convex Polyhedron," Algorithmica 17(3) (1997), 245-265 [pdf].
• L. Palios, "Connecting the Maximum Number of Nodes in the Grid to the Boundary with Non-Intersecting Line Segments," Journal of Algorithms 22 (1997), 57-92 [pdf].
• L. Palios, "Optimal Tetrahedralization of the 3d-Region 'between' a Convex Polyhedron and a Convex Polygon," Computational Geometry: Theory and Applications 6 (1996), 263-276 [pdf].
• B. Chazelle and L.Palios, "Triangulating a Non-Convex Polyhedron," Discrete and Computational Geometry 5 (1990), 505-526 [pdf].
• S. Tzafestas, L. Palios, and F. Cholin, "Diagnostic Expert System Inference Engine based on the Certainty Factors Model," Knowledge-Based Systems 7(1) (1994), 17-26.

Book Chapter

• B. Chazelle and L. Palios, "Decomposition Algorithms in Geometry," Algebraic Geometry and its Applications, C.L.Bajaj (ed.), 419-447, Springer Verlag, 1994.

Edited Work

• I. Emiris and L. Palios, Computational Geometry 41(1-2), 2008. (selected papers from Euro-CG 2006)

International Conferences - Workshops

• S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, "Counting Spanning Trees in Graphs using Modular Decomposition," WALCOM 2011.
• E. Lappas, S.D. Nikolopoulos, and L. Palios, "An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs," IWOCA 2009, 368-379.
• D. Koukopoulos, S.D. Nikolopoulos, L. Palios, and P.G. Spirakis, "Optimal Algorithms for Detecting Network Stability," WALCOM 2008, LNCS 4921 (2008), 188-199.
• S.D. Nikolopoulos and L. Palios, "An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs," FAW 2007, 281-292.
• I. Kyriazis, I. Fudos, and L. Palios, "Detecting Features from Sliced Point Clouds," GRAPP 2007, 188-196.
• S.D. Nikolopoulos, L. Palios, and C. Papadopoulos, "A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs," Proc. 32nd Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2006, LNCS 4271 (2006), 256-268.
• P. Fragopoulou, S.D. Nikolopoulos, and L. Palios, "Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics," Proc. 16th Intern. Symposium on Algorithms and Computation - ISAAC 2005, LNCS 3827 (2005), 1080-1089.
• S.D. Nikolopoulos and L. Palios, "Adding an Edge in a Cograph," Proc. 31st Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2005, LNCS 3787 (2005), 214-226.
• S.D. Nikolopoulos and L. Palios, "Recognizing HHDS-free Graphs," Proc. 31st Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2005, LNCS 3787 (2005), 456-467.
• S.D. Nikolopoulos and L. Palios, "Recognizing HHD-free and Welsh-Powell Opposition Graphs," Proc. 30th Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2004, LNCS 3353 (2004), 105-116 [pdf].
• S.D. Nikolopoulos and L. Palios, "On the Strongly Connected and Biconnected Components of the Complement of Graphs," Proc. Workshop on Graphs and Combinatorial Optimization - CTW 2004, Electronic Notes in Discrete Mathematics 17 (2004), 229-235 [pdf].
• S.D. Nikolopoulos and L. Palios, "Hole and Antihole Detection in Graphs," Proc. ACM-SIAM Symposium on Discrete Algorithms - SODA 2004, 843-852, 2004 [pdf].
• L. Palios, "Verification of Partitions of 2d and 3d objects," Proc. 20th European Workshop on Computational Geometry - EWCG 2004, 171-174, 2004 [ps].
• S.D. Nikolopoulos and L. Palios, "Recognizing Bipolarizable and P4-simplicial Graphs," Proc. 29th Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2003, LNCS 2880 (2003), 358-369 [pdf].
• S.D. Nikolopoulos and L. Palios, "On the Recognition of P4-comparability Graphs," Proc. 28th Intern. Workshop on Graph-Theoretic Concepts in Computer Science - WG 2002, LNCS 2573 (2002), 355-366 [pdf].
• I. Fudos, L. Palios, and E. Pitoura, "Geometric Similarity Retrieval in Large Image Bases," Proc. International Conference on Data Engineerine - ICDE 2002, 441-450, 2002 [pdf].
• S.D. Nikolopoulos and L. Palios, "Recognition and Orientation Algorithms for P4-comparability Graphs," Proc. 12th Intern. Symposium on Algorithms and Computation - ISAAC 2001, LNCS 2223 (2001), 320-331 [pdf].
• L. Palios, "A linear-time Algorithm for computing the Optimal Bridge connecting two Disjoint Convex Polygons," Proc. 17th European Workshop on Computational Geometry - EWCG 2001, (2001) [ps].
• I. Fudos and L. Palios, "An Efficient Shape-Based Approach to Image Retrieval," in G.Borgefors, I. Nystrom, and G. Sanniti di Baja (eds.), Proc. 9th Discrete Geometry for Computer Imagery Conference - DGCI 2000, LNCS 1953 (2000), 505-517 [pdf].
• L. Palios, "A new Competitive Strategy for Reaching the Kernel of an Unknown Polygon," Proc. Algorithm Theory - SWAT 2000, LNCS 1851 (2000), 367-382 [pdf].
• L. Palios, "On the Number of Extrema of a Polyhedron," Proc. 6th Canadian Conference on Computational Geometry (1994), 320-325.
• L. Palios, "Optimal Tetrahedralization of the 3d-Region 'between' a Convex Polyhedron and a Convex Polygon," Proc. 6th Canadian Conference on Computational Geometry (1994), 350-356.
• L. Palios, "Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments," Proc. Algorithm Theory - SWAT '94, LNCS 824 (1994), 255-266.
• B. Chazelle and L. Palios, "Decomposing the Boundary of a Non-Convex Polyhedron," Proc. Algorithm Theory - SWAT '92, LNCS 621 (1992), 364-375.
• B. Chazelle and L. Palios, "Triangulating a Non-Convex Polytope," Proc. 5th ACM Symposium on Computational Geometry (1989), 393-400 [pdf].

Additional Technical Reports

• L. Palios, "Verification of Partitions of 2d and 3d Objects," Technical Report TR-23-01, Computer Science Department, University of Ioannina [ps].
• L. Palios, "A linear-time Algorithm for computing the Optimal Bridge connecting two Disjoint Convex Polygons," Technical Report TR-22-00, Computer Science Department, University of Ioannina [ps].
• L. Palios, "Linear time Algorithms for Tree Partitions with small Cutsize," Technical Report TR-34-99, Computer Science Department, University of Ioannina [ps].
• L. Palios, "Upper and Lower Bounds for Optimal Tree Partitions," Technical Report GCG68, The Geometry Center, University of Minnesota [ps].

Other Papers

• L. Palios, "Motion Planning in Unknown Environments," Proc. 3rd IMACS Intern. Conf. on Communications, Circuits, Systems and Computers - CCSC '99, Computers and Computational Engineering in Control, N. Mastorakis (ed.) (1999), 353-362.
• S. Tzafestas and L. Palios, "Improved Diagnostic Expert System based on Bayesian Inference," Proc. 12th IMACS World Congress on Scientific Computation (1988).

English Textbook Translation

• Translation, in collaboration with S.D. Nikolopoulos, of the textbook
  A. Biermann, "Great Ideas in Computer Science: A Gentle Introduction," 2nd edition, MIT Press, 1997
  which has been published by University of Crete Press.
• Participation, along with P. Fragopoulou, G.F. Georgakopoulos, and S.D. Nikolopoulos, in the scientific terminology team for the translation of the textbook
  T. Cormen, C. Leiserson, R. Rivest, and C. Stein, "Introduction to Algorithms," 2nd edition, MIT Press, 2001
  which has been published by University of Crete Press.

Course Notes

• L. Palios, Computational Geometry, Course Notes, University of Ioannina.

Animations

• L. Palios, “Tetrahedralizing the 3d-Region ‘between’ a Convex Polyhedron and a Convex Polygon: The Movie,” Video, The Geometry Center, Univ. of Minnesota (1994).
• L. Palios and M. Philips, “Tetrahedral Break-Up,” in “Animation of Geometric Algorithms: A Video Review,” 8th ACM Symposium on Computational Geometry (1992).