Young C. Wee

According to our database, Young C. Wee authored at least 4 papers between 1988 and 1994.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1994

Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors.

Young C. Wee, Seth Chaiken, S. S. Ravi

Algorithmica, 1994

1990

On the Angle Restricted Nearest Neighbor Problem.

Young C. Wee, Seth Chaiken, Dan E. Willard

Inf. Process. Lett., 1990

Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version).

Young C. Wee, Seth Chaiken, Dan E. Willard

Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

1988

Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems.

Dan E. Willard, Young C. Wee

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988