| A linear-time algorithm for the geodesic center of a simple polygon HK Ahn, L Barba, P Bose, JL De Carufel, M Korman, E Oh Discrete & Computational Geometry 56, 836-859, 2016 | 44 | 2016 |
| Voronoi diagrams for a moderate-sized point-set in a simple polygon E Oh, HK Ahn Discrete & Computational Geometry 63 (2), 418-454, 2020 | 26 | 2020 |
| Middle curves based on discrete Fréchet distance HK Ahn, H Alt, M Buchin, E Oh, L Scharf, C Wenk Computational Geometry 89, 101621, 2020 | 19* | 2020 |
| A near-optimal algorithm for finding an optimal shortcut of a tree E Oh, HK Ahn 27th International Symposium on Algorithms and Computation (ISAAC 2016), 59 …, 2016 | 14 | 2016 |
| Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons E Oh Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 13 | 2019 |
| Optimal algorithm for the planar two-center problem K Cho, E Oh, H Wang, J Xue TheoretiCS 3, 2024 | 12 | 2024 |
| Computing a geodesic two-center of points in a simple polygon E Oh, SW Bae, HK Ahn Computational Geometry 82, 45-59, 2019 | 12 | 2019 |
| The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon E Oh, L Barba, HK Ahn 32nd International Symposium on Computational Geometry: SoCG'16, June 14-17 …, 2016 | 12 | 2016 |
| The geodesic 2-center problem in a simple polygon E Oh, JL De Carufel, HK Ahn Computational Geometry 74, 21-37, 2018 | 9 | 2018 |
| A time-space trade-off for triangulations of points in the plane HK Ahn, N Baraldo, E Oh, F Silvestri Computing and Combinatorics: 23rd International Conference, COCOON 2017 …, 2017 | 8 | 2017 |
| Feedback vertex set on geometric intersection graphs S An, E Oh arXiv preprint arXiv:2107.03861, 2021 | 7 | 2021 |
| The geodesic farthest-point Voronoi diagram in a simple polygon E Oh, L Barba, HK Ahn Algorithmica 82 (5), 1434-1473, 2020 | 7 | 2020 |
| Faster algorithms for growing prioritized disks and rectangles HK Ahn, SW Bae, J Choi, M Korman, W Mulzer, E Oh, J Park, ... Computational Geometry 80, 23-39, 2019 | 7 | 2019 |
| Sparse outerstring graphs have logarithmic treewidth S An, E Oh, J Xue arXiv preprint arXiv:2406.17424, 2024 | 5 | 2024 |
| Faster algorithms for cycle hitting problems on disk graphs S An, K Cho, E Oh Algorithms and Data Structures Symposium, 29-42, 2023 | 5 | 2023 |
| Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n K Cho, E Oh, S Oh Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 5 | 2023 |
| Finding pairwise intersections of rectangles in a query rectangle E Oh, HK Ahn Computational Geometry 85, 101576, 2019 | 5 | 2019 |
| Point location in dynamic planar subdivisions E Oh, HK Ahn arXiv preprint arXiv:1803.04325, 2018 | 5 | 2018 |
| Approximate range queries for clustering E Oh, HK Ahn arXiv preprint arXiv:1803.03978, 2018 | 5 | 2018 |
| A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms E Oh, HK Ahn Algorithmica 81, 2829-2856, 2019 | 4 | 2019 |
