Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2010 | Broadcasting in Heterogeneous Tree Networks | Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. | | | | |
2016 | Broadcasting in Weighted Trees under the Postal Model | Yu-Hsuan Su; Ching-Chi Lin; D. T. Lee | Theoretical Comput. Sci. 621, 73-81 | | | |
2011 | Capacitated domination problem | Kao, M. J.; Liao, C. S.; Lee, D. T. | Algorithmica 60, 274-300 | | | |
2015 | Capacitated Domination: Problem Complexity and Approximation Algorithms | Mong-Jen Kao; Han-Lin Chen; D.T. Lee | Algorithmica 72(1), 1-43 | | | |
2014 | CloudDOE: A User-Friendly Tool for Deploying Hadoop Clouds and Analyzing High-Throughput Sequencing Data with MapReduce | Wei-Chun Chung; Chien-Chih Chen; Jan-Ming Ho ; Chung-Yen Lin ; Wen-Lian Hsu ; Yu-Chun Wang; Der-Tsai Lee ; Feipei Lai; Chih-Wei Huang; Yu-Jung Chang | PLoS One 9(6):e98146 | | | |
2013 | CloudRS: An Error Correction Algorithm of High-Throughput Sequencing Data | Chen, Chien-Chih; Chang, Yu-Jung; Chung, Wei-Chun; Lee, Der-Tsai ; Ho, Jan-Ming | | | | |
2005 | Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area Networks" | Huang, T. L.; Lee, D. T. | IEEE/ACM Transactions on Networking 13(6), 1410-1411 | | | |
1986 | Computational Complexity of Art Gallery Problems | Lee, D. T. ; Lin, A. K. | IEEE Transactions on Information Theory 32(2), 276-282 | | | |
1996 | Computational Geometry | Lee, D. T. | ACM Computing Surveys 28(1), 27-31 | | | |
1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | | | |
2000 | Computing and Combinatorics: Foreword | Tao, J.; Lee, D. T. | Theoretical Comput. Sci. 240, 255 | | | |
1986 | Computing the Largest Empty Rectangle | Chazelle, B.; Drysdale, R. L.; Lee, D. T. | SIAM J. Computing 15, 300-315 | | | |
1985 | Computing the Relative Neighborhood Graph in the L1-metric | Lee, D. T. | Pattern Recognition 18, 327-332 | | | |
2012 | Computing the Stretch Factor and Maximum Detour of Paths, Trees, and Cycles in the Normed Space | C. Wulff-Nilsen; A. Grüne; R. Klein; E. Langetepe; D.T. Lee ; T.-C. Lin; S.-H. Poon; T.-K. Yu | International Journal of Computational Geometry and Applications 22(1), 45-60 | | | |
1986 | Computing the Visibility Polygon from an Edge | Lee, D. T. ; Lin, A. K. | Computer Vision, Graphics, and Image Processing 34(1), 1-19 | | | |
2011 | Connecting Two Trees with Optimal Routing Cost | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Noellenburg, Martin; Rutter, Ignaz | | | | |
2011 | Constructing Optimal Shortcuts in Directed Weighted Paths | Klein, R.; Krug, M.; Langetepe, E.; Lee, D. T. ; Wagner, D. | | | | |
2000 | Content Management of Academia Sinica Digital Library | Ho, J. M. ; Huang, S. K.; Lee, D. T. | | | | |
1999 | Critical area computation via Voronoi diagrams | Papadopoulou, E.; Lee, D. T. | IEEE Trans. Computer-Aided Design 18, 463-474 | | | |
2005 | Crosstalk- and performance-driven multilevel full-chip routing | Ho, T. Y.; Chang, Y. W.; Chen, S. J.; Lee, D. T. | IEEE Trans. Computer-Aided Design 24, 869-878 | | | |