Eunjin Oh

91 papers A* 15A 2B 21Misc 2Journal 49Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B ed.
19th International Symposium on Algorithms and Data Structures, WADS 2025, York University, Toronto, Canada, August 11-15, 2025
WADS
Pat Morin, Eunjin Oh
2025 A* conf
Approximation Algorithms for the Geometric Multimatching Problem.
STOC
Shinwoo An, Eunjin Oh, Jie Xue
2025 J jnl
Computational Geometry (Dagstuhl Seminar 25201).
Dagstuhl Reports
Maarten Löffler, Eunjin Oh, Jeff M. Phillips, Alexandra Weinberger
2025 A* conf
Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs.
AAAI
Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin
2025 A* conf
Range Counting Oracles for Geometric Problems.
SoCG
Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff
2025 J jnl
Range Counting Oracles for Geometric Problems.
CoRR
Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, David P. Woodruff
2025 A* conf
Single-Source Shortest Path Problem in Weighted Disk Graphs.
SoCG
Shinwoo An, Eunjin Oh, Jie Xue
2025 J jnl
Single-Source Shortest Path Problem in Weighted Disk Graphs.
CoRR
Shinwoo An, Eunjin Oh, Jie Xue
2024 A* conf
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners.
AAAI
Kyungjin Cho, Jihun Shin, Eunjin Oh
2024 B conf
Dynamic Parameterized Problems on Unit Disk Graphs.
ISAAC
Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song
2024 J jnl
Dynamic parameterized problems on unit disk graphs.
CoRR
Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song
2024 A* conf
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs.
SoCG
Shinwoo An, Eunjin Oh
2024 J jnl
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs.
CoRR
Shinwoo An, Eunjin Oh
2024 B conf
Mimicking Networks for Constrained Multicuts in Hypergraphs.
ISAAC
Kyungjin Cho, Eunjin Oh
2024 J jnl
Mimicking Networks for Constrained Multicuts in Hypergraphs.
CoRR
Kyungjin Cho, Eunjin Oh
2024 A* conf
Optimal Algorithm for the Planar Two-Center Problem.
SoCG
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024 J jnl
Optimal Algorithm for the Planar Two-Center Problem.
TheoretiCS
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024 J jnl
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs.
CoRR
Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin
2024 A conf
Sparse Outerstring Graphs Have Logarithmic Treewidth.
ESA
Shinwoo An, Eunjin Oh, Jie Xue
2024 J jnl
Sparse Outerstring Graphs Have Logarithmic Treewidth.
CoRR
Shinwoo An, Eunjin Oh, Jie Xue
2023 A conf
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs.
ESA
Eunjin Oh, Seunghyeok Oh
2023 J jnl
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs.
CoRR
Eunjin Oh, Seunghyeok Oh
2023 J jnl
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners.
CoRR
Kyungjin Cho, Jihun Shin, Eunjin Oh
2023 B conf
Faster Algorithms for Cycle Hitting Problems on Disk Graphs.
WADS
Shinwoo An, Kyungjin Cho, Eunjin Oh
2023 J jnl
Faster Algorithms for Cycle Hitting Problems on Disk Graphs.
CoRR
Shinwoo An, Kyungjin Cho, Eunjin Oh
2023 J jnl
Linear-time approximation scheme for
Comput. Geom.
Kyungjin Cho, Eunjin Oh
2023 A* conf
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in
SODA
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
2022 J jnl
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k
CoRR
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
2022 J jnl
Reachability Problems for Transmission Graphs.
Algorithmica
Shinwoo An, Eunjin Oh
2022 J jnl
The Maximum-Level Vertex in an Arrangement of Lines.
Discret. Comput. Geom.
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2021 B conf
Feedback Vertex Set on Geometric Intersection Graphs.
ISAAC
Shinwoo An, Eunjin Oh
2021 J jnl
Feedback Vertex Set on Geometric Intersection Graphs.
CoRR
Shinwoo An, Eunjin Oh
2021 J jnl
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces.
CoRR
Kyungjin Cho, Eunjin Oh
2021 B conf
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces.
ISAAC
Kyungjin Cho, Eunjin Oh
2021 B conf
Reachability Problems for Transmission Graphs.
WADS
Shinwoo An, Eunjin Oh
2021 J jnl
Reachability Problems for Transmission Graphs.
CoRR
Shinwoo An, Eunjin Oh
2020 J jnl
Middle curves based on discrete Fréchet distance.
Comput. Geom.
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2020 J jnl
Optimal Algorithm for the Planar Two-Center Problem.
CoRR
Kyungjin Cho, Eunjin Oh
2020 B conf
Shortest-Path Queries in Geometric Networks.
ISAAC
Eunjin Oh
2020 J jnl
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon.
Algorithmica
Eunjin Oh, Luis Barba, Hee-Kap Ahn
2020 J jnl
The Maximum-Level Vertex in an Arrangement of Lines.
CoRR
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2020 J jnl
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
Discret. Comput. Geom.
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms.
Algorithmica
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
Assigning weights to minimize the covering radius in the plane.
Comput. Geom.
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
Computing a Geodesic Two-Center of Points in a Simple Polygon.
CoRR
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2019 J jnl
Computing a geodesic two-center of points in a simple polygon.
Comput. Geom.
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2019 J jnl
Computing the Center Region and Its Variants.
CoRR
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
Computing the center region and its variants.
Theor. Comput. Sci.
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
Faster algorithms for growing prioritized disks and rectangles.
Comput. Geom.
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2019 J jnl
Finding pairwise intersections of rectangles in a query rectangle.
Comput. Geom.
Eunjin Oh, Hee-Kap Ahn
2019 J jnl
Minimum-width annulus with outliers: Circular, square, and rectangular cases.
Inf. Process. Lett.
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2019 J jnl
On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
CoRR
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019 J jnl
On Romeo and Juliet problems: Minimizing distance-to-sight.
Comput. Geom.
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019 A* conf
Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons.
SODA
Eunjin Oh
2019 J jnl
Polygon Queries for Convex Hulls of Points.
CoRR
Eunjin Oh, Hee-Kap Ahn
2018 A* conf
Approximate Range Queries for Clustering.
SoCG
Eunjin Oh, Hee-Kap Ahn
2018 J jnl
Approximate Range Queries for Clustering.
CoRR
Eunjin Oh, Hee-Kap Ahn
2018 J jnl
Assigning Weights to Minimize the Covering Radius in the Plane.
CoRR
Eunjin Oh, Hee-Kap Ahn
2018 J jnl
Finding Pairwise Intersections of Rectangles in a Query Rectangle.
CoRR
Eunjin Oh, Hee-Kap Ahn
2018 B conf
Minimizing Distance-to-Sight in Polygonal Domains.
ISAAC
Eunjin Oh
2018 B conf
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.
WALCOM
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2018 B conf
Minimum-Width Square Annulus Intersecting Polygons.
WALCOM
Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh
2018 — conf
On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
SWAT
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2018 A* conf
Point Location in Dynamic Planar Subdivisions.
SoCG
Eunjin Oh, Hee-Kap Ahn
2018 J jnl
Point Location in Dynamic Planar Subdivisions.
CoRR
Eunjin Oh, Hee-Kap Ahn
2018 B conf
Point Location in Incremental Planar Subdivisions.
ISAAC
Eunjin Oh
2018 J jnl
Point Location in Incremental Planar Subdivisions.
CoRR
Eunjin Oh
2018 Misc conf
Polygon Queries for Convex Hulls of Points.
COCOON
Eunjin Oh, Hee-Kap Ahn
2018 J jnl
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon.
CoRR
Eunjin Oh, Luis Barba, Hee-Kap Ahn
2018 J jnl
The geodesic 2-center problem in a simple polygon.
Comput. Geom.
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2018 J jnl
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
CoRR
Eunjin Oh, Hee-Kap Ahn
2017 B conf
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.
ISAAC
Eunjin Oh, Hee-Kap Ahn
2017 J jnl
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.
CoRR
Eunjin Oh, Hee-Kap Ahn
2017 Misc conf
A Time-Space Trade-Off for Triangulations of Points in the Plane.
COCOON
Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
2017 B conf
Computing the Center Region and Its Variants.
WALCOM
Eunjin Oh, Hee-Kap Ahn
2017 A* conf
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons.
SoCG
Eunjin Oh, Hee-Kap Ahn
2017 B conf
Faster Algorithms for Growing Prioritized Disks and Rectangles.
ISAAC
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017 J jnl
Faster Algorithms for Growing Prioritized Disks and Rectangles.
CoRR
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017 B conf
Finding Pairwise Intersections of Rectangles in a Query Rectangle.
ISAAC
Eunjin Oh, Hee-Kap Ahn
2017 J jnl
The Geodesic 2-center Problem in a Simple Polygon.
CoRR
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2017 A* conf
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
SoCG
Eunjin Oh, Hee-Kap Ahn
2016 J jnl
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
Discret. Comput. Geom.
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2016 B conf
A Middle Curve Based on Discrete Fréchet Distance.
LATIN
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2016 B conf
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
ISAAC
Eunjin Oh, Hee-Kap Ahn
2016 B conf
Assigning Weights to Minimize the Covering Radius in the Plane.
ISAAC
Eunjin Oh, Hee-Kap Ahn
2016 B conf
Computing a Geodesic Two-Center of Points in a Simple Polygon.
LATIN
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2016 — conf
Constrained Geodesic Centers of a Simple Polygon.
SWAT
Eunjin Oh, Wanbin Son, Hee-Kap Ahn
2016 A* conf
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon.
SoCG
Eunjin Oh, Luis Barba, Hee-Kap Ahn
2015 A* conf
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
SoCG
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2015 J jnl
A linear-time algorithm for the geodesic center of a simple polygon.
CoRR
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2015 B conf
The 2-Center Problem in a Simple Polygon.
ISAAC
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn