2D Closest Pair Problem: A Closer Look. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2017)

Improved line facility location in weighted subdivisions. - Ovidiu Daescu; Ka Yaw Teo (IWISC, 2018)

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2019)

Trajectory planning for an articulated probe. - Ka Yaw Teo; Ovidiu Daescu; Kyle Fox (Comput. Geom., 2020)

Two-dimensional closest pair problem: A closer look. - Ovidiu Daescu; Ka Yaw Teo (Discret. Appl. Math., 2020)

The Discrete Median and Center Line Segment Problems in the Plane. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2021)

Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. - Ovidiu Daescu; Ka Yaw Teo (Comput. Geom., 2021)

Fast Deterministic Approximation of Medoid in Rd. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2022)

The Median Line Segment Problem: Computational Complexity and Constrained Variants. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2022)

Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2023)