Sarita de Berg

Orcid: 0000-0001-5555-966X

Affiliations:
  • IT University of Copenhage, Denmark


According to our database1, Sarita de Berg authored at least 16 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts.
CoRR, May, 2026

A dynamic (1+ϵ)-spanner for disk intersection graphs.
CoRR, April, 2026

Minimum Exposure Motion Planning.
CoRR, March, 2026

2025
The Contiguous Art Gallery Problem is in Θ(n log n).
CoRR, November, 2025

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve.
CoRR, August, 2025

Simpler and Faster Contiguous Art Gallery.
CoRR, August, 2025

Instance-Optimal Imprecise Convex Hull.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Nearest Neighbor Searching in a Dynamic Simple Polygon.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
Competitive Searching over Terrains.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

The Complexity of Geodesic Spanners Using Steiner Points.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain.
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

Exact solutions to the Weighted Region Problem.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023
Dynamic data structures for <i>k</i>-nearest neighbor queries.
Comput. Geom., April, 2023

The Complexity of Geodesic Spanners.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2021
Dynamic Data Structures for k-Nearest Neighbor Queries.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021


  Loading...