Chair : Hyojeong An |
||||
Date | Time | Location | Title | Speaker |
2025/01/06 | 15:30~16:30 | B2-115 | Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes | Mook Kwon Jung |
2025/02/10 | 15:30~16:30 | B2-101 | On approximating shortest paths in weighted tessellations | Byeonguk Kang |
2025/02/10 | 15:30~16:30 | B2-101 | Geometric Matching and Bottleneck Problems | Taehoon Ahn |
2025/02/17 | 15:30~16:30 | B2-101 | An Optimal Algorithm for Half-plane Hitting Set | Taekang Eom |
2025/02/17 | 15:30~16:30 | B2-101 | Covering points with convex sets of minimum size | Mook Kwon Jung |
2025/02/24 | 15:30~16:30 | B2-101 | Bichromatic 2-center of pairs of points | Mook Kwon Jung |
2025/03/10 | 15:30~16:30 | B2-101 | Computability and complexity theory over reals | Jaehoon Chung |
2025/03/10 | 15:30~16:30 | B2-101 | Constructing Optimal Highways | Jeongwon Moon |
2025/03/17 | 15:30~16:30 | B2-101 | A General Heuristic Approach for Maximum Polygon Packing | Jueun Seo |
2025/03/17 | 15:30~16:30 | B2-101 | An optimal deterministic algorithm for geodesic farthest point voronoi diagrams in simple polygons | Minju Song |
2025/03/24 | 15:30~16:30 | B2-101 | How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments | Hyojeong An |
2025/03/24 | 15:30~16:30 | B2-101 | Near-linear time approximation algorithm for geometric maximum coverage | Chaeyoon Chung |
2025/03/31 | 15:30~16:30 | B2-101 | Reflective Guarding a Gallery | Seongmin Kwon |
2025/03/31 | 15:30~16:30 | B2-101 | shrink-and-bifurcate | Byeonguk Kang |
2025/04/14 | 15:30~16:30 | B2-101 | The optimization technique via sorted matrices | Taekang Eom |
2025/04/14 | 15:30~16:30 | B2-101 | Art Gallery Problem with Sliding Cameras | Mook Kwon Jung |
2025/04/21 | 15:30~16:30 | B2-101 | Maximum-Weight Planar Boxes in O(n^2) Time (and Better) | Jaegun Lee |
2025/04/21 | 15:30~16:30 | B2-101 | The Plank Problem | Jaehoon Chung |
2025/04/28 | 15:30~16:30 | B2-101 | Tiling the Plane with a Fixed Number of Polyominoes | Jueun Seo |
2025/05/12 | 15:30~16:30 | B2-101 | Optimal Insertion of a Segment Highway in a City Metric | Jeongwon Moon |
2025/05/12 | 15:30~16:30 | B2-101 | An almost optimal algorithm for Voronoi diagrams of non-disjointed line segments | Minju Song |
2025/05/19 | 15:30~16:30 | B2-101 | Shortest paths in intersection graphs of unit disks | Hyojeong An |
2025/05/19 | 15:30~16:30 | B2-101 | Approximation algorithms for Computing the Smallest k-Enclosing Circle | Chaeyoon Chung |
2025/05/26 | 15:30~16:30 | B2-101 | Freezing Tag Problem | Seongmin Kwon |
2025 Spring Lab Seminar