Chair : Chaeyoon Chung |
||||
| Date | Time | Location | Title | Speaker |
| 2023/09/01 | 11:00~12:00 | B2-101 | On approximating shortest paths in weighted triangular tessellations | Hyojeong Ann |
| 2023/09/15 | 11:00~12:00 | B2-101 | Minimum Ply Covering of Points with Unit Squares/Disks | Jaegun Lee |
| 2023/09/22 | 11:00~12:00 | B2-101 | Watchtower for k-crossing Visibility | Jeesun Han |
| 2023/10/06 | 11:00~12:00 | B2-101 | Klee’s measure problem | Chaeyoon Chung |
| 2023/10/13 | 11:00~12:00 | B2-101 | Visibility Maps of a Terrain | Byeonguk Kang |
| 2023/10/13 | 11:00~12:00 | B2-101 | On Lazy Randomized Incremental Construction | Taehoon Ahn |
| 2023/10/31 | 16:00~17:00 | B2-101 | Methods for Convex Optimization | Seungjun Lee |
| 2023/11/03 | 11:00~12:00 | B2-101 | Minimizing the continuous diameter when augmenting a geometric tree with a shortcut | Taekang Eom |
| 2023/11/07 | 16:00~17:00 | B2-101 | Minimizing the area of the convex hull of two convex polygons under rigid motion | Mook Kwon Jung |
| 2023/11/03 | 11:00~12:00 | B2-101 | Learning-augmented K-means Clustering | Jaegun Lee |
| 2023/11/14 | 16:00~17:00 | B2-101 | Routing in Trees | Jaehoon Chung |
| 2023/11/07 | 11:00~12:00 | B2-101 | Building a bridge to minimize diameter | Minju Song |
| 2023/11/21 | 16:00~17:00 | B2-101 | Finding the saddlepoint faster than sorting | Hwi Kim |
| 2023/11/24 | 11:00~12:00 | B2-101 | Succinct Data Structure for Baxter Permutation | Geunho Kim |
| 2023/11/28 | 16:00~17:00 | B2-101 | An Optimal Algorithm for Finding the Kernel of a Polygon | Hyojeong Ann |
| 2023/12/01 | 11:00~12:00 | B2-101 | Bundling three convex polygons to minimize area or perimeter | Seokyun Kang |
| 2023/12/08 | 11:00~12:00 | B2-101 | Approximation algorithms for k-line center | Chaeyoon Chung |
| 2023/12/12 | 16:00~17:00 | B2-101 | Voronoi visibility maps of terrains | Byeonguk Kang |
2023 Fall Lab Seminar