Leonidas Palios

73 papers A* 2B 12C 3Misc 3Journal 41Unranked 12

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