Education

• Habilitation in Computer Science, Karlsruhe Institute of Technology, 2020
• Ph.D. in Electronics Engineering, National Taiwan University, 2009
• Bachelor in Computer Science, National Taiwan University, 2005

Working Experience

• Associate Professor, Department of Electrical Engineering, National Taiwan University (08/2022 — present)
• Senior Researcher (Oberasistent), Department of Computer Science, ETH Zurich (07/2016 — 06/2022)
• Postdoc, Department of Computer Science, University of Bonn (08/2012 — 06/2016)
• Postdoc, Department of Computer Science, Karlsruhe Institute of Technology (05/2011 — 05/2012)
• Postdoc, Research Center for Information Technology Innovation, Academia Sinica (07/2010 — 2011/05 & 05/2012 — 2012/07)

Honors

• Yushan Young Fellow Program, Ministry of Education, Taiwan
• Humboldt Research Fellowship for postdocs, Alexander von Humboldt Foundation, Germany

Research Interests

• Algorithmic Aspects of Data Science
• Randomized Algorithms
• Computational Geometry

Selected Publications

Journals

1. Nearly optimal planar k nearest neighbors queries under general distance functions. SIAM Journal on Computing, vol. 51, no. 3, pp. 723-765, 2022. (single author)
2. Approximate minimum selection with unreliable comparisons. Algorithmica, vol. 84, no. 1, pp. 60-84, 2022. (joint work with Stefano Leucci)
3. A nearly optimal algorithm for the geodesic Voronoi diagram in a simple polygon. Algorithmica, vol. 82, no. 4, pp. 915-937, 2020. (single author)
4. An efficient randomized algorithm for higher-order abstract Voronoi diagrams. Algorithmica, vol. 81, no. 6, pp. 2317-2345, 2019. (joint work with Cecilia Bohler and Rolf Klein)
5. Minimizing the diameter of a spanning tree for imprecise points. Algorithmica, vol. 80, no. 2, pp. 801-826, 2018. (joint work with Sandro Montanari)
6. The k-nearest-neighbor Voronoi diagram revisited. Algorithmica, vol. 71, no. 2, pp. 429-449, 2015. (joint work with D. T. Lee and Evanthia Papadopoulou)

Conference

1. Private graphon estimation via sum-of-squares. The 56th ACM Symposium on Theory of Computing (STOC 2024), 2024. (joint work with Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua and David Steurer)
2. Fast algorithm for overcomplete order-3 tensor decomposition. The 35th Annual Conference on Learning Theory (COLT 2022), 2022. (joint work with Jingqiu Ding, Tommaso d'Orsi, David Steurer and Stefan Tiegel)
3. Nearly Optimal planar k nearest neighbors queries under general distance functions . The 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2020. (single author)
4. A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon . The 34th International Symposium on Computational Geometry (SoCG 2018), 2018. (single author)
5. An efficient randomized algorithm for higher-order abstract Voronoi dsiagrams.. The 32nd International Symposium on Computational Geometry (SoCG 2016), 2016. (joint work with Cecilia Bohler and Rolf Klein)
6. Higher-order geodesic Voronoi diagrams in a polygonal domain with holes.. The 24nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 2013. (joint work with D. T. Lee)