Minimum-Width Square Annulus Intersecting Polygons. - Hee-Kap Ahn; Taehoon Ahn 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001 (WALCOM, 2018)

Minimum-width annulus with outliers: Circular, square, and rectangular cases. - Hee-Kap Ahn; Taehoon Ahn 001; Sang Won Bae 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001; Chan-Su Shin; Sang Duk Yoon (Inf. Process. Lett., 2019)

Rearranging a sequence of points onto a line. - Taehoon Ahn 001; Jongmin Choi; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Sang Duk Yoon (Comput. Geom., 2022)

Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. - Mincheol Kim; Chanyang Seo; Taehoon Ahn 001; Hee-Kap Ahn (Algorithmica, 2023)

Constrained Two-Line Center Problems. - Taehoon Ahn 001; Sang Won Bae 001 (ISAAC, 2024)

Incremental Algorithm and Local Search for Minimum Non-Obtuse Triangulations (CG Challenge). - Taehoon Ahn 001; Jaegun Lee; Byeonguk Kang; Hwi Kim (SoCG, 2025)

Minimum-width double-slabs and widest empty slabs in high dimensions. - Taehoon Ahn 001; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Sang Duk Yoon (Comput. Geom., 2025)

Parallel line centers with guaranteed separation. - Chaeyoon Chung; Taehoon Ahn 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2025)