### Selected Publications

A complete list can be found here.

- Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces, Kyungjin Cho, Eunjin Oh, ISAAC 2021 (Accepted)
- Feedback Vertex Set on Geometric Intersection Graphs, Shinwoo An, Eunjin Oh, ISAAC 2021 (Accepted)
- Reachability Problems for Transmission Graphs, Shinwoo An, Eunjin Oh, WADS 2021
- Shortest-Path Queries in Geometric Networks, Eunjin Oh, ISAAC 2020
- Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams. Eunjin Oh, SODA 2019
- Minimizing Distance-to-Sight in Polygonal Domains, Eunjin Oh, ISAAC 2018
- Point Location in Incremental Planar Subdivisions, Eunjin Oh, ISAAC 2018
- Approximate range clustering queries, Eunjin Oh and Hee-Kap Ahn, SoCG 2018
- Point location in dynamic planar subdivisions. Eunjin Oh and Hee-Kap Ahn, SoCG 2018
- Dynamic geodesic convex hulls in dynamic simple polygons, Eunjin Oh and Hee-Kap Ahn, SoCG 2017
- Voronoi diagrams for a moderate-sized point-set in a simple polygon, Eunjin Oh and Hee-Kap Ahn, SoCG 2017
- The farthest-point geodesic Voronoi diagram for points on the boundary of a simple polygon, Eunjin Oh, Luis Barba and Hee-Kap Ahn, SoCG 2016.
- A linear-time algorithm for the geodesic center of a simple polygon, Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou de Carufel, Matias Korman, and Eunjin Oh, SoCG 2015