Chair : Hyojeong An |
||||
| Date | Time | Location | Title | Speaker |
| 2025/09/01 | 15:30~16:00 | B2-101 | Fast computation of shortest watchman routes in simple polygons | Jeongwon Moon |
| 2025/09/08 | 15:30~16:00 | B2-101 | Geometric objects covering all red points and minimum blue points | Jaegun Lee |
| 2025/09/15 | 15:30~16:00 | B2-101 | Shadoks Approach to Knapsack Polygonal Packing | Jueun Seo |
| 2025/09/22 | 15:30~16:00 | B2-101 | Farthest-polygon Voronoi diagram | Minju Song |
| 2025/09/29 | 15:30~16:00 | B2-101 | A scheme for computing minimum covers within simple regions | Hyojeong An |
| 2025/10/13 | 15:30~16:00 | B2-101 | Freezing Tag Problem – How to Wake Up a Swarm of Robots | Seongmin Kwon |
| 2025/10/27 | 15:30~16:00 | B2-101 | An Optimal Algorithm for Computing (<=k)-Level | Youjung Bae |
| 2025/11/03 | 15:30~16:00 | B2-101 | On the Discrete and Semi-continuous Versions of the Two-Watchtower Problem in the Plane | Byeonguk Kang |
| 2025/11/10 | 15:30~16:00 | B2-101 | Simplification of Trajectory Streams (Part 3) | Seokyun Kang |
| 2025/11/24 | 15:30~16:00 | B2-101 | Optimal location of Transportation devices | Taekang Eom |
| 2025/12/01 | 15:30~16:00 | B2-101 | Covering Weighted Points using Unit Square | Jaegun Lee |
| 2025/12/08 | 15:30~16:00 | B2-101 | Reinforcement Learning with Flip distance | Jeongwon Moon |
2025 Fall Lab Seminar