Chair : Chaeyoon Chung |
||||
| Date | Time | Location | Title | Speaker |
| 2024/01/02 | 16:00~17:00 | B2-101 | Introduction to Quantum Algorithms | Suengjun Lee |
| 2024/01/05 | 11:00~12:00 | B2-101 | The minimum area convex packing of two convex polygon | Mook Kwon Jung |
| 2024/01/10 | 16:00~17:00 | B2-101 | Maintaining information in fully dynamic trees with top trees | Taekang Eom |
| 2024/01/12 | 11:00~12:00 | B2-101 | Covering a pointset by two Disjoint Rectangles | Jaegun Lee |
| 2024/01/19 | 11:00~12:00 | B2-101 | Voronoi Diagrams in the Hilbert Metric | Minju Song |
| 2024/01/23 | 16:00~17:00 | B2-101 | Parametric Searching | Seokyun Kang |
| 2024/01/26 | 11:00~12:00 | B2-101 | Orthogonal Range Searching on the RAM | Geunho Kim |
| 2024/01/30 | 16:00~17:00 | B2-101 | The Flip Diameter of Rectangulations and Convex Subdivisions | Hyojeong Ann |
| 2024/02/06 | 16:00~17:00 | B2-101 | Lower bounds to Helly numbers of Line transversals to disjoint congruent balls | Chaeyoon Chung |
| 2024/02/13 | 11:00~12:00 | B2-101 | Watchman route problem | Byeonguk Kang |
| 2024/02/20 | 16:00~17:00 | B2-101 | Optimal algorithm for higher order Voronoi diagram | Taehoon Ahn |
| 2024/02/27 | 16:00~17:00 | B2-101 | Epsilon net Theorem and Cutting Lemma | Mook Kwon Jung |
| 2024/02/27 | 16:00~17:00 | B2-101 | Randomized technique for solving implicit LP problems | Taekang Eom |
| 2024/03/05 | 16:00~17:00 | B2-101 | Fair partitioning of the traveling salesman problem | Hwi Kim |
| 2024/03/05 | 16:00~17:00 | B2-101 | Dynamic Convex Hulls under Window-Sliding Updates | Jaegun Lee |
| 2024/03/12 | 16:00~17:00 | B2-101 | Decomposing a polygon into simpler components | Hyojeong Ann |
| 2024/03/12 | 16:00~17:00 | B2-101 | The minimum convex container of two convex polytopes under translations | Seokyun Kang |
| 2024/03/19 | 16:00~17:00 | B2-115 | A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon | Minju Song |
| 2024/03/19 | 16:00~17:00 | B2-115 | Approximate Range Queries for Clustering | Geunho Kim |
| 2024/03/26 | 15:30~16:30 | B2-101 | An Optimal Randomized Algorithm for Maximum Tukey Depth | Taekang Eom |
| 2024/03/26 | 15:30~16:30 | B2-101 | Ordered Stabbing of Convex Objects with a Polygonal Chain | Chaeyoon Chung |
| 2024/04/02 | 15:30~16:30 | B2-101 | Computing Largest Minimum Color-Spanning Intervals of Imprecise Points | Taehoon Ahn |
| 2024/04/02 | 15:30~16:30 | B2-101 | Shortest Disjoint Paths on a Grid | Byeonguk Kang |
| 2024/04/23 | 15:30~16:30 | B2-101 | Cutting Hyperplanes for Divide-and-Conquer | Mook Kwon Jung |
| 2024/04/23 | 15:30~16:30 | B2-101 | Approximating the average stretch factor of geometric graphs | Hwi Kim |
| 2024/05/07 | 15:30~16:30 | B2-101 | Towards the best BST | Geunho Kim |
| 2024/05/07 | 15:30~16:30 | B2-101 | The Geodesic Edge Center of a Simple Polygon | Minju Song |
| 2024/05/14 | 15:30~16:30 | B2-101 | Maximum overlap of convex polytopes under translation | Seokyun Kang |
| 2024/05/21 | 15:30~16:30 | B2-101 | Online list accessing problem | Jaehoon Chung |
| 2024/05/21 | 15:30~16:30 | B2-101 | Covering rectilinear polygons by rectangles | Hyojeong Ann |
| 2024/05/28 | 15:30~16:30 | B2-101 | Dynamic Longest Increasing Subsequence | Chaeyoon Chung |
| 2024/05/28 | 15:30~16:30 | B2-101 | A Polynomial Time Algorithm for the k-Disjoint shortest paths problem | Byeonguk Kang |
| 2024/06/11 | 15:30~16:30 | B2-101 | An Optimal Range Minimum Query | Taekang Eom |
| 2024/06/11 | 15:30~16:30 | B2-101 | Minimum convex hull problem revisited | Mook Kwon Jung |
| 2024/06/19 | 15:30~16:30 | B2-101 | PushPush and Super Mario Bros. are NP-hard | Hwi Kim |
| 2024/06/19 | 15:30~16:30 | B2-101 | Slab Yard Online Scheduling: Bundle Approach | Jaehoon Chung |
| 2024/06/24 | 15:30~16:30 | B2-101 | Maximum Overlap Area of Several Convex Polygons Under Translations | Seokyun Kang |
| 2024/06/19 | 15:30~16:30 | B2-101 | Tiling with Squares and Packing Dominos in Polynomial Time | Hyojeong Ann |
2024 Spring Lab Seminar