default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEunjin Oh 0001
Person information
- affiliation: POSTECH, Pohang, Korea
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Eunjin Oh 0002 — Ewha Womans University, Seoul, Republic of Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Kyungjin Cho, Jihun Shin, Eunjin Oh:
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners. AAAI 2024: 20087-20095- [c34]Shinwoo An, Eunjin Oh:
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. SoCG 2024: 7:1-7:15 - [c33]Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue:
Optimal Algorithm for the Planar Two-Center Problem. SoCG 2024: 40:1-40:15 - [c32]Shinwoo An, Eunjin Oh, Jie Xue:
Sparse Outerstring Graphs Have Logarithmic Treewidth. ESA 2024: 10:1-10:18 - [i29]Shinwoo An, Eunjin Oh:
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. CoRR abs/2403.11426 (2024) - [i28]Shinwoo An, Eunjin Oh, Jie Xue:
Sparse Outerstring Graphs Have Logarithmic Treewidth. CoRR abs/2406.17424 (2024) - [i27]Shinwoo An, Yeonsu Chang, Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Eunjin Oh, Hyeonjun Shin:
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs. CoRR abs/2408.09591 (2024) - [i26]Kyungjin Cho, Eunjin Oh:
Mimicking Networks for Constrained Multicuts in Hypergraphs. CoRR abs/2409.12548 (2024) - [i25]Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song:
Dynamic parameterized problems on unit disk graphs. CoRR abs/2409.13403 (2024) - 2023
- [j16]Kyungjin Cho, Eunjin Oh:
Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces. Comput. Geom. 112: 101981 (2023) - [c31]Eunjin Oh, Seunghyeok Oh:
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. ESA 2023: 85:1-85:15 - [c30]Kyungjin Cho, Eunjin Oh, Seunghyeok Oh:
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. SODA 2023: 3734-3758 - [c29]Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. WADS 2023: 29-42 - [i24]Eunjin Oh, Seunghyeok Oh:
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. CoRR abs/2306.16775 (2023) - [i23]Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. CoRR abs/2311.03665 (2023) - [i22]Kyungjin Cho, Jihun Shin, Eunjin Oh:
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners. CoRR abs/2312.16397 (2023) - 2022
- [j15]Shinwoo An, Eunjin Oh
:
Reachability Problems for Transmission Graphs. Algorithmica 84(10): 2820-2841 (2022) - [j14]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): 439-461 (2022) - [i21]Kyungjin Cho, Eunjin Oh, Seunghyeok Oh:
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n. CoRR abs/2211.03341 (2022) - 2021
- [c28]Kyungjin Cho, Eunjin Oh:
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. ISAAC 2021: 46:1-46:13 - [c27]Shinwoo An, Eunjin Oh:
Feedback Vertex Set on Geometric Intersection Graphs. ISAAC 2021: 47:1-47:12 - [c26]Shinwoo An, Eunjin Oh:
Reachability Problems for Transmission Graphs. WADS 2021: 71-84 - [i20]Shinwoo An, Eunjin Oh:
Reachability Problems for Transmission Graphs. CoRR abs/2106.04973 (2021) - [i19]Kyungjin Cho, Eunjin Oh:
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces. CoRR abs/2106.14176 (2021) - [i18]Shinwoo An, Eunjin Oh:
Feedback Vertex Set on Geometric Intersection Graphs. CoRR abs/2107.03861 (2021) - 2020
- [j13]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82(5): 1434-1473 (2020) - [j12]Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
Middle curves based on discrete Fréchet distance. Comput. Geom. 89: 101621 (2020) - [j11]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63(2): 418-454 (2020) - [c25]Eunjin Oh:
Shortest-Path Queries in Geometric Networks. ISAAC 2020: 52:1-52:15 - [i17]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i16]Kyungjin Cho, Eunjin Oh:
Optimal Algorithm for the Planar Two-Center Problem. CoRR abs/2007.08784 (2020)
2010 – 2019
- 2019
- [j10]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica 81(7): 2829-2856 (2019) - [j9]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: 23-39 (2019) - [j8]Eunjin Oh, Hee-Kap Ahn:
Assigning weights to minimize the covering radius in the plane. Comput. Geom. 81: 22-32 (2019) - [j7]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82: 45-59 (2019) - [j6]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j5]Eunjin Oh, Hee-Kap Ahn:
Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. 85 (2019) - [j4]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: 16-23 (2019) - [j3]Eunjin Oh, Hee-Kap Ahn:
Computing the center region and its variants. Theor. Comput. Sci. 789: 2-12 (2019) - [c24]Eunjin Oh:
Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. SODA 2019: 391-409 - [i15]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - [i14]Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. CoRR abs/1910.08717 (2019) - [i13]Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. CoRR abs/1910.12169 (2019) - [i12]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR abs/1910.12177 (2019) - 2018
- [j2]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74: 21-37 (2018) - [c23]Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. COCOON 2018: 143-155 - [c22]Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. SoCG 2018: 62:1-62:14 - [c21]Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. SoCG 2018: 63:1-63:14 - [c20]Eunjin Oh:
Point Location in Incremental Planar Subdivisions. ISAAC 2018: 51:1-51:12 - [c19]Eunjin Oh:
Minimizing Distance-to-Sight in Polygonal Domains. ISAAC 2018: 59:1-59:12 - [c18]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - [c17]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: 44-55 - [c16]Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. WALCOM 2018: 56-67 - [i11]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR abs/1801.02292 (2018) - [i10]Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR abs/1801.07362 (2018) - [i9]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR abs/1802.06223 (2018) - [i8]Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. CoRR abs/1803.03978 (2018) - [i7]Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. CoRR abs/1803.04325 (2018) - [i6]Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. CoRR abs/1804.00241 (2018) - [i5]Eunjin Oh:
Point Location in Incremental Planar Subdivisions. CoRR abs/1809.10495 (2018) - 2017
- [c15]Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri:
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON 2017: 3-12 - [c14]Eunjin Oh, Hee-Kap Ahn:
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG 2017: 51:1-51:15 - [c13]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG 2017: 52:1-52:15 - [c12]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: 3:1-3:13 - [c11]Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC 2017: 60:1-60:12 - [c10]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC 2017: 61:1-61:12 - [c9]Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. WALCOM 2017: 254-265 - [i4]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 abs/1704.07580 (2017) - [i3]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR abs/1709.09932 (2017) - [i2]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The Geodesic 2-center Problem in a Simple Polygon. CoRR abs/1710.09035 (2017) - 2016
- [j1]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): 836-859 (2016) - [c8]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG 2016: 56:1-56:15 - [c7]Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC 2016: 58:1-58:12 - [c6]Eunjin Oh, Hee-Kap Ahn:
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC 2016: 59:1-59:12 - [c5]Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
A Middle Curve Based on Discrete Fréchet Distance. LATIN 2016: 14-26 - [c4]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN 2016: 646-658 - [c3]Eunjin Oh, Wanbin Son, Hee-Kap Ahn:
Constrained Geodesic Centers of a Simple Polygon. SWAT 2016: 29:1-29:13 - 2015
- [c2]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: 209-223 - [c1]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The 2-Center Problem in a Simple Polygon. ISAAC 2015: 307-317 - [i1]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 abs/1501.00561 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
