Leonidas Theocharous

According to our database, Leonidas Theocharous authored at least 13 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons.

Mark de Berg, Prosenjit Bose, Leonidas Theocharous

Proceedings of the 20th Scandinavian Symposium on Algorithm Theory, 2026

2025

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$.

Boris Aronov, Mark de Berg, Leonidas Theocharous

Algorithmica, December, 2025

Realizing Metric Spaces with Convex Obstacles.

Sándor Kisfaludi-Bak, Leonidas Theocharous

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

An Improved Bound for Plane Covering Paths.

Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R².

Boris Aronov, Mark de Berg, Leonidas Theocharous

CoRR, 2024

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon.

Mark de Berg, Leonidas Theocharous

Proceedings of the 40th International Symposium on Computational Geometry, 2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ².

Boris Aronov, Mark de Berg, Leonidas Theocharous

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Clustering with Few Disks to Minimize the Sum of Radii.

Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Clustering in Polygonal Domains.

Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

TSP in a Simple Polygon.

Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Grid drawings of graphs with constant edge-vertex resolution.

Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous

Comput. Geom., 2021

Clique-Based Separators for Geometric Intersection Graphs.

Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution.

Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous

CoRR, 2020