Dynamic data structures for k-nearest neighbor queries S de Berg, F Staals Computational Geometry 111, 101976, 2023 | 6 | 2023 |
The complexity of geodesic spanners S de Berg, M van Kreveld, F Staals arXiv preprint arXiv:2303.02997, 2023 | 2 | 2023 |
The Complexity of Geodesic Spanners using Steiner Points S de Berg, T Ophelders, I Parada, F Staals, J Wulms arXiv preprint arXiv:2402.12110, 2024 | 1 | 2024 |
Competitive Searching over Terrains S de Berg, N van Beusekom, M van Mulken, K Verbeek, J Wulms Latin American Symposium on Theoretical Informatics, 254-269, 2024 | | 2024 |
Exact solutions to the Weighted Region Problem S de Berg, G Esteban, RI Silveira, F Staals arXiv preprint arXiv:2402.12028, 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 |
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain S de Berg, T Miltzow, F Staals arXiv preprint arXiv:2303.00666, 2023 | | 2023 |
PMondriaan: A Parallel Hypergraph Partitioner S Berg | | 2020 |
Enumeration Of Self-Avoiding Walks Using Length Tripling S Berg | | 2017 |