Eunjin Oh

According to our database, Eunjin Oh authored at least 50 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Approximation Algorithms for the Geometric Multimatching Problem.

Shinwoo An, Eunjin Oh, Jie Xue

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Range Counting Oracles for Geometric Problems.

Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Single-Source Shortest Path Problem in Weighted Disk Graphs.

Shinwoo An, Eunjin Oh, Jie Xue

Proceedings of the 41st International Symposium on Computational Geometry, 2025

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, Hyeonjun Shin

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Mimicking Networks for Constrained Multicuts in Hypergraphs.

Kyungjin Cho, Eunjin Oh

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Dynamic Parameterized Problems on Unit Disk Graphs.

Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Sparse Outerstring Graphs Have Logarithmic Treewidth.

Shinwoo An, Eunjin Oh, Jie Xue

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Optimal Algorithm for the Planar Two-Center Problem.

Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue

Proceedings of the 40th International Symposium on Computational Geometry, 2024

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs.

Shinwoo An, Eunjin Oh

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Approximate Distance Oracle for Fault-Tolerant Geometric Spanners.

Kyungjin Cho, Jihun Shin, Eunjin Oh

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Linear-time approximation scheme for <i>k</i>-means clustering of axis-parallel affine subspaces.

Kyungjin Cho, Eunjin Oh

Comput. Geom., June, 2023

Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners.

Kyungjin Cho, Jihun Shin, Eunjin Oh

CoRR, 2023

Faster Algorithms for Cycle Hitting Problems on Disk Graphs.

Shinwoo An, Kyungjin Cho, Eunjin Oh

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in <i>k</i>² and Linear in <i>n</i>.

Kyungjin Cho, Eunjin Oh, Seunghyeok Oh

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs.

Eunjin Oh, Seunghyeok Oh

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

The Maximum-Level Vertex in an Arrangement of Lines.

Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir

Discret. Comput. Geom., 2022

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k² and Linear in n.

Kyungjin Cho, Eunjin Oh, Seunghyeok Oh

CoRR, 2022

2021

Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces.

Kyungjin Cho, Eunjin Oh

CoRR, 2021

Reachability Problems for Transmission Graphs.

Shinwoo An, Eunjin Oh

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces.

Kyungjin Cho, Eunjin Oh

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Feedback Vertex Set on Geometric Intersection Graphs.

Shinwoo An, Eunjin Oh

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Optimal Algorithm for the Planar Two-Center Problem.

Kyungjin Cho, Eunjin Oh

CoRR, 2020

Middle curves based on discrete Fréchet distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Comput. Geom., 2020

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon.

Eunjin Oh, Luis Barba, Hee-Kap Ahn

Algorithmica, 2020

Shortest-Path Queries in Geometric Networks.

Eunjin Oh

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons.

Eunjin Oh

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

The geodesic 2-center problem in a simple polygon.

Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

Comput. Geom., 2018

Minimum-Width Square Annulus Intersecting Polygons.

Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.

Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Romeo and Juliet Problems: Minimizing Distance-to-Sight.

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Minimizing Distance-to-Sight in Polygonal Domains.

Eunjin Oh

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Point Location in Incremental Planar Subdivisions.

Eunjin Oh

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Point Location in Dynamic Planar Subdivisions.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Approximate Range Queries for Clustering.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Polygon Queries for Convex Hulls of Points.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Computing the Center Region and Its Variants.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the WALCOM: Algorithms and Computation, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.

Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Finding Pairwise Intersections of Rectangles in a Query Rectangle.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Time-Space Trade-Off for Triangulations of Points in the Plane.

Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Constrained Geodesic Centers of a Simple Polygon.

Eunjin Oh, Wanbin Son, Hee-Kap Ahn

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Computing a Geodesic Two-Center of Points in a Simple Polygon.

Eunjin Oh, Sang Won Bae, Hee-Kap Ahn

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Middle Curve Based on Discrete Fréchet Distance.

Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Assigning Weights to Minimize the Covering Radius in the Plane.

Eunjin Oh, Hee-Kap Ahn

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon.

Eunjin Oh, Luis Barba, Hee-Kap Ahn

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

The 2-Center Problem in a Simple Polygon.

Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

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

Proceedings of the 31st International Symposium on Computational Geometry, 2015