No. Title Author Year
1 Approximate Range Queries for Clustering Oh, Eunjin et al. 2018
2 On Romeo and Juliet Problems: Minimizing Distance-to-Sight Ahn, Hee-Kap et al. 2018
3 Point Location in Dynamic Planar Subdivisions Oh, Eunjin et al. 2018
4 A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms Oh, Eunjin et al. 2017
5 Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons Oh, Eunjin et al. 2017
6 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
7 Finding Pairwise Intersections of Rectangles in a Query Rectangle Oh, Eunjin et al. 2017
8 Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon Oh, Eunjin et al. 2017
9 A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree Oh, Eunjin et al. 2016
10 Assigning Weights to Minimize the Covering Radius in the Plane Oh, Eunjin et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI