Dynamic Data Structures for k-Nearest Neighbor Queries. - Sarita de Berg; Frank Staals (ISAAC, 2021)

The Complexity of Geodesic Spanners. - Sarita de Berg; Marc J. van Kreveld; Frank Staals (SoCG, 2023)

Dynamic data structures for k-nearest neighbor queries. - Sarita de Berg; Frank Staals (Comput. Geom., 2023)

Exact solutions to the Weighted Region Problem. - Sarita de Berg; Guillermo Esteban; Rodrigo I. Silveira; Frank Staals (CCCG, 2024)

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

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. - Sarita de Berg; Tillmann Miltzow; Frank Staals (SoCG, 2024)

The Complexity of Geodesic Spanners Using Steiner Points. - Sarita de Berg; Tim Ophelders; Irene Parada; Frank Staals; Jules Wulms (ISAAC, 2024)

Competitive Searching over Terrains. - Sarita de Berg; Nathan van Beusekom; Max van Mulken; Kevin Verbeek; Jules Wulms (LATIN (1), 2024)

Nearest Neighbor Searching in a Dynamic Simple Polygon. - Sarita de Berg; Frank Staals (SoCG, 2025)

Instance-Optimal Imprecise Convex Hull. - Sarita de Berg; Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann; Sampson Wong (ESA, 2025)

Simpler and Faster Contiguous Art Gallery. - Sarita de Berg; Jacobus Conradi; Ivor van der Hoog; Frank Staals (CoRR, 2025)

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve. - Sarita de Berg; Emil Toftegaard Gæde; Ivor van der Hoog; Eva Rotenberg (CoRR, 2025)