Items where Author is "Cabello, S."
Article
Alt, H., Cabello, S., Giannopoulos, P. 
ORCID: 0000-0002-6261-1961 & Knauer, C. (2018).
Minimum Cell Connection in Line Segment Arrangements.
International Journal of Computational Geometry & Applications, 27(03),
pp. 159-176.
doi: 10.1142/s0218195917500017
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2016).
The Complexity of Separating Points in the Plane.
Algorithmica, 74(2),
pp. 643-663.
doi: 10.1007/s00453-014-9965-6
Conference or Workshop Item
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2025).
Searching in Euclidean Spaces with Predictions.
In:
Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024,.
Workshop on Approximation and Online Algorithms (WAOA) - co-located with ALGO 2024, 5-6 Sep 2024, London, UK.
doi: 10.1007/978-3-031-81396-2
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2024).
Delaunay Triangulation and Convex Polygons with Predictions.
Paper presented at the 40th European Workshop on Computational Geometry, 13-15 Mar 2024, Ioannina, Greece.
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2023).
On k-means for segments and polylines.
In:
31st Annual European Symposium on Algorithms (ESA 2023).
ESA 2023, 4-6 Sep 2023, Amsterdam, the Netherlands.
doi: 10.4230/LIPIcs.ESA.2023.28
Other
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2024).
Searching in Euclidean Spaces with Predictions.
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2023).
On $k$-means for segments and polylines.
doi: 10.48550/arXiv.2305.10922