Leonidas Palios

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 16

Top Topics

Robust Image Watermarking

Top Venues

Theory Comput. Syst.

Publications

Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Adding a Tail in Classes of Perfect Graphs. Algorithms 16 (6) (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. 31 (2) (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
-sparse Graph. CoRR (2023)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Adding a Tail in Classes of Perfect Graphs. CoRR (2023)
Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski
The Rectilinear Steiner Forest Arborescence problem. CoRR (2022)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Illuminating the x-Axis by α-Floodlights. ISAAC (2021)
Alejandra Martínez-Moraian, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Optimizing generalized kernels of polygons. J. Glob. Optim. 80 (4) (2021)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON (2020)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR (2020)
Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia
Capturing Points with a Rotating Polygon (and a 3D Extension). Theory Comput. Syst. 63 (3) (2019)
David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Generalized kernels of polygons under rotation. CoRR (2018)
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR (2018)
Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. 250 (2018)
Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia
Capturing points with a rotating polygon (and a 3D extension). CoRR (2018)
Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR (2017)
Therese C. Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot
Realizing Farthest-Point Voronoi Diagrams. CCCG (2016)
Leonidas Palios
An Output-Sensitive Algorithm for Computing the s-Kernel. CCCG (2015)
Leonidas Palios, Petros Tzimas
Minimum r-Star Cover of Class-3 Orthogonal Polygons. IWOCA (2014)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55 (2) (2014)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526 (2014)
Andrzej Lingas, Leonidas Palios, Agnieszka Wasylewicz, Pawel Zylinski
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. Inf. Process. Lett. 114 (11) (2014)
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
An O(n)-time algorithm for the paired domination problem on permutation graphs. Eur. J. Comb. 34 (3) (2013)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-sparse graphs. Theor. Comput. Sci. 439 (2012)
Stavros D. Nikolopoulos, Leonidas Palios
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452 (2012)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM (2011)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs. CSR (2011)
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
Join-Reachability Problems in Directed Graphs CoRR (2010)
Ioannis Z. Emiris, Christos Konaxis, Leonidas Palios
Computing the Newton Polygon of the Implicit Equation. Math. Comput. Sci. 4 (1) (2010)
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA (2009)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-complements of asteroidal graphs. Discret. Math. 309 (10) (2009)
Ioannis Z. Emiris, Leonidas Palios
Editorial. Comput. Geom. 41 (1-2) (2008)
Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis
Optimal Algorithms for Detecting Network Stability. WALCOM (2008)
Ioannis Kyriazis, Ioannis Fudos, Leonidas Palios
Detecting features from sliced point clouds. GRAPP (GM/R) (2007)
Stavros D. Nikolopoulos, Leonidas Palios
)-Time Certifying Algorithm for Recognizing HHD-Free Graphs. FAW (2007)
Stavros D. Nikolopoulos, Leonidas Palios
On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. 155 (14) (2007)
Stavros D. Nikolopoulos, Leonidas Palios
Detecting Holes and Antiholes in Graphs. Algorithmica 47 (2) (2007)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-Sparse Graphs. WG (2006)
Stavros D. Nikolopoulos, Leonidas Palios
-sparse graphs. Discret. Math. 306 (3) (2006)
Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Stavros D. Nikolopoulos, Leonidas Palios
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics (2005)
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC (2005)
Stavros D. Nikolopoulos, Leonidas Palios
Adding an Edge in a Cograph. WG (2005)
Stavros D. Nikolopoulos, Leonidas Palios
Efficient parallel recognition of cographs. Discret. Appl. Math. 150 (1-3) (2005)
Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas
On the hamiltonicity of the cartesian product. Inf. Process. Lett. 96 (2) (2005)
Stavros D. Nikolopoulos, Leonidas Palios
-simplicial Graphs. Discret. Math. Theor. Comput. Sci. 7 (1) (2005)
Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HHDS-Free Graphs. WG (2005)
Stavros D. Nikolopoulos, Leonidas Palios
On the Strongly Connected and Biconnected Components of the Complement of Graphs. CTW (2004)
Stavros D. Nikolopoulos, Leonidas Palios
Hole and antihole detection in graphs. SODA (2004)
Stavros D. Nikolopoulos, Leonidas Palios
-comparability graphs. J. Algorithms 51 (1) (2004)
Stavros D. Nikolopoulos, Leonidas Palios
-Transitive Orientation. Algorithmica 39 (2) (2004)
Stavros D. Nikolopoulos, Leonidas Palios
Recognizing HHD-free and Welsh-Powell Opposition Graphs. WG (2004)
Stavros D. Nikolopoulos, Leonidas Palios
-Free Weakly Chordal Graphs. Parallel Process. Lett. 14 (1) (2004)
Stavros D. Nikolopoulos, Leonidas Palios
On the Strongly Connected and Biconnected Components of the Complement of Graphs. Electron. Notes Discret. Math. 17 (2004)
Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37 (4) (2004)
Stavros D. Nikolopoulos, Leonidas Palios
Recognizing Bipolarizable and P 4-Simplicial Graphs. WG (2003)
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
Geometric-Similarity Retrieval in Large Image Bases. ICDE (2002)
Stavros D. Nikolopoulos, Leonidas Palios
-Comparability Graphs. WG (2002)
Ioannis Fudos, Leonidas Palios
An efficient shape-based approach to image retrieval. Pattern Recognit. Lett. 23 (6) (2002)
Stavros D. Nikolopoulos, Leonidas Palios
-Comparability Graphs. ISAAC (2001)
Leonidas Palios
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. SWAT (2000)
Ioannis Fudos, Leonidas Palios
An Efficient Shape-Based Approach to Image Retrieval. DGCI (2000)
Bernard Chazelle, Leonidas Palios
Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17 (3) (1997)
Leonidas Palios
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. J. Algorithms 22 (1) (1997)
Leonidas Palios
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon. Comput. Geom. 6 (1996)
Leonidas Palios
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon. CCCG (1994)
Leonidas Palios
On the Number of Extrema of a Polyhedron. CCCG (1994)
Spyros G. Tzafestas, Leonidas Palios, F. Cholin
Diagnostic expert system inference engine based on the certainty factors model. Knowl. Based Syst. 7 (1) (1994)
Leonidas Palios
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. SWAT (1994)
Bernard Chazelle, Leonidas Palios
Decomposing the Boundary of a Nonconvex Polyhedron. SWAT (1992)
Bernard Chazelle, Leonidas Palios
Triangulating a Nonconvex Polytope. Discret. Comput. Geom. 5 (1990)
Bernard Chazelle, Leonidas Palios
Triangulating a Non-Convex Polytype. SCG (1989)