| 2026 | ESA | DAG Covers for Structured Graphs: The Steiner Point Effect. | Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, Da Wei Zheng |
| 2026 | ESA | Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces. | Eunjin Oh, Hyeonjun Shin |
| 2026 | ICALP | Visibility Queries in Simple Polygons. | Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla, Yakov Nekrich, Eunjin Oh, Andr van Renssen, Frank Staals, Haitao Wang, Jie Xue |
| 2026 | ICALP | Touring a Sequence of Orthogonal Polygons. | Katrin Casel, Sndor Kisfaludi-Bak, Linda Kleist, Jeroen S. K. Lamme, Eunjin Oh, Yanheng Wang |
| 2025 | AAAI | 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 |
| 2025 | STOC | Approximation Algorithms for the Geometric Multimatching Problem. | Shinwoo An, Eunjin Oh, Jie Xue |
| 2024 | AAAI | Approximate Distance Oracle for Fault-Tolerant Geometric Spanners. | Kyungjin Cho, Jihun Shin, Eunjin Oh |
| 2024 | ESA | Sparse Outerstring Graphs Have Logarithmic Treewidth. | Shinwoo An, Eunjin Oh, Jie Xue |
| 2024 | ISAAC | 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 |
| 2024 | ISAAC | Mimicking Networks for Constrained Multicuts in Hypergraphs. | Kyungjin Cho, Eunjin Oh |
| 2023 | ESA | Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. | Eunjin Oh, Seunghyeok Oh |
| 2023 | SODA | Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in | Kyungjin Cho, Eunjin Oh, Seunghyeok Oh |
| 2023 | WADS | Faster Algorithms for Cycle Hitting Problems on Disk Graphs. | Shinwoo An, Kyungjin Cho, Eunjin Oh |
| 2021 | ISAAC | Feedback Vertex Set on Geometric Intersection Graphs. | Shinwoo An, Eunjin Oh |
| 2021 | ISAAC | Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. | Kyungjin Cho, Eunjin Oh |
| 2021 | WADS | Reachability Problems for Transmission Graphs. | Shinwoo An, Eunjin Oh |
| 2020 | ISAAC | Shortest-Path Queries in Geometric Networks. | Eunjin Oh |
| 2019 | SODA | Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. | Eunjin Oh |
| 2018 | COCOON | Polygon Queries for Convex Hulls of Points. | Eunjin Oh, Hee-Kap Ahn |
| 2018 | ISAAC | Point Location in Incremental Planar Subdivisions. | Eunjin Oh |
| 2018 | ISAAC | Minimizing Distance-to-Sight in Polygonal Domains. | Eunjin Oh |
| 2018 | WALCOM | 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 |
| 2018 | WALCOM | Minimum-Width Square Annulus Intersecting Polygons. | Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh |
| 2017 | COCOON | A Time-Space Trade-Off for Triangulations of Points in the Plane. | Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri |
| 2017 | ISAAC | Finding Pairwise Intersections of Rectangles in a Query Rectangle. | Eunjin Oh, Hee-Kap Ahn |
| 2017 | ISAAC | A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. | Eunjin Oh, Hee-Kap Ahn |
| 2017 | ISAAC | 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 |
| 2017 | WALCOM | Computing the Center Region and Its Variants. | Eunjin Oh, Hee-Kap Ahn |
| 2016 | ISAAC | Assigning Weights to Minimize the Covering Radius in the Plane. | Eunjin Oh, Hee-Kap Ahn |
| 2016 | ISAAC | A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. | Eunjin Oh, Hee-Kap Ahn |
| 2016 | LATIN | A Middle Curve Based on Discrete Frchet Distance. | Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk |
| 2016 | LATIN | Computing a Geodesic Two-Center of Points in a Simple Polygon. | Eunjin Oh, Sang Won Bae, Hee-Kap Ahn |
| 2015 | ISAAC | The 2-Center Problem in a Simple Polygon. | Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn |