Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2016 | O(f) Bi-approximation for Capacitated Covering with Hard Capacities | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | | | | |
2019 | O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities(AACT 2019 Best Journal Paper Award) | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | Algorithmica 81, 1800-1817 | | | |
2012 | Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm | Liu, Chih-Hung; Kuo, Sy-Yen; Lee, D. T. ; Lin, Chun-Syun; Weng, Jung-Hung; Yuan, Shih-Yi | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 31(7), 1050-1060 | | | |
2015 | Old Traces, New Links: Representation of Taiwan Baotu in OpenStreetMap | Jheng-Peng Huang; Hao-Syong Liu; Hsiung-Ming Liao ; Tyng-Ruey Chuang | | | | |
1984 | On 2-Dimensional Channel Assignment Problem | Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 33, 2-6 | | | |
1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 | | | |
1984 | On a Circle-Cover Minimization Problem | Lee, C. C.; Lee, D. T. | Info. Processing Letters 18 | | | |
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 | | | |
2012 | On Bundle Configuration for Viral Marketing in Social Networks | Yang, D. -N. ; Lee, W. -C.; Chia, N. -H.; Ye, M.; Hung, H. -J. | | | | |
1998 | On Crossing Minimization Problem | Chen, H. F. S.; Lee, D. T. | IEEE Trans. Computer-Aided Design 17, 406-418 | | | |
2019 | On Efficient Processing of Group and Subsequent Queries for Social Activity Planning | Y.-L. Chen; D.-N. Yang ; C.-Y. Shen; W.-C. Lee; M.-S. Chen | IEEE Transactions on Knowledge and Data Engineering 31(12), 2364-2378 | | | |
- | On Extracting Socially Tenuous Groups for Online Social Networks with k-Triangles | C.-Y. Shen; H.-H. Shuai; D.-N. Yang ; G.-S. Lee; L.-H. Huang; W.-C. Lee; M.-S Chen | IEEE Trans. on Knowledge and Data Engineering (Early Access) | | | |
2022 | On Extracting Socially Tenuous Groups for Online Social Networks With kk-Triangles | C.-Y. Shen; H.-H. Shuai; D.-N. Yang ; G.-S. Lee; L.-H. Huang; W.-C. Lee; M.-S Chen | IEEE Transactions on Knowledge and Data Engineering 34(7), 3431-3446 | | | |
2017 | On Finding Socially Tenuous Groups for Online Social Networks | C.-Y. Shen; L.-H. Huang; D.-N. Yang ; H.-H. Shuai; W.-C. Lee; M.-S. Chen | ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) | | | |
1983 | On Finding the Convex Hull of a Simple Polygon | Lee, D. T. | International Journal of Computer & Information Sciences 12, 87-98 | | | |
2019 | On Improving the Write Responsiveness for Host-Aware SMR Drives | Ming-Chang Yang; Yuan-Hao Chang ; Fenggang Wu; Tei-Wei Kuo; David Hung-Chang Du | IEEE Transactions on Computers (TC) 68(1), 111-124 | | | |
2021 | On Influencing the Influential: Disparity Seeding | Y.-W. Teng; H.-W. Chen; D.-N. Yang ; W.-A. Pignolet; T.-W. Li; L. Chen | | | | |
1982 | On k-Nearest Neighbor Voronoi Diagrams in the Plane | Lee, D. T. | IEEE Trans. Comput. 31, 478-487 | | | |
2019 | On Merging MobileNets for Efficient Multitask Inference | Cheng-En Wu; Yi-Ming Chan; Chu-Song Chen | | | | |