Triangulating a Non-Convex Polytype. - Bernard Chazelle; Leonidas Palios (SCG, 1989)

Triangulating a Nonconvex Polytope. - Bernard Chazelle; Leonidas Palios (Discret. Comput. Geom., 1990)

On the Number of Extrema of a Polyhedron. - Leonidas Palios (CCCG, 1994)

Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. - Leonidas Palios (SWAT, 1994)

Diagnostic expert system inference engine based on the certainty factors model. - Spyros G. Tzafestas; Leonidas Palios; F. Cholin (Knowl. Based Syst., 1994)

Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon. - Leonidas Palios (Comput. Geom., 1996)

Decomposing the Boundary of a Nonconvex Polyhedron. - Bernard Chazelle; Leonidas Palios (Algorithmica, 1997)

Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. - Leonidas Palios (J. Algorithms, 1997)

A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. - Leonidas Palios (SWAT, 2000)

Recognition and Orientation Algorithms for P4-Comparability Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (ISAAC, 2001)

Geometric-Similarity Retrieval in Large Image Bases. - Ioannis Fudos; Leonidas Palios; Evaggelia Pitoura (ICDE, 2002)

On the Recognition of P4-Comparability Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2002)

An efficient shape-based approach to image retrieval. - Ioannis Fudos; Leonidas Palios (Pattern Recognit. Lett., 2002)

Recognizing Bipolarizable and P 4-Simplicial Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2003)

Hole and antihole detection in graphs. - Stavros D. Nikolopoulos; Leonidas Palios (SODA, 2004)

Recognizing HHD-free and Welsh-Powell Opposition Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2004)

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. - Stavros D. Nikolopoulos; Leonidas Palios (Algorithmica, 2004)

On the Strongly Connected and Biconnected Components of the Complement of Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Electron. Notes Discret. Math., 2004)

Parallel algorithms for P4-comparability graphs. - Stavros D. Nikolopoulos; Leonidas Palios (J. Algorithms, 2004)

An Optimal Parallel Co-Connectivity Algorithm. - Ka Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2004)

Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Parallel Process. Lett., 2004)

Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. - Paraskevi Fragopoulou; Stavros D. Nikolopoulos; Leonidas Palios (ISAAC, 2005)

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. - Stavros D. Nikolopoulos; Leonidas Palios (Panhellenic Conference on Informatics, 2005)

Adding an Edge in a Cograph. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2005)

Recognizing HHDS-Free Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (WG, 2005)

Efficient parallel recognition of cographs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2005)

On the Recognition of Bipolarizable and P4-simplicial Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math. Theor. Comput. Sci., 2005)

On the hamiltonicity of the cartesian product. - Vassilios V. Dimakopoulos; Leonidas Palios; Athanasios S. Poulakidas (Inf. Process. Lett., 2005)

A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (WG, 2006)

Minimal separators in P4-sparse graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math., 2006)

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Math. Theor. Comput. Sci., 2006)

An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (FAW, 2007)

Detecting features from sliced point clouds. - Ioannis Kyriazis; Ioannis Fudos; Leonidas Palios (GRAPP (GM/R), 2007)

Detecting Holes and Antiholes in Graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Algorithmica, 2007)

On the parallel computation of the biconnected and strongly connected co-components of graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2007)

Optimal Algorithms for Detecting Network Stability. - Dimitrios Koukopoulos; Stavros D. Nikolopoulos; Leonidas Palios; Paul G. Spirakis (WALCOM, 2008)

Editorial. - Ioannis Z. Emiris; Leonidas Palios (Comput. Geom., 2008)

Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Discret. Math., 2009)

Computing the Newton Polygon of the Implicit Equation. - Ioannis Z. Emiris; Christos Konaxis; Leonidas Palios (Math. Comput. Sci., 2010)

Counting Spanning Trees in Graphs Using Modular Decomposition. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (WALCOM, 2011)

An O(nm)-time certifying algorithm for recognizing HHD-free graphs. - Stavros D. Nikolopoulos; Leonidas Palios (Theor. Comput. Sci., 2012)

A fully dynamic algorithm for the recognition of P4-sparse graphs. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Theor. Comput. Sci., 2012)

An O(n)-time algorithm for the paired domination problem on permutation graphs. - Evaggelos Lappas; Stavros D. Nikolopoulos; Leonidas Palios (Eur. J. Comb., 2013)

Minimum r-Star Cover of Class-3 Orthogonal Polygons. - Leonidas Palios; Petros Tzimas (IWOCA, 2014)

Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. - Andrzej Lingas; Leonidas Palios; Agnieszka Wasylewicz; Pawel Zylinski (Inf. Process. Lett., 2014)

Join-Reachability Problems in Directed Graphs. - Loukas Georgiadis; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2014)

Counting spanning trees using modular decomposition. - Stavros D. Nikolopoulos; Leonidas Palios; Charis Papadopoulos (Theor. Comput. Sci., 2014)

An Output-Sensitive Algorithm for Computing the s-Kernel. - Leonidas Palios (CCCG, 2015)

Realizing Farthest-Point Voronoi Diagrams. - Therese Biedl; Carsten Grimm; Leonidas Palios; Jonathan Richard Shewchuk; Sander Verdonschot (CCCG, 2016)

Generalized kernels of polygons under rotation. - David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (CoRR, 2018)

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (CoRR, 2018)

Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. - Maria Chroni; Stavros D. Nikolopoulos; Leonidas Palios (Discret. Appl. Math., 2018)

Capturing Points with a Rotating Polygon (and a 3D Extension). - Carlos Alegría-Galicia; David Orden; Leonidas Palios; Carlos Seara; Jorge Urrutia (Theory Comput. Syst., 2019)

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (COCOON, 2020)

Illuminating the x-Axis by α-Floodlights. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (ISAAC, 2021)

Optimizing generalized kernels of polygons. - Alejandra Martínez-Moraian; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (J. Glob. Optim., 2021)

The Rectilinear Steiner Forest Arborescence problem. - Lukasz Mielewczyk; Leonidas Palios; Pawel Zylinski (CoRR, 2022)

Adding an Edge in a P4-sparse Graph. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (CoRR, 2023)

Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (J. Comput. Secur., 2023)

Adding a Tail in Classes of Perfect Graphs. - Anna Mpanti; Stavros D. Nikolopoulos; Leonidas Palios (Algorithms, 2023)

On the Discrete and Semi-continuous Versions of the Two-Watchtower Problem in the Plane. - Leonidas Palios (CIAC (1), 2025)