第 1 到 145 筆結果，共 145 筆。
| 公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 | |
|---|---|---|---|---|---|---|---|
| 1 | 1992 | 1-segment Center Problems | Imai, H.; Lee, D. T. ; Yang, C. D. | ORSA J. Computing. 4, 426-434 | |||
| 2 | 2007 | A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks | Huang, T. L.; Lee, D. T. | Journal Parallel and Distributed Computing 67(5), 516-530 | |||
| 3 | 1996 | A Faster Algorithm for Rubber-band Equivalent Transformation for Planar VLSI Layouts | Chen, H. F. S.; Lee, D. T. | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(2), 217-227 | |||
| 4 | 2000 | A Faster One-Dimensional Topological Compaction Algorithm | Chen, H. F. S.; Lee, D. T. | Algorithmica 28, 390-421 | |||
| 5 | 2005 | A Hybrid Adaptive Scheme of Fuzzy-Neural Iterative Learning Controller for Nonlinear Dynamic Systems | Wang, Y. C.; Chien, C. J.; Lee, D. T. | Int\'l J. Fuzzy Systems 7, 147-157 | |||
| 6 | 1998 | A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains | Papadopoulou, E.; Lee, D. T. | Algorithmica 20, 319-352 | |||
| 7 | 1989 | A New Approach to Topological Via Minimization | Sarrafzadeh, M.; Lee, D. T. | IEEE Trans. Computer-Aided Design 8, 890-900 | |||
| 8 | 1979 | A Note on the All Nearest Neighbor Problem for Convex Polygons | Yang, C. C.; Lee, D. T. | Information Processing Letters 8(4), 193-194 | |||
| 9 | 1985 | A Simple On-Line Bin Packing Algorithm | Lee, C. C.; Lee, D. T. | J. ACM 32, 562-572 | |||
| 10 | 2005 | A testing framework for web application security assessment | Huang, Y. W.; Tsai, C. H.; Lin, T. P.; Huang, S. K.; Lee, D. T. ; Kuo, S. Y. | Computer Networks 48, 739-761 | |||
| 11 | 2014 | Algorithms and Computation (ISAAC 2012) | Kun-Mao Chao; Tsan-sheng Hsu ; D. T. Lee | Theoretical Comput. Sci. 544, 1-2 | |||
| 12 | 1976 | An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function | Lee, D. T. ; Hong, S. J. | IEEE Trans. Comput. 25, 1117-1123 | |||
| 13 | 1987 | An efficient new algorithm for 2-D line clipping: Its development and analysis | Nicholl, T. M.; Lee, D. T. ; Nicholl, R. A. | ACM SIGGRAPH Computer Graphics 21(4), 253-262 | |||
| 14 | 1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | |||
| 15 | 2006 | An iterative distributed algorithm for multi-constraint multicast routing | Huang, T. L.; Lee, D. T. | Computer Communications 29(17), 3647-3661 | |||
| 16 | 1980 | An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Engineering Optimization 4, 179-192 | |||
| 17 | 1981 | An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Networks 11, 23-29 | |||
| 18 | 1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | |||
| 19 | 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | |||
| 20 | 1995 | An Optimal Algorithm for Roundness Determination on Convex Polygons | Swanson, K.; Lee, D. T. ; Wu, V. L. | Computational Geometry: Theory and Applications 5, 225-235 | |||
| 21 | 1995 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications | Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 14, 429-441 | |||
| 22 | 1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | |||
| 23 | 1982 | An Optimal Illumination Region Algorithm for Convex Polygons | Lee, D. T. ; Silio Jr, C. B. | IEEE Transactions on Computers 31(12), 225-1227 | |||
| 24 | 1979 | An Optimal Solution for the Channel-Assignment Problem | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 28, 807-810 | |||
| 25 | 1984 | An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems | Lee, D. T. | International Journal of Computer & Information Sciences 13, 23-32 | |||
| 26 | 2016 | Broadcasting in Weighted Trees under the Postal Model | Yu-Hsuan Su; Ching-Chi Lin; D. T. Lee | Theoretical Comput. Sci. 621, 73-81 | |||
| 27 | 2011 | Capacitated domination problem | Kao, M. J.; Liao, C. S.; Lee, D. T. | Algorithmica 60, 274-300 | |||
| 28 | 2015 | Capacitated Domination: Problem Complexity and Approximation Algorithms | Mong-Jen Kao; Han-Lin Chen; D.T. Lee | Algorithmica 72(1), 1-43 | |||
| 29 | 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 | |||
| 30 | 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 | |||
| 31 | 1986 | Computational Complexity of Art Gallery Problems | Lee, D. T. ; Lin, A. K. | IEEE Transactions on Information Theory 32(2), 276-282 | |||
| 32 | 1996 | Computational Geometry | Lee, D. T. | ACM Computing Surveys 28(1), 27-31 | |||
| 33 | 1984 | Computational Geometry: A Survey | Lee, D. T. ; Preparata, F. P. | IEEE Trans. Comput. 33, 1072-1101 | |||
| 34 | 2000 | Computing and Combinatorics: Foreword | Tao, J.; Lee, D. T. | Theoretical Comput. Sci. 240, 255 | |||
| 35 | 1986 | Computing the Largest Empty Rectangle | Chazelle, B.; Drysdale, R. L.; Lee, D. T. | SIAM J. Computing 15, 300-315 | |||
| 36 | 1985 | Computing the Relative Neighborhood Graph in the L1-metric | Lee, D. T. | Pattern Recognition 18, 327-332 | |||
| 37 | 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 | |||
| 38 | 1986 | Computing the Visibility Polygon from an Edge | Lee, D. T. ; Lin, A. K. | Computer Vision, Graphics, and Image Processing 34(1), 1-19 | |||
| 39 | 1999 | Critical area computation via Voronoi diagrams | Papadopoulou, E.; Lee, D. T. | IEEE Trans. Computer-Aided Design 18, 463-474 | |||
| 40 | 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 | |||
| 41 | 2003 | Design Parameters Study on the Stability and Perception of Riding Comfort of the Electrical Motorcycles under Rider Leaning | Lai, H. C.; Liu, J. S. ; Lee, D. T. ; Wang, L. S. | Mechatronics 13(1), 49-76 | |||
| 42 | 2007 | Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online) | Hsu, Chun-Nan ; Lai, Jin-Mei; Liu, Chia-Hung; Tseng, Huei-Hun; Lin, Chih-Yun; Lin, Kuan-Ting; Yeh, Hsu-Hua; Sung, Ting-Yi ; Hsu, Wen-Lian ; Su, Li-Jen; Lee, Sheng-An; Chen, Chan-Han; Lee, Gen-Cher; Lee, D. T. ; Shiue, Yow-Ling; Yeh, Chang-Wei; Chang, Chao-Hui; Kao, Cheng-Yan; Huang, Chi-Ying F. | BMC Bioinformatics 8, 1471-2105 | |||
| 43 | 2014 | Discovering joint audio–visual codewords for video event detection | I.-Hong Jhuo; Guangnan Ye; Shenghua Gao; Dong Liu; Yu-Gang Jiang; D. T. Lee ; Shih-Fu Chang | Machine Vision and Applications 25(1), 33-47 | |||
| 44 | 1983 | Dynamic Voronoi Diagrams | Gowda, I. G.; Kirkpatrick, D. G.; Lee, D. T. ; Naamad, A. | IEEE Trans. Infor. Theory 29, 724-731 | |||
| 45 | 2014 | Efficien Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | |||
| 46 | 1982 | Efficient Algorithms for Interval Graphs and Circular-arc Graphs | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | Networks 12(4), 459-467 | |||
| 47 | 2010 | Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem | Lin, T. -C.; Lee, D. T. | Theoretical Comput. Sci. 411, 986-994 | |||
| 48 | 2014 | Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | |||
| 49 | 1984 | Euclidean Shortest Paths in the Presence of Rectilinear Barriers | Lee, D. T. ; Preparata, F. P. | Networks 14(3), 393-410 | |||
| 50 | 2009 | Fast Algorithms for the Density Finding Problem | Lee, D. T. ; Lin, T. C.; Lu, H. I. | Algorithmica 53, 298--313 | |||
| 51 | 1995 | Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon | Alsuwaiyel, M. H.; Lee, D. T. | Info. Processing Letters 55, 75-79 | |||
| 52 | 1981 | Finding Intersection of Rectangles by Range Search | Lee, D. T. ; Wong, C. K. | J. Algorithms 2, 337-347 | |||
| 53 | 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 | |||
| 54 | 1985 | Finding the diameter of a set of lines | Ching, Y. T.; Lee, D. T. | Pattern Recognition 18(3-4), 249-255 | |||
| 55 | 1983 | (g0, g1,..., gk)-Trees and Unary 0L Systems | Lee, D. T. ; Liu, C. L.; Wong, C. K. | Theoretical Comput. Sci. 22, 209-217 | |||
| 56 | 1981 | Generalization of Voronoi Diagram in the Plane | Lee, D. T. ; Drysdale, R. L. | SIAM J. Computing 10, 73-87 | |||
| 57 | 1986 | Generalized Delaunay Triangulation for Planar Graphs | Lee, D. T. ; Lin, A. K. | Discrete & Computational Geometry 1, 201-217 | |||
| 58 | 1986 | Generating Binary Trees of Bounded Height | Lee, C. C.; Lee, D. T. ; Wong, C. K. | Acta Informatica 23, 529-544 | |||
| 59 | 2009 | GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing | Wei, J. D.; Tsai, M. H.; Lee, G. C.; Huang, J. H.; Lee, D. T. | IEEE Transactions on Visualization and Computer Graphics 15(2), 234-248 | |||
| 60 | 1986 | Geometric Complexity of Some Location Problems | Lee, D. T. ; Wu, Y. F. | Algorithmica 1, 193 | |||
| 61 | 1998 | GeoSheet: A Distributed Visualization Tool for Geometric Algorithms | Lee, D. T. ; Shen, C. F.; Sheu, S. M. | International Journal of Computational Geometry and Applications 8, 119-155 | |||
| 62 | 2009 | GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events | Te-Chin Chu; Tsunglin Liu; D.T. Lee ; Greg C. Lee; Arthur Chun-Chieh Shih | Bioinformatics 25(17), 2188-2193 | |||
| 63 | 1984 | Graph Algorithms on a Tree-Structured Parallel Computer | Yeh, D. Y.; Lee, D. T. | BIT 24, 333-340 | |||
| 64 | 2006 | Gridding Spot Centers of Smoothly Distorted Microarray Images | Ho, Jinn; Hwang, Wen-Liang ; Lu, Henry Horn-Shing; Lee, D. T. | IEEE Transactions on Image Processing 15, 342-353 | |||
| 65 | 1997 | K-best Cuts for Circular-arc Graphs | Tsai, K. H.; Lee, D. T. | Algorithmica 18, 198-216 | |||
| 66 | 2003 | Knowledge Management for Computational Problem Solving | Lee, D. T. ; Lee, G. C.; Huang, Y. W. | Journal of Universal Computer Science 9, 563-570 | |||
| 67 | 2005 | Labeling Points on a Single Line | Chen, Y. S.; Lee, D. T. ; Liao, C. S. | International Journal of Computational Geometry and Applications 15, 261-277 | |||
| 68 | 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 | |||
| 69 | 1979 | Location of Multiple Points in Planar Subdivision | Lee, D. T. ; Yang, C. C. | Information Processing Letters 9(4), 190-193 | |||
| 70 | 1993 | Maximum Independent Set of a Permutation Graph in K Tracks | Lee, D. T. ; Sarrafzadeh, M. | International Journal of Computational Geometry & Applications 3(3), 291-304 | |||
| 71 | 1982 | Medial Axis Transformation of a Planar Shape | Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 4, 363-369 | |||
| 72 | 1993 | Minimal Link Visibility Paths inside a Simple Polygon | Alsuwaiyel, M. H.; D. T. Lee | Computational Geometry: Theory and Applications 3, 1-26 | |||
| 73 | 1990 | Minimum Cut for Circular-arc Graphs | Lee, D. T. ; Sarrafzadeh, M.; Wu, Y. F. | SIAM J. Computing 19, 1041-1050 | |||
| 74 | 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 | |||
| 75 | 2001 | Modeling Automatic Assembly and Disassembly Operations for Virtual Manufacturing | Mok, S. M.; Wu, C. H.; Lee, D. T. | IEEE Trans. on Systems, Man, and Cybernetics, PART A: Systems and Humans 31, 223-232 | |||
| 76 | 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 | |||
| 77 | 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 | |||
| 78 | 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 | |||
| 79 | 1984 | On 2-Dimensional Channel Assignment Problem | Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 33, 2-6 | |||
| 80 | 1986 | On a Circle Placement Problem | Chazelle, B. M.; Lee, D. T. | Computing 36, 1-16 | |||
| 81 | 1984 | On a Circle-Cover Minimization Problem | Lee, C. C.; Lee, D. T. | Info. Processing Letters 18 | |||
| 82 | 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 | |||
| 83 | 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 | |||
| 84 | 1998 | On Crossing Minimization Problem | Chen, H. F. S.; Lee, D. T. | IEEE Trans. Computer-Aided Design 17, 406-418 | |||
| 85 | 1983 | On Finding the Convex Hull of a Simple Polygon | Lee, D. T. | International Journal of Computer & Information Sciences 12, 87-98 | |||
| 86 | 1982 | On k-Nearest Neighbor Voronoi Diagrams in the Plane | Lee, D. T. | IEEE Trans. Comput. 31, 478-487 | |||
| 87 | 2004 | On the Crossing Distribution Problem in Two Regions | Yu, T. K.; Lee, D. T. | Journal of Information Science and Engineering 20, 1-25 | |||
| 88 | 1984 | On the maximum empty rectangle problem | Naamad, A.; Lee, D. T. ; Hsu, W. L. | Discrete Applied Mathematics 8(3), 267-277 | |||
| 89 | 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 | |||
| 90 | 1989 | On-Line Bin Packing in Linear Time | Ramanan, P.; Brown, D. J.; Lee, C. C.; Lee, D. T. | J. Algorithms 10, 305-326 | |||
| 91 | 2015 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Theoretical Comput. Sci. 595, 46-64 | |||
| 92 | 2016 | Optimal Time-Convex Hull for a Straight-Line Highway in Lp-Metrics | B.-S. Dai; Mong-Jen Kao; D.T. Lee | Computational Geometry: Theory and Applications 53, 1-20 | |||
| 93 | 1991 | Out-of-Roundness Problem Revisited | Le, V. B.; Lee, D. T. | IEEE Trans. Pattern Analysis & Machine Intelligence 13, 217-223 | |||
| 94 | 2012 | Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices | Tung, Tsai-Yeh; Lin, Laurent; Lee, D. T. | IEEE WAINA 1, 100 | |||
| 95 | 2000 | Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems | Andrews, M. G.; Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 26, 263-289 | |||
| 96 | 1995 | Parallel Algorithms on Circular-Arc Graphs | Andrews, M. G.; Lee, D. T. | Computational Geometry: Theory and Applications 5, 117-141 | |||
| 97 | 1989 | Parallel Batched Planar Point Location on the CCC | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 33, 175-179 | |||
| 98 | 1992 | Parallel Enclosing Rectangle on SIMD Machines | Jeong, C. S.; Choi, J. J.; Lee, D. T. | Parallel Computing 18, 21-229 | |||
| 99 | 1990 | Parallel Geometric Algorithms on a Mesh Connected Computer | Jeong, C. S.; Lee, D. T. | Algorithmica 5, 155-177 | |||
| 100 | 2007 | Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences | Shih, Arthur Chun-Chieh ; Lee, D. T. ; Peng, Chin-Lin; Wu, Yu-Wei | BMC Bioinformatics 8, 63 | |||
| 101 | 1990 | Planar Subset of Multi-terminal Nets | Liao, K. F.; Lee, D. T. ; Sarrafzadeh, M. | Integration, the VLSI Journal 10, 19-37 | |||
| 102 | 1995 | Point Set pattern matching ind-dimensions | deRezende, P. J.; Lee, D. T. | Algorithmica 13, 387-404 | |||
| 103 | 2013 | Power Domination in Circular-arc Graphs | Liao, Chung-Shou; Lee, D. T. | Algorithmica 65, 443-466 | |||
| 104 | 2014 | Preface Algorithms and Computation (ISAAC 2012) | Kun-Mao Chao; Tsan-sheng Hsu ; D. T. Lee | Algorithmica 70(4), 694-695 | |||
| 105 | 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 | |||
| 106 | 2007 | Randomized Algorithm for the Sum Selection Problem | Lin, T. C.; Lee, D. T. | Theoretical Computer Science 377(1), 151-156 | |||
| 107 | 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 | |||
| 108 | 1983 | Ranking and Unranking of B-Trees | Gupta, U. I.; Lee, D. T. ; Wong, C. K. | J. Algorithms 4, 51-60 | |||
| 109 | 1981 | Record Allocation for Minimizing Expected Seek Delay Time | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T.; Pruitt, J. W.; Wong, C. K. | Theoretical Comput. Sci. 16, 307-319 | |||
| 110 | 1995 | Rectilinear Path Problems among Rectilinear Obstacles Revisited | Yang, C. D.; Lee, D. T. ; Wong, C. K. | SIAM J. Computing 24, 457-472 | |||
| 111 | 1996 | Rectilinear Paths Among Rectilinear Obstacles | Lee, D. T. ; Yang, C. D.; Wong, C. K. | Discrete Applied Mathematics 70, 185-215 | |||
| 112 | 1989 | Rectilinear Shortest Paths with Rectangular Barriers | de Rezende, P. J.; Lee, D. T. ; Wu, Y. F. | Discrete & Computational Geometry 4, 41-53 | |||
| 113 | 1994 | Restricted Track Assignment with Applications | Sarrafzadeh, M.; Lee, D. T. | International Journal of Computational Geometry and Applications 4, 53-68 | |||
| 114 | 1991 | Shortest Rectilinear Paths among Weighted Obstacles | Lee, D. T. ; Yang, C. D.; Chen, T. H. | International Journal of Computational Geometry and Applications 1, 109-124 | |||
| 115 | 1990 | Shortest Rectilinear Paths among Weighted Rectangles | Yang, C. D.; Chen, T. H.; Lee, D. T. | J. Information Processing 13, 456-462 | |||
| 116 | 2006 | SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools | Shih, Arthur Chun-Chieh ; Lee, D. T. ; Lin, Laurent; Peng, Chin-Lin; Chen, Shiang-Heng; Wu, Yu-Wei; Wong, Chun-Yi; Chou, Meng-Yuan; Shiao, Tze-Chang; Hsieh, Mu-Fen | BMC Bioinformatics 7, 103 | |||
| 117 | 1999 | Skew Voronoi Diagram | Aichholzer, O.; Aurenhammer, F.; Chen, D. Z.; Lee, D. T. ; Papadopoulou, E. | International Journal of Computational Geometry and Applications 9, 235-247 | |||
| 118 | 1998 | Solving the All-pair Shortest Path Query Problem on Interval and Circular-arc Graphs | Chen, D. Z.; Lee, D. T. ; Sridhar, R.; Sekharan, C. N. | Networks 32, 249-257 | |||
| 119 | 2007 | State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms | Lee, D. T. ; Shiah, S. J.; Lee, C. M.; Wang, Y. C. | IEEE Transactions on Vehicular Technology 56(2), 544-556 | |||
| 120 | 2018 | The (1|1)-Centroid Problem in the Plane with Distance Constraints | Hung-I Yu; Tien-Ching Lin; D. T. Lee | International Journal of Computational Geometry and Applications 28, 81-109 | |||
| 121 | 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | |||
| 122 | 1993 | The All-Pairs-Quickest Path Problem | Lee, D. T. ; Papadopoulou, E. | Info. Processing Letters 45, 261-267 | |||
| 123 | 2013 | The Density Maximization Problem in Graphs | Mong-Jen Kao; Bastian Katz; Marcus Krug; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Journal of Combinatorial Optimization 26(4), 723-754 | |||
| 124 | 2004 | The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry and Applications 14, 421-452 | |||
| 125 | 2015 | The k-Nearest-Neighbor Voronoi Diagram Revisited | Chih-Hung Liu; Evanthia Papadopoulou; D. T. Lee | Algorithmica 71(2), 429-449 | |||
| 126 | 2001 | The L∞ Voronoi Diagram of Segments and VLSI Applications | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry & Applications 11(5), 503-528 | |||
| 127 | 2018 | The multi-service center problem | Hung-I Yu; Cheng-Chung Li; D.T. Lee | Theoretical Computer Science 705, 58-74 | |||
| 128 | 1985 | The Power of Geometric Duality | Chazelle, B.; Guibas, L. J.; Lee, D. T. | BIT 25, 76-90 | |||
| 129 | 1985 | The Power of Geometric Duality Revisited | Lee, D. T. ; Ching, Y. T. | Info. Processing Letters 21, 117-122 | |||
| 130 | 1997 | The Smallest Pair of Non-crossing Paths in a Rectilinear Polygon | Yang, C. D.; Lee, D. T. ; Wong, C. K. | IEEE Trans. Comput. 46, 930-941 | |||
| 131 | 1991 | Topological Via Minimization Revisited | Sarrafzadeh, M.; Lee, D. T. | IEEE Transactions on Computers 40(11), 1307-1312 | |||
| 132 | 2001 | Towards Web-Based Computing | Aoki, K.; Lee, D. T. | International Journal of Computational Geometry and Applications 11, 71-104 | |||
| 133 | 2004 | Travel Time Prediction with Support Vector Regression | Wu, C. H.; Ho, Jan-Ming ; Lee, D. T. | IEEE Transactions on Intelligent Transportation Systems 5(4), 276-281 | |||
| 134 | 1980 | Two Algorithms for Constructing Delaunay Triangulations | Lee, D. T. ; Schacter, B. J. | International Journal of Computer & Information Sciences 9, 219-242 | |||
| 135 | 1980 | Two Dimensional Voronoi Diagrams in the Lp-metric | Lee, D. T. | J. ACM 27, 604-618 | |||
| 136 | 1998 | Two Guard Walkability of Simple Polygons | Tseng, L. H.; Lee, D. T. ; Heffernan, P. | International Journal of Computational Geometry and Applications 8, 85-116 | |||
| 137 | 2005 | Two Variations of the Minimum Steiner Problem | Hsu, Tsan-Sheng ; Tsai, Kuo-Hui; Wang, Da-Wei ; Lee, D. T. | Journal of Combinatorial Optimization 9, 101-120 | |||
| 138 | 1999 | Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization | Farrahi, A. H.; Lee, D. T. ; Sarrafzadeh, M. | Algorithmica 23, 187-210 | |||
| 139 | 1983 | Visibility of a Simple Polygon | Lee, D. T. | Computer Vision, Graphics, and Image Processing 22, 207-221 | |||
| 140 | 1980 | Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage Applications | Lee, D. T. ; Wong, C. K. | SIAM J. Computing 9, 200-211 | |||
| 141 | 1977 | Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees | Lee, D. T. ; Wong, C. K. | Acta Informatica 9, 23-29 | |||
| 142 | 2000 | 典藏數位化資訊環境之探討 (On creation and management of digital libraries: System environment, human-computer interface and research issues) | Ho, Jan-Ming ; Huang, Shih-Kun; Chuang, Tyng-Ruey ; Lee, D. T. | Journal of Library and Information Science 26(2), 38-48 | |||
| 143 | 2020 | 科技始於人性 人文孕育利他胸懷──淺談數位典藏國家型科技計畫 | 李德財 | 評鑑雙月刊 (Evaluation Bimonthly) 第88期，頁46-50 | |||
| 144 | 2024 | 聰明的網路「用路人」，你準備好上路了嗎？（印刷版） | 李德財 | 遠見 (Global Views Monthly) 第452期，頁20 | |||
| 145 | 2020 | [開卷語]高教評鑑中心董事長李德財：教學及品保與時俱進 提升我國高等教育能見度 | 李德財演講 ; 池俊吉; 郭玟杏; 杜奕廷 | 評鑑雙月刊 (Evaluation Bimonthly) 第88期，頁1-5 |
