Chair : Dahye Jeong |
||||
| Date | Time | Location | Title | Speaker |
| 2021/01/08 | 11:00~12:00 | B2-101 | LP-type Problem | Seungjun Lee |
| 2021/01/15 | 11:00~12:00 | B2-101 | Derandomization | Taekang Eom |
| 2021/01/22 | 11:00~12:00 | B2-101 | Diameter of Unicycle Graphs | Mincheol Kim |
| 2021/01/29 | 11:00~12:00 | B2-101 | Minimum-link C-oriented path | Byeonguk Kang |
| 2021/02/05 | 11:00~12:00 | B2-101 | Two Center for Convex Polygons | Dahye Jeong |
| 2021/02/19 | 10:00~11:00 | B2-101 | Partitioning Polygon with Holes | Jaegun Lee |
| 2021/02/26 | 11:00~12:00 | B2-101 | Extended Corridor Structure | Taehoon Ahn |
| 2021/03/05 | 11:00~12:00 | B2-101 | Tentative Prune and Search | Jaehoon Chung |
| 2021/03/12 | 11:00~12:00 | B2-101 | k-center for Skylines | Taekang Eom |
| 2021/03/19 | 11:00~12:00 | B2-101 | Minimum-Link Rectilinear Paths for Triangulated Rectilinear Domains | Chanyang Seo |
| 2021/03/26 | 11:30~12:30 | B2-101 | Solving Graph Problems with Deep Q-Learning | Seungjun Lee |
| 2021/04/02 | 11:00~12:00 | B2-101 | Intersecting Disks using Two Congruent Disks | Byeonguk Kang |
| 2021/04/16 | 11:00~12:00 | B2-101 | Optimal L1 Farthest Neighbor Search with Rectangular Obstacles | Mincheol Kim |
| 2021/04/23 | 11:00~12:00 | B2-101 | Approximating the (Continuous) Frechet Distance | Dahye Jeong |
2021 Lab Seminar