default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonidas Palios
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Anna Mpanti, Stavros D. Nikolopoulos
, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. Algorithms 16(6): 289 (2023)- [j31]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. 31(2): 107-128 (2023) - [i9]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a P4-sparse Graph. CoRR abs/2302.00112 (2023) - [i8]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. CoRR abs/2302.00657 (2023) - 2022
- [i7]Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski:
The Rectilinear Steiner Forest Arborescence problem. CoRR abs/2210.04576 (2022) - 2021
- [j30]Alejandra Martínez-Moraian, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Optimizing generalized kernels of polygons. J. Glob. Optim. 80(4): 887-920 (2021) - [c30]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Illuminating the x-Axis by α-Floodlights. ISAAC 2021: 11:1-11:12 - 2020
- [c29]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON 2020: 311-323 - [i6]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR abs/2007.08368 (2020)
2010 – 2019
- 2019
- [j29]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): 543-566 (2019) - 2018
- [j28]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. 250: 145-164 (2018) - [i5]David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Generalized kernels of polygons under rotation. CoRR abs/1802.05995 (2018) - [i4]Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia:
Capturing points with a rotating polygon (and a 3D extension). CoRR abs/1805.02570 (2018) - [i3]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR abs/1812.11080 (2018) - 2017
- [i2]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR abs/1712.08482 (2017) - 2016
- [c28]Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot:
Realizing Farthest-Point Voronoi Diagrams. CCCG 2016: 48-56 - 2015
- [c27]Leonidas Palios:
An Output-Sensitive Algorithm for Computing the s-Kernel. CCCG 2015 - 2014
- [j27]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): 646-654 (2014) - [j26]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55(2): 347-379 (2014) - [j25]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526: 41-57 (2014) - [c26]Leonidas Palios, Petros Tzimas:
Minimum r-Star Cover of Class-3 Orthogonal Polygons. IWOCA 2014: 286-297 - 2013
- [j24]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): 593-608 (2013) - 2012
- [j23]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P4-sparse graphs. Theor. Comput. Sci. 439: 41-57 (2012) - [j22]Stavros D. Nikolopoulos, Leonidas Palios:
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452: 117-131 (2012) - 2011
- [c25]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CSR 2011: 195-208 - [c24]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM 2011: 202-213 - 2010
- [j21]Ioannis Z. Emiris, Christos Konaxis, Leonidas Palios:
Computing the Newton Polygon of the Implicit Equation. Math. Comput. Sci. 4(1): 25-44 (2010) - [i1]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CoRR abs/1012.4938 (2010)
2000 – 2009
- 2009
- [j20]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. Discret. Math. 309(10): 3049-3060 (2009) - [c23]Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA 2009: 368-379 - 2008
- [j19]Ioannis Z. Emiris, Leonidas Palios:
Editorial. Comput. Geom. 41(1-2): 1 (2008) - [c22]Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability. WALCOM 2008: 188-199 - 2007
- [j18]Stavros D. Nikolopoulos, Leonidas Palios:
Detecting Holes and Antiholes in Graphs. Algorithmica 47(2): 119-138 (2007) - [j17]Stavros D. Nikolopoulos, Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. 155(14): 1858-1877 (2007) - [c21]Stavros D. Nikolopoulos, Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. FAW 2007: 281-292 - [c20]Ioannis Kyriazis, Ioannis Fudos, Leonidas Palios:
Detecting features from sliced point clouds. GRAPP (GM/R) 2007: 188-196 - 2006
- [j16]Stavros D. Nikolopoulos, Leonidas Palios:
Minimal separators in P4-sparse graphs. Discret. Math. 306(3): 381-392 (2006) - [j15]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 65-82 (2006) - [c19]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268 - 2005
- [j14]Stavros D. Nikolopoulos, Leonidas Palios:
Efficient parallel recognition of cographs. Discret. Appl. Math. 150(1-3): 182-215 (2005) - [j13]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of Bipolarizable and P4-simplicial Graphs. Discret. Math. Theor. Comput. Sci. 7(1): 231-254 (2005) - [j12]Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas:
On the hamiltonicity of the cartesian product. Inf. Process. Lett. 96(2): 49-53 (2005) - [c18]Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC 2005: 1080-1089 - [c17]Stavros D. Nikolopoulos, Leonidas Palios:
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics 2005: 68-79 - [c16]Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a Cograph. WG 2005: 214-226 - [c15]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHDS-Free Graphs. WG 2005: 456-467 - 2004
- [j11]Stavros D. Nikolopoulos, Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. Algorithmica 39(2): 95-126 (2004) - [j10]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. Electron. Notes Discret. Math. 17: 229-235 (2004) - [j9]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel algorithms for P4-comparability graphs. J. Algorithms 51(1): 77-104 (2004) - [j8]Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37(4): 527-546 (2004) - [j7]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. Parallel Process. Lett. 14(1): 119-129 (2004) - [c14]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. CTW 2004: 201-206 - [c13]Stavros D. Nikolopoulos, Leonidas Palios:
Hole and antihole detection in graphs. SODA 2004: 850-859 - [c12]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHD-free and Welsh-Powell Opposition Graphs. WG 2004: 105-116 - 2003
- [c11]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs. WG 2003: 358-369 - 2002
- [j6]Ioannis Fudos, Leonidas Palios:
An efficient shape-based approach to image retrieval. Pattern Recognit. Lett. 23(6): 731-741 (2002) - [c10]Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura:
Geometric-Similarity Retrieval in Large Image Bases. ICDE 2002: 441-450 - [c9]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of P4-Comparability Graphs. WG 2002: 355-366 - 2001
- [c8]Stavros D. Nikolopoulos, Leonidas Palios:
Recognition and Orientation Algorithms for P4-Comparability Graphs. ISAAC 2001: 320-331 - 2000
- [c7]Ioannis Fudos, Leonidas Palios:
An Efficient Shape-Based Approach to Image Retrieval. DGCI 2000: 505-517 - [c6]Leonidas Palios:
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. SWAT 2000: 367-382
1990 – 1999
- 1997
- [j5]Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17(3): 245-265 (1997) - [j4]Leonidas Palios:
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. J. Algorithms 22(1): 57-92 (1997) - 1996
- [j3]Leonidas Palios:
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon. Comput. Geom. 6: 263-276 (1996) - 1994
- [j2]Spyros G. Tzafestas, Leonidas Palios, F. Cholin:
Diagnostic expert system inference engine based on the certainty factors model. Knowl. Based Syst. 7(1): 17-26 (1994) - [c5]Leonidas Palios:
On the Number of Extrema of a Polyhedron. CCCG 1994: 320-325 - [c4]Leonidas Palios:
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon. CCCG 1994: 350-356 - [c3]Leonidas Palios:
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. SWAT 1994: 255-266 - 1992
- [c2]Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. SWAT 1992: 364-375 - 1990
- [j1]Bernard Chazelle, Leonidas Palios:
Triangulating a Nonconvex Polytope. Discret. Comput. Geom. 5: 505-526 (1990)
1980 – 1989
- 1989
- [c1]Bernard Chazelle, Leonidas Palios:
Triangulating a Non-Convex Polytype. SCG 1989: 393-400
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
