Seungjun Lee

Ph.d student

About Me

Hi, my name’s Seungjun and I’m a Ph.D student majoring in computer science (Algorithm).


M.S. & Ph.D. Computer Science and engineering, POSTECH, 2018 - CURRENT
B.S. Mathematics, POSTECH, 2013 - 2017

Research interests

Algorithms and Data structures / Computational Geometry / Optimization / Stochastic


Korean / English / Japanese / Russian (simple conversation)

Technical skills

C/C++ Python3 Java OCaml Swift Linux HTML5 MySQL Git/Github



Taekang Eom, Seungjun Lee, Hee-Kap Ahn. Largest similar copies of convex polygons amidst polygonal obstacles. Submitted.

Seungjun Lee, Taekang Eom, Hee-Kap Ahn. Largest triangles in a polygon. Computational Geometry, 98, 101792, 2021.

Yujin Choi, Seungjun Lee, Hee-Kap Ahn. Maximum-Area and Maximum-Perimeter Rectangles in Polygons. Computational Geometry, 94, 101710, 2021.


PCB Design Automation

Samsung Electonics, 2019 - 2022

In the existing PCB design, the designer has to do the wiring work manually, and at this time, time and cost are consumed because the design takes into consideration the interference and delay of components and wires. Therefore, in order to avoid spending a lot of time and money on wiring work in PCB design, we developed a PCB design wiring automation technology through an algorithm to reduce the time and cost required for design, increase efficiency, and at the same time satisfy all necessary conditions through the integrity of the algorithm. It aims to ensure the stability of calculating wiring within the target deadline. In this project, the focus is mainly on the design of algorithms and the development of S/W that automates the wiring between CPU-Memory. In order to achieve the objectives mentioned above, algorithm design and S/W development that automates wiring work according to given conditions in PCB design are carried out.

Optimal Data Structure and Algorithmic Applications in Dynamic Geometric Environment

SW StarLab, Institute of Information & Communications Technology Planning & Evaluation (IITP), 2018 - 2022

This project aims to design optimal algorithms that handles data such as objects existing in space. Among them, we are conducting research on designing the optimal geometric algorithm that calculates the shortest path and geometric data structure in a fast time in an environment where objects and data in space dynamically change. Github / Homepage


Academic Experience

Official Reviewr of Journals
Soft Computing (SOCO) - 2023
Computational Geometry: Theory and Applications (CGTA) - 2021
Korean Institute of Information Scientists and Engineers (Journal of KIISE) - 2020, 2021

Official Reviewr of Conferences
Korean Computer Congress (KCC) - 2023
International Symposium on Algorithms and Computation (ISAAC) - 2021
European Workshop on Computational Geometry (EuroCG) - 2020, 2021
Symposium on Computational Geometry (SoCG) - 2020

Educational Experience

Teaching Assistant of AI Education Programs for Business
Youth AI Big Data Academy - 2022, 2023
POSCO AI Expert - 2019, 2021, 2022
SK Hynix Machine Learning Champion - 2018, 2019, 2020

Teaching Assistant of Classes
CSED331 Algorithms - 2019, 2020, 2021, 2022

Other Experiences
Vice President of POSTECH Student Council - 2017
Preparatory Committee of POSTECH Festival - 2016
Preparatory Committee of Freshmen Orientation - 2016
Preparatory Committee of POSTECH-KAIST Science War - 2015, 2017
Student Representative of the Department of Mathematics - 2014
POSTECH Club - Impact(Racquetball), Clear(Badminton)

A Little More About Me

Some of my other interests and hobbies are:

  • Table tennis
  • Badminton
  • Cycling
  • Camping
  • Coocking
  • Drinking (Cocktail)