_id,doi,title
4071,10.1145/98524.98535,An O(n^2log n) time algorithm for the MinMax angle triangulation
4076,10.1145/98524.98567, Euclidean minimum spanning trees and bichromatic closest pairs
4077,10.1145/98524.98548,Points and triangles in the plane and halving planes in space
4078,10.1145/98524.98551,Slimming down by adding; selecting heavily covered points