| No. |
Title |
Author |
Year |
| 1 |
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs |
Oh, Eunjin et al. |
2023 |
| 2 |
Feedback Vertex Set on Geometric Intersection Graphs |
An, Shinwoo et al. |
2021 |
| 3 |
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces |
Cho, Kyungjin et al. |
2021 |
| 4 |
Shortest-Path Queries in Geometric Networks |
Oh, Eunjin |
2020 |
| 5 |
Approximate Range Queries for Clustering |
Oh, Eunjin et al. |
2018 |
| 6 |
Minimizing Distance-to-Sight in Polygonal Domains |
Oh, Eunjin |
2018 |
| 7 |
On Romeo and Juliet Problems: Minimizing Distance-to-Sight |
Ahn, Hee-Kap et al. |
2018 |
| 8 |
Point Location in Dynamic Planar Subdivisions |
Oh, Eunjin et al. |
2018 |
| 9 |
Point Location in Incremental Planar Subdivisions |
Oh, Eunjin |
2018 |
| 10 |
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms |
Oh, Eunjin et al. |
2017 |
| 11 |
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons |
Oh, Eunjin et al. |
2017 |
| 12 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |
| 13 |
Finding Pairwise Intersections of Rectangles in a Query Rectangle |
Oh, Eunjin et al. |
2017 |
| 14 |
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon |
Oh, Eunjin et al. |
2017 |
| 15 |
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree |
Oh, Eunjin et al. |
2016 |
| 16 |
Assigning Weights to Minimize the Covering Radius in the Plane |
Oh, Eunjin et al. |
2016 |
| 17 |
Constrained Geodesic Centers of a Simple Polygon |
Oh, Eunjin et al. |
2016 |
| 18 |
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon |
Oh, Eunjin et al. |
2016 |
| 19 |
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon |
Ahn, Hee Kap et al. |
2015 |
