An o(n log n) minimal spanning tree algorithmn for n points in the plane

Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions

IEEE Transactions on Computers

Minimum Spanning Trees of Moving Points in the Plane

IEEE Transactions on Computers

On the Complexity of Two Circle Strongly Connecting Problems

IEEE Transactions on Computers

Kinetic euclidean minimum spanning tree in the plane

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms

Kinetic Euclidean minimum spanning tree in the plane

Journal of Discrete Algorithms