DGIST Theoretical Computer Science Seminar (Spring 2026~)
I have broad interests across Theoretical Computer Science. Supported by the Sejong Science Fellowship, I am organizing an invited seminar series at DGIST starting in the Spring 2026 semester (planned for once every 1–2 months). If your research aligns with my interests and you would like to visit DGIST to present your work, please feel free to contact me at parkeun9@dgist.ac.kr.
Schedule:
April 1, 2026 - "Farthest-point Voronoi diagram in the presence of obstacles" by Taehoon Ahn (Sookmyung Women's University)
May 20, 2026 - "Efficient Algorithms for the Two-Line-Center Problem" by Chaeyoon Chung (POSTECH)
June 10, 2026 - "Title(TBA)" by Changyeol Lee (Yonsei University)
July 22, 2026 - "Title(TBA)" by Jaehoon Chung (KIAS)
(Further schedule TBA)
Spring 2026~ : Reading Seminar on "Parameterized Algorithms"
While Parameterized Algorithms is a highly active area of theoretical computer science, very few universities in South Korea offer it as a regular course. In fact, back when I was a student, I wasn't even aware of its existence. Better late than never, I recently connected with graduate students studying Theoretical Computer Science at DGIST, and we decided to organize a reading seminar. For our main textbook, we are using the well-known book, Parameterized Algorithms by Marek Cygan et al. If you are interested in joining the seminar, please feel free to contact me at parkeun9@dgist.ac.kr.
Schedule:
March 5, 2026 - Section 1 (Introduction to Parameterized Algorithms) by Eunku Park
March 12, 2026 - Section 2 (Kernelization) by Eungyu Woo
March 17, 2026 - Section 3 (Bounded search trees) by Doyun Kim
March 26, 2026 - Section 5 (Randomized methods in parameterized algorithms) by Taeyun Rho
April 2, 2026 - Section 4 (Iterative compression) by Eunku Park
April 7, 2026 - Section 4 (Iterative compression) by Eunku Park
April 23, 2026 - Section 6 (Miscellaneous) by Eungyu Woo
April 30, 2026 - Section 7 (Treewidth) by Taeyun Rho
May 7, 2026 - Section 7 (Treewidth) by Doyun Kim
May 12, 2026 - Section 7 (Treewidth) by Doyun Kim
May 19, 2026 - Section 8 (Finding cuts and separators) by Eunku Park
May 28, 2026 - Section 8 (Finding cuts and separators) by Eunku Park
June 18, 2026 - TBA
(Further schedule TBA)
Spring 2026~ : Reading Seminar on "Algorithms in Real Algebraic Geometry"
To make meaningful breakthroughs in theoretical computational geometry, a rigorous foundation in Real Algebraic Geometry is incredibly helpful. Algebraic techniques offer powerful ways to rigorously analyze spatial configurations and bounded regions in algorithm design. Thankfully, I was given the great opportunity to run an ongoing reading seminar with the members of the DGIST BRL AGSTA to dive deeply into these algorithmic implications. Because there is so much rich material to cover at the intersection of these two fields, we expect this to be a long-term seminar. It is an exciting chance to build a solid theoretical bridge together. For our main textbook, we are using the definitive guide, Algorithms in Real Algebraic Geometry by Saugata Basu, Richard Pollack, and Marie-Françoise Roy. If you are interested in joining the seminar, please feel free to contact me at parkeun9@dgist.ac.kr.
Schedule:
March 30, 2026 - Chapter 1 (Algebraically Closed Fields) by Maciej Gałazka
April 8, 2026 - Chapter 1 (Algebraically Closed Fields) by Maciej Gałazka
May 4, 2026 - Chapter 2 (Real Closed Fields) by Eunku Park
May 11, 2026 - Chapter 2 (Real Closed Fields) by Eunku Park
(Further schedule TBA)