| RAC Drawings in Subcubic Area | 0 | 0.34 | 2020 |
| An improved approximation algorithm for the discrete Fréchet distance. | 1 | 0.37 | 2018 |
| Emanation Graph - A New t-Spanner. | 0 | 0.34 | 2018 |
| Width and Bounding Box of Imprecise Points. | 0 | 0.34 | 2018 |
| A Clustering-Based Approach to Kinetic Closest Pair. | 0 | 0.34 | 2018 |
| Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. | 1 | 0.36 | 2017 |
| A Clustering-Based Approach to Kinetic Closest Pair. | 0 | 0.34 | 2016 |
| Online Packing of Equilateral Triangles. | 0 | 0.34 | 2015 |
| Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d. | 2 | 0.38 | 2014 |
| Kinetic $k$-Semi-Yao Graph and its Applications. | 2 | 0.40 | 2014 |
| Kinetic Reverse $k$-Nearest Neighbor Problem. | 1 | 0.35 | 2014 |
| (Reverse) k-nearest neighbors for moving objects | 0 | 0.34 | 2014 |
| A simple, faster method for kinetic proximity problems. | 5 | 0.45 | 2013 |
| Kinetic data structures for all nearest neighbors and closest pair in the plane | 3 | 0.40 | 2013 |
| Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$. | 0 | 0.34 | 2013 |
| Kinetic and stationary point-set embeddability for plane graphs | 3 | 0.39 | 2012 |
| Kinetic euclidean minimum spanning tree in the plane | 4 | 0.41 | 2012 |
| Kinetic pie delaunay graph and its applications | 4 | 0.41 | 2012 |
| Combinatorial changes of euclidean minimum spanning tree of moving points in the plane | 1 | 0.37 | 2010 |
