The 2-Center Problem in a Simple Polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (ISAAC, 2015)

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. - Eunjin Oh 001; Luis Barba; Hee-Kap Ahn (SoCG, 2016)

A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. - Eunjin Oh 001; Hee-Kap Ahn (ISAAC, 2016)

A Middle Curve Based on Discrete Fréchet Distance. - Hee-Kap Ahn; Helmut Alt; Maike Buchin; Eunjin Oh 001; Ludmila Scharf; Carola Wenk (LATIN, 2016)

Constrained Geodesic Centers of a Simple Polygon. - Eunjin Oh 001; Wanbin Son; Hee-Kap Ahn (SWAT, 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; Eunjin Oh 001 (Discret. Comput. Geom., 2016)

A Time-Space Trade-Off for Triangulations of Points in the Plane. - Hee-Kap Ahn; Nicola Baraldo; Eunjin Oh 001; Francesco Silvestri 001 (COCOON, 2017)

Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2017)

Polygon Queries for Convex Hulls of Points. - Eunjin Oh 001; Hee-Kap Ahn (COCOON, 2018)

Approximate Range Queries for Clustering. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2018)

Point Location in Dynamic Planar Subdivisions. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2018)

Point Location in Incremental Planar Subdivisions. - Eunjin Oh 001 (ISAAC, 2018)

Minimizing Distance-to-Sight in Polygonal Domains. - Eunjin Oh 001 (ISAAC, 2018)

Minimum-Width Square Annulus Intersecting Polygons. - Hee-Kap Ahn; Taehoon Ahn 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001 (WALCOM, 2018)

The geodesic 2-center problem in a simple polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (Comput. Geom., 2018)

Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. - Eunjin Oh 001 (SODA, 2019)

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. - Eunjin Oh 001; Hee-Kap Ahn (Algorithmica, 2019)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

On Romeo and Juliet problems: Minimizing distance-to-sight. - Hee-Kap Ahn; Eunjin Oh 001; Lena Schlipf; Fabian Stehn; Darren Strash (Comput. Geom., 2019)

Assigning weights to minimize the covering radius in the plane. - Eunjin Oh 001; Hee-Kap Ahn (Comput. Geom., 2019)

Finding pairwise intersections of rectangles in a query rectangle. - Eunjin Oh 001; Hee-Kap Ahn (Comput. Geom., 2019)

Computing a geodesic two-center of points in a simple polygon. - Eunjin Oh 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2019)

Minimum-width annulus with outliers: Circular, square, and rectangular cases. - Hee-Kap Ahn; Taehoon Ahn 001; Sang Won Bae 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001; Chan-Su Shin; Sang Duk Yoon (Inf. Process. Lett., 2019)

Computing the center region and its variants. - Eunjin Oh 001; Hee-Kap Ahn (Theor. Comput. Sci., 2019)

Shortest-Path Queries in Geometric Networks. - Eunjin Oh 001 (ISAAC, 2020)

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. - Eunjin Oh 001; Luis Barba; Hee-Kap Ahn (Algorithmica, 2020)

Middle curves based on discrete Fréchet distance. - Hee-Kap Ahn; Helmut Alt; Maike Buchin; Eunjin Oh 001; Ludmila Scharf; Carola Wenk (Comput. Geom., 2020)

Optimal Algorithm for the Planar Two-Center Problem. - Kyungjin Cho; Eunjin Oh 001 (CoRR, 2020)

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. - Eunjin Oh 001; Hee-Kap Ahn (Discret. Comput. Geom., 2020)

Feedback Vertex Set on Geometric Intersection Graphs. - Shinwoo An; Eunjin Oh 001 (ISAAC, 2021)

Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. - Kyungjin Cho; Eunjin Oh 001 (ISAAC, 2021)

Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces. - Kyungjin Cho; Eunjin Oh 001 (CoRR, 2021)

Reachability Problems for Transmission Graphs. - Shinwoo An; Eunjin Oh 001 (Algorithmica, 2022)

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. - Kyungjin Cho; Eunjin Oh 001; Seunghyeok Oh (CoRR, 2022)

The Maximum-Level Vertex in an Arrangement of Lines. - Dan Halperin; Sariel Har-Peled; Kurt Mehlhorn; Eunjin Oh 001; Micha Sharir (Discret. Comput. Geom., 2022)

Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. - Eunjin Oh 001; Seunghyeok Oh (ESA, 2023)

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. - Kyungjin Cho; Eunjin Oh 001; Seunghyeok Oh (SODA, 2023)

Faster Algorithms for Cycle Hitting Problems on Disk Graphs. - Shinwoo An; Kyungjin Cho; Eunjin Oh 001 (WADS, 2023)

Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners. - Kyungjin Cho; Jihun Shin; Eunjin Oh 001 (CoRR, 2023)

Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces. - Kyungjin Cho; Eunjin Oh 001 (Comput. Geom., 2023)

Approximate Distance Oracle for Fault-Tolerant Geometric Spanners. - Kyungjin Cho; Jihun Shin; Eunjin Oh 001 (AAAI, 2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. - Shinwoo An; Eunjin Oh 001 (SoCG, 2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (ESA, 2024)

Dynamic Parameterized Problems on Unit Disk Graphs. - Shinwoo An; Kyungjin Cho; Leo Jang; Byeonghyeon Jung; Yudam Lee; Eunjin Oh 001; Donghun Shin; Hyeonjun Shin; Chanho Song (ISAAC, 2024)

Mimicking Networks for Constrained Multicuts in Hypergraphs. - Kyungjin Cho; Eunjin Oh 001 (ISAAC, 2024)

Optimal Algorithm for the Planar Two-Center Problem. - Kyungjin Cho; Eunjin Oh 001; Haitao Wang 001; Jie Xue 003 (TheoretiCS, 2024)

Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs. - Shinwoo An; Yeonsu Chang; Kyungjin Cho; O-joung Kwon; Myounghwan Lee; Eunjin Oh 001; Hyeonjun Shin (AAAI, 2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (SoCG, 2025)

Range Counting Oracles for Geometric Problems. - Anne Driemel; Morteza Monemizadeh; Eunjin Oh 001; Frank Staals; David P. Woodruff (SoCG, 2025)

Approximation Algorithms for the Geometric Multimatching Problem. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (STOC, 2025)