Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
1989 | A New Approach to the Rectilinear Steiner Tree Problem | Ho, Jan-Ming; Vijayan, G.; Wong, C. K. | | | | |
1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | | | |
1981 | Finding Intersection of Rectangles by Range Search | Lee, D. T. ; Wong, C. K. | J. Algorithms 2, 337-347 | | | |
1997 | Finding Rectilinear Paths Among Obstacles in a Two-layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | International Journal of Computational Geometry and Applications 7, 581-598 | | | |
1983 | (g0, g1,..., gk)-Trees and Unary 0L Systems | Lee, D. T. ; Liu, C. L.; Wong, C. K. | Theoretical Comput. Sci. 22, 209-217 | | | |
1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | | | |
1990 | Layer Assignment for Multi-Chip Modules | Ho, Jan-Ming; Sarrafzadeh, M.; Vijayan, G.; Wong, C. K. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems , 1272-1277 | | | |
1991 | Minimum Diameter Spanning Trees and Related Problems | Ho, Jan-Ming ; Lee, D. T. ; Chang, C. H.; Wong, C. K. | SIAM Journal on Computing 20(5), 987-997 | | | |
1993 | Minimum Spanning Trees with Bounded Number of Bends | Ho, Jan-Ming ; Lee, D. T. ; Wong, C. K. | | | | |
1990 | New Algorithms for the Rectilinear Steiner Tree Problem | Ho, Jan-Ming; Vijayan, G.; Wong, C. K. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 9, 185-193 | | | |
1981 | Number of Vias: A Control Parameter for Global Wiring of High Density Chips | Lee, D. T. ; Hong, S. J.; Wong, C. K. | IBM J. Res. and Develop. 25, 261-271 | | | |
1994 | On Bends and Distances of Paths among Obstacles in Two-Layer Interconnection Model | Lee, D. T. ; Yang, C. D.; Wong, C. K. | IEEE Trans. Comput. 43, 711-724 | | | |
1992 | On Bends and Length of Rectilinear Paths: A Graph-Theoretic Approach | Yang, C. D.; Lee, D. T. ; Wong, C. K. | International Journal of Computational Geometry and Applications 2, 61-74 | | | |
1999 | On k-Ary Spanning Trees of Tournaments | Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. | Graph Theory March , 167-176 | | | |
2000 | On the Bounded Domination Number for Tournaments | Lu, Xiao Yun; Wang, Da-Wei; Wong, C. K. | Discrete Mathematics 220 | | | |
1983 | On the X-Y Convex Hull of a Set of X-Y polygons | Nicholl, T. M.; Lee, D. T. ; Liao, Y. Z.; Wong, C. K. | BIT 23, 456-471 | | | |
1990 | Pad Minimization for Planar Routing of Multiple Power Nets | Ho, Jan-Ming; Sarrafzadeh, M.; Vijayan, G.; Wong, C. K. | IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems , 419-426 | | | |
1991 | Planar Topological Routing of Pad Nets | Ho, Jan-Ming; Vijayan, G.; Wong, C. K. | VLSI/CAD 11 | | | |
1980 | Quintary Trees: A File Structure for Multidimensional Database Systems | Lee, D. T. ; Wong, C. K. | ACM Transactions on Database Systems 5(3), 339-353 | | | |
1982 | Ranking and Unranking of 2-3 Trees | Gupta, U. I.; Lee, D. T. ; Wong, C. K. | SIAM Journal on Computing 11(3), 582-590 | | | |