A complete list can be found here.
- Parameterized Algorithm for the Planar Disjoint Paths Problem: Exponential in k^2, and Linear in n , Kyungjin Cho, Seunghyeok Oh, and Eunjin Oh, SODA 2023 (Accepted)
- The Maximum-Level Vertex in an Arrangement of Lines, Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir, Discrete. Comput. Geom 2022
- Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces, Kyungjin Cho, Eunjin Oh, ISAAC 2021
- Feedback Vertex Set on Geometric Intersection Graphs, Shinwoo An, Eunjin Oh, ISAAC 2021
- Reachability Problems for Transmission Graphs, Shinwoo An, Eunjin Oh, WADS 2021 and Algorithmica 2022
- Shortest-Path Queries in Geometric Networks, Eunjin Oh, ISAAC 2020
- Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams. Eunjin Oh, SODA 2019