Profile

Eunjin Oh 사진
Profile.
Name Eunjin Oh
Organization Dept of Computer Science & Enginrg
Telephone 054-279-2389
E-mail jin9082@postech.ac.kr
Homepage https://sites.google.com/view/eunjinoh/

Education

  • 2013.03 ~ 2018.02 POSTECH (통합-컴퓨터공학)
  • 2008.03 ~ 2013.02 POSTECH (학사-전자전기공학)

Career

  • 2018.03 ~ 2019.05 : MAX-PLANCK-INS. FOR INFORMATICS

Profession

Journal Papers

International

  • The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon, ALGORITHMICA, , 82, 1434-1473 (2020)
  • A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms, ALGORITHMICA, , 81, 2829-2856 (2019)
  • Faster algorithms for growing prioritized disks and rectangles, Computational Geometry: Theory and Applications, , 80, 23-39 (2019)
  • Assigning weights to minimize the covering radius in the plane, Computational Geometry: Theory and Applications, , 81, 22-32 (2019)
  • Computing a geodesic two-center of points in a simple polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 82, 45-59 (2019)
  • On Romeo and Juliet problems: Minimizing distance-to-sight, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 84, 12-21 (2019)
  • Minimum-width annulus with outliers: Circular, square, and rectangular cases, INFORMATION PROCESSING LETTERS, , 145, 16-23 (2019)
  • The geodesic 2-center problem in a simple polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 74, 21-37 (2018)
  • A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon, DISCRETE & COMPUTATIONAL GEOMETRY, , 56, 836-859 (2016)

Domestic Journal Papers

General Journal Papers

Conference Proceedings

Invited Talk or Presentations

  • Point Location in Dynamic Planar Subdivisions., Proceedings of 34th International Symposium on Computational Geometry, 0, 0, - (2018)

Books

Research Activities

  • 오은진_신규부임교수 기자재지원(1차_대학), 포항공과대학교 (2019-2020)
  • 오은진_신규부임교수 연구비지원(1차_대학), 포항공과대학교 (2019-2020)
  • 오은진_신규부임교수 연구비지원(1차_학과), 포항공과대학교 (2019-2020)
  • 오은진_신규부임교수 기자재지원(1차_대학), 포항공과대학교 (2019-2020)
  • FAULT TOLERANT DATA STRUCTURE FOR SHORTEST PATHS IN GEOMETRIC GRAPHS, 재단법인한국연구재단 (2020-2021)
  • 오은진_신규부임교수 기자재지원(2차_대학), 포항공과대학교 (2020-2021)
  • 오은진_신규부임교수 연구비지원(2차_대학), 포항공과대학교 (2020-2021)
  • 오은진 신규부임교수 연구비지원(2차_학과), 포항공과대학교 (2020-2021)
  • 오은진 신규부임교수 연구비지원(3차_대학), 포항공과대학교 (2021-2022)
  • FAULT TOLERANT DATA STRUCTURE FOR SHORTEST PATHS IN GEOMETRIC GRAPHS, 재단법인한국연구재단 (2021-2022)
  • 오은진 신규부임교수 초기정착비(3차_학과), 포항공과대학교 (2021-2022)
  • 4.0019504_이월과제, 재단법인한국연구재단 (2021-2022)
  • FAULT TOLERANT DATA STRUCTURE FOR SHORTEST PATHS IN GEOMETRIC GRAPHS, 재단법인한국연구재단 (2022-2023)
  • 4.0021590/4.0022423_이월과제, 재단법인한국연구재단 (2022-2023)
  • ANALYSIS OF GEOMETRIC RANDOM GRAPHS, 재단법인한국연구재단 (2023-2024)

IP