Eunjin Oh

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 76

Top Topics

Voronoi Diagram

Top Venues

Publications

Shinwoo An, Eunjin Oh, Jie Xue
Sparse Outerstring Graphs Have Logarithmic Treewidth. CoRR (2024)
Shinwoo An, Eunjin Oh
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. SoCG (2024)
Kyungjin Cho, Jihun Shin, Eunjin Oh
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners. AAAI (2024)
Shinwoo An, Eunjin Oh
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. CoRR (2024)
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
Optimal Algorithm for the Planar Two-Center Problem. SoCG (2024)
Shinwoo An, Kyungjin Cho, Eunjin Oh
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. CoRR (2023)
Kyungjin Cho, Eunjin Oh
-means clustering of axis-parallel affine subspaces. Comput. Geom. 112 (2023)
Kyungjin Cho, Jihun Shin, Eunjin Oh
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners. CoRR (2023)
Eunjin Oh, Seunghyeok Oh
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. CoRR (2023)
Eunjin Oh, Seunghyeok Oh
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. ESA (2023)
Shinwoo An, Kyungjin Cho, Eunjin Oh
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. WADS (2023)
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
. SODA (2023)
Shinwoo An, Eunjin Oh
Reachability Problems for Transmission Graphs. Algorithmica 84 (10) (2022)
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67 (2) (2022)
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
and Linear in n. CoRR (2022)
Shinwoo An, Eunjin Oh
Feedback Vertex Set on Geometric Intersection Graphs. ISAAC (2021)
Shinwoo An, Eunjin Oh
Reachability Problems for Transmission Graphs. CoRR (2021)
Shinwoo An, Eunjin Oh
Reachability Problems for Transmission Graphs. WADS (2021)
Shinwoo An, Eunjin Oh
Feedback Vertex Set on Geometric Intersection Graphs. CoRR (2021)
Kyungjin Cho, Eunjin Oh
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces. CoRR (2021)
Kyungjin Cho, Eunjin Oh
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. ISAAC (2021)
Eunjin Oh
Shortest-Path Queries in Geometric Networks. ISAAC (2020)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
Middle curves based on discrete Fréchet distance. Comput. Geom. 89 (2020)
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
The Maximum-Level Vertex in an Arrangement of Lines. CoRR (2020)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82 (5) (2020)
Kyungjin Cho, Eunjin Oh
Optimal Algorithm for the Planar Two-Center Problem. CoRR (2020)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63 (2) (2020)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
Computing the Center Region and Its Variants. CoRR (2019)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica 81 (7) (2019)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82 (2019)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80 (2019)
Eunjin Oh, Hee-Kap Ahn
Assigning weights to minimize the covering radius in the plane. Comput. Geom. 81 (2019)
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145 (2019)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84 (2019)
Eunjin Oh, Hee-Kap Ahn
Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. 85 (2019)
Eunjin Oh, Hee-Kap Ahn
Polygon Queries for Convex Hulls of Points. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
Computing the center region and its variants. Theor. Comput. Sci. 789 (2019)
Eunjin Oh
Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. SODA (2019)
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM (2018)
Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh
Minimum-Width Square Annulus Intersecting Polygons. WALCOM (2018)
Eunjin Oh, Hee-Kap Ahn
Assigning Weights to Minimize the Covering Radius in the Plane. CoRR (2018)
Eunjin Oh
Point Location in Incremental Planar Subdivisions. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Approximate Range Queries for Clustering. SoCG (2018)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74 (2018)
Eunjin Oh, Hee-Kap Ahn
Point Location in Dynamic Planar Subdivisions. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR (2018)
Eunjin Oh
Minimizing Distance-to-Sight in Polygonal Domains. ISAAC (2018)
Eunjin Oh, Hee-Kap Ahn
Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR (2018)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT (2018)
Eunjin Oh, Hee-Kap Ahn
Polygon Queries for Convex Hulls of Points. COCOON (2018)
Eunjin Oh, Hee-Kap Ahn
Approximate Range Queries for Clustering. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Point Location in Dynamic Planar Subdivisions. SoCG (2018)
Eunjin Oh
Point Location in Incremental Planar Subdivisions. ISAAC (2018)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC (2017)
Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON (2017)
Eunjin Oh, Hee-Kap Ahn
Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC (2017)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR (2017)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG (2017)
Eunjin Oh, Hee-Kap Ahn
Computing the Center Region and Its Variants. WALCOM (2017)
Eunjin Oh, Hee-Kap Ahn
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG (2017)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR (2017)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC (2017)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The Geodesic 2-center Problem in a Simple Polygon. CoRR (2017)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG (2016)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN (2016)
Eunjin Oh, Hee-Kap Ahn
Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC (2016)
Eunjin Oh, Wanbin Son, Hee-Kap Ahn
Constrained Geodesic Centers of a Simple Polygon. SWAT (2016)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
A Middle Curve Based on Discrete Fréchet Distance. LATIN (2016)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56 (4) (2016)
Eunjin Oh, Hee-Kap Ahn
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC (2016)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The 2-Center Problem in a Simple Polygon. ISAAC (2015)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A linear-time algorithm for the geodesic center of a simple polygon. CoRR (2015)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG (2015)