Young C. Wee

List of publications from the DBLP Bibliography Server - FAQ

1994

4 Young C. Wee, Seth Chaiken, S. S. Ravi: Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. Algorithmica 12(6): 421-435 (1994)

1990

3 EE Young C. Wee, Seth Chaiken, Dan E. Willard: Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). ACM Conference on Computer Science 1990: 49-55

2 Young C. Wee, Seth Chaiken, Dan E. Willard: On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. 34(2): 71-76 (1990)

1988

1 EE Dan E. Willard, Young C. Wee: Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. Symposium on Computational Geometry 1988: 34-43

1994
4		Young C. Wee, Seth Chaiken, S. S. Ravi: Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. Algorithmica 12(6): 421-435 (1994)
1990
3	EE	Young C. Wee, Seth Chaiken, Dan E. Willard: Computing Geographic Nearest Neighbors Using Monotone Matrix Searching (Preliminary Version). ACM Conference on Computer Science 1990: 49-55
2		Young C. Wee, Seth Chaiken, Dan E. Willard: On the Angle Restricted Nearest Neighbor Problem. Inf. Process. Lett. 34(2): 71-76 (1990)
1988
1	EE	Dan E. Willard, Young C. Wee: Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. Symposium on Computational Geometry 1988: 34-43

Coauthor Index