Chair : Taekang Eom |
||||
| Date | Time | Location | Title | Speaker |
| 2021/08/20 | 13:00~14:00 | B2-101 | Supports for Hypergraph | Seungjun Lee |
| 2021/08/27 | 13:00~14:00 | B2-101 | Smoothed Analysis of Knapsack Problem | Taekang Eom |
| 2021/09/03 | 11:00~12:00 | B2-101 | [SoCG2021] Characterizing Universal Reconfigurability of Modular Pivoting Robots | Byeonguk Kang |
| 2021/09/10 | 11:00~12:00 | B2-101 | Making Data Structures Persistent | Chanyang Seo |
| 2021/09/17 | 11:00~12:00 | B2-101 | Rectilinear Centers Problem | Mincheol Kim |
| 2021/10/01 | 11:00~12:00 | B2-101 | Elastic Geometric Shape Matching | Jiwoo Park |
| 2021/10/08 | 11:00~12:00 | B2-101 | Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons | Dahye Jeong |
| 2021/10/15 | 11:00~12:00 | B2-101 | Minimizing Fréchet Distance Under Translation | Taehoon Ahn |
| 2021/10/29 | 11:00~12:00 | B2-101 | Selection from Heaps, Row-Sorted Matrices, and X + Y Using Soft Heaps | Jaehoon Chung |
| 2021/11/05 | 11:00~12:00 | B2-101 | PTAS for Euclidean TSP and other geometric problems | Hwi Kim |
| 2021/11/12 | 11:00~12:00 | B2-101 | Coloring and Maximum Weight Independent Set of Rectangles | Jongmin Choi |
| 2021/11/26 | 11:00~12:00 | B2-101 | Universal convex covering problems under translation and discrete rotations | Mook Kwon Jung |
| 2021/12/10 | 11:00~12:00 | B2-101 | The two-center problem for convex polygons | Dahye Jeong |
| 2021/12/17 | 11:00~12:00 | B2-115 | Elastic Geometric Shape Matching | Jiwoo Park |
| 2022/01/07 | 13:00~14:00 | B2-115 | An Optimal Algorithm for Weighted Center Problem on Cycle Graphs | Taekang Eom |
| 2022/01/14 | 11:00~12:00 | B2-101 | Self-Improving Algorithms | Seungjun Lee |
| 2022/01/21 | 11:00~12:00 | B2-101 | Shrinking Process | Byeonguk Kang |
| 2022/02/11 | 11:00~12:00 | B2-101 | A conforming subdivision from Euclidean shortest paths in the plane | Chaeyoon Chung |
| 2022/02/18 | 11:00~12:00 | B2-101 | Reverse Shortest Path Problem for Unit-Disk Graphs | Taehoon Ahn |
2021 Fall Lab Seminar