| 2026 | ESA | Smallest Convex Hulls of Polygons. | Mook Kwon Jung, Hee-Kap Ahn |
| 2026 | WALCOM | Shortcutting the Diameter of a Polygon. | Taekang Eom, Taehoon Ahn, Minju Song, Hee-Kap Ahn |
| 2025 | ISAAC | Minimum Partition of Polygons Under Width and Cut Constraints. | Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn |
| 2025 | ISAAC | Covering Weighted Points Using Unit Squares. | Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn |
| 2025 | IWOCA | Guarding Terrains with Guards on a Line. | Byeonguk Kang, Hwi Kim, Hee-Kap Ahn |
| 2025 | IWOCA | Monotone Partitions of Simple Polygons. | Jaegun Lee, Hyojeong An, Hwi Kim, Hee-Kap Ahn |
| 2025 | SODA | Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes. | Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn |
| 2025 | WADS | Farthest-Point Voronoi Diagrams in the Hilbert Metric. | Minju Song, Mook Kwon Jung, Hee-Kap Ahn |
| 2024 | LATIN | Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. | Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon |
| 2023 | WADS | Efficient k-Center Algorithms for Planar Points in Convex Position. | Jongmin Choi, Jaegun Lee, Hee-Kap Ahn |
| 2021 | IWOCA | Covering Convex Polygons by Two Congruent Disks. | Jongmin Choi, Dahye Jeong, Hee-Kap Ahn |
| 2021 | IWOCA | Intersecting Disks Using Two Congruent Disks. | Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn |
| 2020 | LATIN | Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. | Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn |
| 2019 | WADS | Maximizing Dominance in the Plane and Its Applications. | Jong Min Choi, Sergio Cabello, Hee-Kap Ahn |
| 2018 | AAAI | Product Quantized Translation for Fast Nearest Neighbor Search. | Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn |
| 2018 | COCOON | Polygon Queries for Convex Hulls of Points. | Eunjin Oh, Hee-Kap Ahn |
| 2018 | RAID | Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances. | Jeong-Han Yun, Yoonho Hwang, Woomyo Lee, Hee-Kap Ahn, Sin-Kyu Kim |
| 2018 | WALCOM | Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. | Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon |
| 2018 | WALCOM | Minimum-Width Square Annulus Intersecting Polygons. | Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh |
| 2017 | COCOON | A Time-Space Trade-Off for Triangulations of Points in the Plane. | Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri |
| 2017 | ISAAC | Finding Pairwise Intersections of Rectangles in a Query Rectangle. | Eunjin Oh, Hee-Kap Ahn |
| 2017 | ISAAC | A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. | Eunjin Oh, Hee-Kap Ahn |
| 2017 | ISAAC | Faster Algorithms for Growing Prioritized Disks and Rectangles. | Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, Andr van Renssen, Antoine Vigneron |
| 2017 | WALCOM | Computing the Center Region and Its Variants. | Eunjin Oh, Hee-Kap Ahn |
| 2017 | WALCOM | Bundling Two Simple Polygons to Minimize Their Convex Hull. | Jong Min Choi, Dongwoo Park, Hee-Kap Ahn |
| 2016 | ISAAC | Assigning Weights to Minimize the Covering Radius in the Plane. | Eunjin Oh, Hee-Kap Ahn |
| 2016 | ISAAC | A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. | Eunjin Oh, Hee-Kap Ahn |
| 2016 | LATIN | A Middle Curve Based on Discrete Frchet Distance. | Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk |
| 2016 | LATIN | Computing a Geodesic Two-Center of Points in a Simple Polygon. | Eunjin Oh, Sang Won Bae, Hee-Kap Ahn |
| 2015 | ISAAC | The 2-Center Problem in a Simple Polygon. | Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn |
| 2015 | ISAAC | Geometric Matching Algorithms for Two Realistic Terrains. | Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn |
| 2014 | LATIN | An Improved Data Stream Algorithm for Clustering. | Sang-Sub Kim, Hee-Kap Ahn |
| 2014 | WALCOM | Top-k Manhattan Spatial Skyline Queries. | Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn |
| 2013 | TAMC | Group Nearest Neighbor Queries in the | Hee-Kap Ahn, Sang Won Bae, Wanbin Son |
| 2013 | WADS | Bundling Three Convex Polygons to Minimize Area or Perimeter. | Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park |
| 2012 | CVPR | A fast nearest neighbor search algorithm by nonlinear embedding. | Yoonho Hwang, Bohyung Han, Hee-Kap Ahn |
| 2012 | ISAAC | Rectilinear Covering for Imprecise Input Points - (Extended Abstract). | Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa |
| 2012 | ISAAC | Computing k-center over Streaming Data for Small k. | Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son |
| 2012 | LATIN | A Generalization of the Convex Kakeya Problem. | Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron |
| 2011 | ISAAC | Generating Realistic Roofs over a Rectilinear Polygon. | Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron |
| 2011 | ISAAC | Covering and Piercing Disks with Two Centers. | Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron |
| 2010 | FAW | Adaptive Algorithms for Planar Convex Hull Problems. | Hee-Kap Ahn, Yoshio Okamoto |
| 2010 | ISAAC | Maximum Overlap of Convex Polytopes under Translation. | Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher |
| 2010 | ISAAC | Computing the Discrete Frchet Distance with Imprecise Input. | Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron |
| 2009 | FAW | Square and Rectangle Covering with Outliers. | Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son |
| 2008 | ISAAC | Covering a Point Set by Two Disjoint Rectangles. | Hee-Kap Ahn, Sang Won Bae |
| 2008 | ISAAC | Covering a Simple Polygon by Monotone Directions. | Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin |
| 2007 | ISAAC | Dilation-Optimal Edge Deletion in Polygonal Cycles. | Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang |
| 2007 | ISAAC | Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. | Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa |
| 2005 | ISAAC | Casting an Object with a Core. | Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa |
| 2005 | ISAAC | Stacking and Bundling Two Convex Polygons. | Hee-Kap Ahn, Otfried Cheong |
| 2004 | COCOON | Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. | Hee-Kap Ahn, Peter Bra, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron |
| 2002 | ISAAC | Casting a Polyhedron with Directional Uncertainty. | Hee-Kap Ahn, Otfried Cheong, Ren van Oostrum |
| 2001 | COCOON | Competitive Facility Location along a Highway. | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, Ren van Oostrum |
| 1998 | ISAAC | Casting with Skewed Ejection Direction. | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong |