1. Aho. A. V., Hopcroft, J. E. and Ullman, J. D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Chang, M. S., Tang, C. Y. and Lee, R. C. T.: Solving the Euclidean bottleneck matching problem by k-relative neighborhood graph, to appear in Algorithmica.
3. Chang, M. S., Tang, C. Y. and Lee, R. C. T.: Solving Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs, The First Workshop on Proximity Graphs, New Mexico State University, 1989.
4. Chazelle, B. and Edelsbrunner, H.: An improved algorithm for constructing kth-order Voronoi diagram, IEEE Transactions on Computers, Vol. C-36, No. 11, 1987, pp. 1349–1354.
5. Edelsbrunner, H.: Edge-skeleton in arrangements with applications, Algorithmica, Vol. 1, No. 1, 1986, pp. 93–109.