| Clique-based separators for geometric intersection graphs M de Berg, S Kisfaludi-Bak, M Monemizadeh, L Theocharous Algorithmica 85 (6), 1652-1678, 2023 | 10 | 2023 |
| Grid drawings of graphs with constant edge-vertex resolution MA Bekos, M Gronemann, F Montecchiani, D Pálvölgyi, A Symvonis, ... Computational Geometry 98, 101789, 2021 | 7 | 2021 |
| TSP in a Simple Polygon H Alkema, M de Berg, M Monemizadeh, L Theocharous 30th Annual European Symposium on Algorithms (ESA 2022), 2022 | 3 | 2022 |
| A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R 2 B Aronov, M de Berg, L Theocharous Proc. 40th International Symposium on Computational Geometry (SoCG 2024), 0 | 1 | |
| A Clique-Based Separator for Intersection Graphs of Geodesic Disks in B Aronov, M de Berg, L Theocharous arXiv preprint arXiv:2403.04905, 2024 | | 2024 |
| A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon M de Berg, L Theocharous arXiv preprint arXiv:2403.04513, 2024 | | 2024 |
| Clustering with Few Disks to Minimize the Sum of Radii M Abrahamsen, S de Berg, L Meijer, A Nusser, L Theocharous arXiv preprint arXiv:2312.08803, 2023 | | 2023 |
| Clustering in Polygonal Domains M de Berg, L Biabani, M Monemizadeh, L Theocharous 34th International Symposium on Algorithms and Computation (ISAAC 2023), 2023 | | 2023 |
| Clustering with Obstacles M de Berg, L Biabani, M Monemizadeh, L Theocharous | | |
