Leonidas Theocharous

Orcid: 0000-0002-1707-6787

According to our database1, Leonidas Theocharous authored at least 12 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Realizing Metric Spaces with Convex Obstacles.
CoRR, September, 2025

An Improved Bound for Plane Covering Paths.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R<sup>2</sup>.
CoRR, 2024

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ².
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Clustering with Few Disks to Minimize the Sum of Radii.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Clustering in Polygonal Domains.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
TSP in a Simple Polygon.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Grid drawings of graphs with constant edge-vertex resolution.
Comput. Geom., 2021

Clique-Based Separators for Geometric Intersection Graphs.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Grid Drawings of Graphs with Constant Edge-Vertex Resolution.
CoRR, 2020


  Loading...