News
--- Algorithmic Aspects of Data Science
Algorithmic Aspects of Data Science represent a rapidly growing area in Theoretical Computer Science and Data Science. Over the past two decades, Data Science has sparked a technological revolution across a wide range of scientific and industrial fields. Despite its widespread application, the theoretical foundations underlying its success remain partially unexplored. In this context, the Algorithmic Aspects of Data Science aim to investigate fundamental problems in Data Science from a theoretical perspective, focusing on the development of efficient algorithms with rigorous theoretical guarantees. My primary research topics in this area include Tensor Problems, Robust Statistics, and Clustering.
--- Computational Geometry
Computational Geometry is a fundamental area in Theoretical Computer Science, where we investigate the combinatorial properties of geometric problems and develop efficient algorithms. I am focused on proximity problems, involving distances between geometric objects. For example, I have published many results for Voronoi diagrams. Voronoi diagrams lie at the heart of computational geometry and serve as an extremely important tools for proximity problems. Furthermore, I am also studying the k nearest neighbors problem, which have many applications in diverse areas including data science.
--- Algorithmic Applications in Eletronic Design Automation
Beyond developing algorithms in theoretical computer science, I am also interested in utilizing algorithmic techniques to address practical problems in electronic design automation (EDA). In the past, I have applied algorithmic techniques in computational geometry to physical design in EDA. For example, I have employed Voronoi diagrams to construct Rectilinear Steiner Trees. The students in this part of my research are expected to participate in industry-academia collaboration projects.