Leonidas Palios

542 total citations
27 papers, 252 citations indexed

About

Leonidas Palios is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Leonidas Palios has authored 27 papers receiving a total of 252 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 8 papers in Computer Vision and Pattern Recognition. Recurrent topics in Leonidas Palios's work include Advanced Graph Theory Research (13 papers), Complexity and Algorithms in Graphs (8 papers) and Interconnection Networks and Systems (7 papers). Leonidas Palios is often cited by papers focused on Advanced Graph Theory Research (13 papers), Complexity and Algorithms in Graphs (8 papers) and Interconnection Networks and Systems (7 papers). Leonidas Palios collaborates with scholars based in Greece, United States and Poland. Leonidas Palios's co-authors include Bernard Chazelle, Stavros D. Nikolopoulos, Ioannis Fudos, Charis Papadopoulos, Vassilios V. Dimakopoulos, Ioannis Z. Emiris, Spyros G. Tzafestaş, Bengt J. Nilsson, Evaggelia Pitoura and Carlos Seara and has published in prestigious journals such as Knowledge-Based Systems, Pattern Recognition Letters and Theoretical Computer Science.

In The Last Decade

Leonidas Palios

25 papers receiving 238 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Leonidas Palios Greece	8	146	84	71	71	37	27	252
Menelaos I. Karavelas Greece	10	142 1.0×	51 0.6×	87 1.2×	117 1.6×	38 1.0×	26	285
Hazel Everett Canada	11	233 1.6×	105 1.3×	135 1.9×	41 0.6×	42 1.1×	45	334
William Lenhart United States	7	150 1.0×	71 0.8×	76 1.1×	22 0.3×	47 1.3×	17	222
Michael Karasick United States	8	176 1.2×	58 0.7×	57 0.8×	115 1.6×	18 0.5×	17	276
Antoine Vigneron South Korea	10	178 1.2×	49 0.6×	96 1.4×	50 0.7×	57 1.5×	44	309
Xavier Goaoc France	8	102 0.7×	49 0.6×	75 1.1×	30 0.4×	10 0.3×	32	191
Elmar Langetepe Germany	10	114 0.8×	25 0.3×	81 1.1×	30 0.4×	86 2.3×	34	230
Maarten Löffler Netherlands	9	219 1.5×	63 0.8×	85 1.2×	56 0.8×	51 1.4×	46	291
Hannes Krasser Austria	11	273 1.9×	167 2.0×	105 1.5×	29 0.4×	9 0.2×	28	313
Wolfgang Mulzer Germany	10	178 1.2×	96 1.1×	69 1.0×	28 0.4×	45 1.2×	56	286

Countries citing papers authored by Leonidas Palios

Since Specialization

Citations

This map shows the geographic impact of Leonidas Palios's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leonidas Palios with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonidas Palios more than expected).

Fields of papers citing papers by Leonidas Palios

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leonidas Palios. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leonidas Palios. The network helps show where Leonidas Palios may publish in the future.

Co-authorship network of co-authors of Leonidas Palios

This figure shows the co-authorship network connecting the top 25 collaborators of Leonidas Palios. A scholar is included among the top collaborators of Leonidas Palios based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leonidas Palios. Leonidas Palios is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Nikolopoulos, Stavros D., et al.. (2022). Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. Journal of Computer Security. 31(2). 107–128. 1 indexed citations

Biedl, Thérèse, et al.. (2016). Realizing Farthest-Point Voronoi Diagrams.. eScholarship (California Digital Library). 48–56. 1 indexed citations

Nikolopoulos, Stavros D., Leonidas Palios, & Charis Papadopoulos. (2014). Counting spanning trees using modular decomposition. Theoretical Computer Science. 526. 41–57. 6 indexed citations

Nikolopoulos, Stavros D., et al.. (2012). AnO(n)-time algorithm for the paired domination problem on permutation graphs. European Journal of Combinatorics. 34(3). 593–608. 8 indexed citations

Nikolopoulos, Stavros D., Leonidas Palios, & Charis Papadopoulos. (2012). A fully dynamic algorithm for the recognition of P4-sparse graphs. Theoretical Computer Science. 439. 41–57. 1 indexed citations

Nikolopoulos, Stavros D., Leonidas Palios, & Charis Papadopoulos. (2008). Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. Discrete Mathematics. 309(10). 3049–3060. 5 indexed citations

Nikolopoulos, Stavros D. & Leonidas Palios. (2007). On the parallel computation of the biconnected and strongly connected co-components of graphs. Discrete Applied Mathematics. 155(14). 1858–1877. 1 indexed citations

Fudos, Ioannis, et al.. (2007). DETECTING FEATURES FROM SLICED POINT CLOUDS. 188–192. 3 indexed citations

Nikolopoulos, Stavros D. & Leonidas Palios. (2006). Minimal separators in P4-sparse graphs. Discrete Mathematics. 306(3). 381–392. 2 indexed citations

10.

Nikolopoulos, Stavros D. & Leonidas Palios. (2006). Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 8. 1 indexed citations

11.

Dimakopoulos, Vassilios V., et al.. (2005). On the hamiltonicity of the cartesian product. Information Processing Letters. 96(2). 49–53. 11 indexed citations

12.

Nikolopoulos, Stavros D. & Leonidas Palios. (2005). Efficient parallel recognition of cographs. Discrete Applied Mathematics. 150(1-3). 182–215. 2 indexed citations

13.

Nikolopoulos, Stavros D. & Leonidas Palios. (2004). Hole and antihole detection in graphs. Symposium on Discrete Algorithms. 850–859. 11 indexed citations

14.

Nikolopoulos, Stavros D. & Leonidas Palios. (2004). Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. Algorithmica. 39(2). 95–126. 1 indexed citations

15.

Nikolopoulos, Stavros D., et al.. (2004). An Optimal Parallel Co-Connectivity Algorithm. Theory of Computing Systems. 37(4). 6 indexed citations

16.

Fudos, Ioannis, Leonidas Palios, & Evaggelia Pitoura. (2003). Geometric-similarity retrieval in large image bases. 3. 441–450.

17.

Fudos, Ioannis & Leonidas Palios. (2002). An efficient shape-based approach to image retrieval. Pattern Recognition Letters. 23(6). 731–741. 8 indexed citations

18.

Palios, Leonidas. (1997). Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. Journal of Algorithms. 22(1). 57–92. 4 indexed citations

19.

Palios, Leonidas. (1992). Decomposition problems in computational geometry. UMI eBooks. 4 indexed citations

20.

Chazelle, Bernard & Leonidas Palios. (1989). Triangulating a non-convex polytype. 393–400. 72 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact