Leonidas Palios
Orcid: 0000-0001-8630-3835
According to our database1,
Leonidas Palios
authored at least 60 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
3
1
1
1
3
3
1
2
1
1
1
2
2
3
5
1
2
1
1
1
1
1
1
1
1
1
1
2
1
4
2
1
2
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks.
J. Comput. Secur., 2023
2022
2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
Theory Comput. Syst., 2019
2018
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations.
Discret. Appl. Math., 2018
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks.
CoRR, 2018
2016
Realizing Farthest-Point Voronoi Diagrams.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227].
Inf. Process. Lett., 2014
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014
2013
Eur. J. Comb., 2013
2012
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
2011
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011
2010
2009
Maximizing the number of spanning trees in K<sub>n</sub>-complements of asteroidal graphs.
Discret. Math., 2009
2008
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008
2007
On the parallel computation of the biconnected and strongly connected co-components of graphs.
Discret. Appl. Math., 2007
Detecting features from sliced point clouds.
Proceedings of the GRAPP 2007, 2007
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007
2006
Discret. Math. Theor. Comput. Sci., 2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
2005
On the Recognition of Bipolarizable and <i>P</i><sub><i>4</i></sub>-simplicial Graphs.
Discret. Math. Theor. Comput. Sci., 2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Proceedings of the Advances in Informatics, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Parallel Algorithms For Recognizing P5-Free And P<sup>5</sup>-Free Weakly Chordal Graphs.
Parallel Process. Lett., 2004
Electron. Notes Discret. Math., 2004
Algorithms for P<sub>4</sub>-Comparability Graph Recognition and Acyclic P<sub>4</sub>-Transitive Orientation.
Algorithmica, 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002
2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Proceedings of the Algorithm Theory, 2000
1997
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments.
J. Algorithms, 1997
1996
Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon.
Comput. Geom., 1996
1994
Knowl. Based Syst., 1994
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments.
Proceedings of the Algorithm Theory, 1994
On the Number of Extrema of a Polyhedron.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1990
1989
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989