Grid Drawings of Graphs with Constant Edge-Vertex Resolution. - Michael A. Bekos; Martin Gronemann; Fabrizio Montecchiani; Antonios Symvonis; Leonidas Theocharous (CoRR, 2020)

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)

TSP in a Simple Polygon. - Henk Alkema; Mark de Berg; Morteza Monemizadeh; Leonidas Theocharous (ESA, 2022)

Clustering in Polygonal Domains. - Mark de Berg; Leyla Biabani; Morteza Monemizadeh; Leonidas Theocharous (ISAAC, 2023)

Clique-Based Separators for Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Morteza Monemizadeh; Leonidas Theocharous (Algorithmica, 2023)

Clustering with Few Disks to Minimize the Sum of Radii. - Mikkel Abrahamsen; Sarita de Berg; Lucas Meijer; André Nusser; Leonidas Theocharous (SoCG, 2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². - Boris Aronov; Mark de Berg; Leonidas Theocharous (SoCG, 2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. - Mark de Berg; Leonidas Theocharous (SoCG, 2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. - Boris Aronov; Mark de Berg; Leonidas Theocharous (CoRR, 2024)

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 (CoRR, 2025)