Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDD. T. Lee
Der-Tsai Lee – 李德財
Person information
- unicode name: 李德財
- affiliation: Academia Sinica, Institute of Information Science, Taipei, Taiwan
- affiliation (former): Northwestern University, Department of Electrical and Computer Engineering, Evanston, IL, USA
- affiliation (former): National Science Foundation, Division of Computer and Computation Research, Washington, DC, USA
- affiliation (former, PhD 1978): University of Illinois at Urbana-Champaign, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2013
[b1]Franz Aurenhammer, Rolf Klein, Der-Tsai Lee:
Voronoi Diagrams and Delaunay Triangulations. World Scientific 2013, ISBN 978-981-4447-63-8, pp. I-VIII, 1-337
Journal Articles
- 2021
- [j143]Hung-I Yu
, Tien-Ching Lin, D. T. Lee:
Finding maximum sum segments in sequences with uncertainty. Theor. Comput. Sci. 850: 221-235 (2021) - 2019
- [j142]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. Algorithmica 81(5): 1800-1817 (2019) - [j141]Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee:
Tight approximation for partial vertex cover with hard capacities. Theor. Comput. Sci. 778: 61-72 (2019) - 2018
- [j140]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
The (1|1)-Centroid Problem in the Plane with Distance Constraints. Int. J. Comput. Geom. Appl. 28(2): 81-109 (2018) - [j139]Hung-I Yu, Cheng-Chung Li, D. T. Lee:
The multi-service center problem. Theor. Comput. Sci. 705: 58-74 (2018) - 2016
- [j138]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal time-convex hull for a straight-line highway in Lp-metrics. Comput. Geom. 53: 1-20 (2016) - [j137]Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee:
Broadcasting in weighted trees under the postal model. Theor. Comput. Sci. 621: 73-81 (2016) - 2015
- [j136]Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee:
The k-Nearest-Neighbor Voronoi Diagram Revisited. Algorithmica 71(2): 429-449 (2015) - [j135]Mong-Jen Kao, Han-Lin Chen, D. T. Lee:
Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica 72(1): 1-43 (2015) - [j134]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. 595: 46-64 (2015) - 2014
- [j133]Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee:
Preface Algorithms and Computation (ISAAC 2012). Algorithmica 70(4): 694-695 (2014) - [j132]I-Hong Jhuo, Guangnan Ye, Shenghua Gao, Dong Liu, Yu-Gang Jiang, D. T. Lee, Shih-Fu Chang:
Discovering joint audio-visual codewords for video event detection. Mach. Vis. Appl. 25(1): 33-47 (2014) - [j131]Chih-Hung Liu, Chun-Xun Lin, I-Che Chen, D. T. Lee, Ting-Chi Wang:
Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(12): 1928-1941 (2014) - [j130]Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee:
Algorithms and Computation (ISAAC 2012). Theor. Comput. Sci. 544: 1-2 (2014) - 2013
- [j129]Chung-Shou Liao, D. T. Lee:
Power Domination in Circular-Arc Graphs. Algorithmica 65(2): 443-466 (2013) - [j128]Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23(6): 425-426 (2013) - [j127]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013) - 2012
- [j126]Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu:
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geom. Appl. 22(1): 45-60 (2012) - [j125]Chih-Hung Liu, Sy-Yen Kuo, D. T. Lee, Chun-Syun Lin, Jung-Hung Weng, Shih-Yi Yuan:
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(7): 1050-1060 (2012) - 2011
- [j124]Mong-Jen Kao, Chung-Shou Liao, D. T. Lee:
Capacitated Domination Problem. Algorithmica 60(2): 274-300 (2011) - 2010
- [j123]Tien-Ching Lin, D. T. Lee:
Efficient algorithms for the sum selection problem and k maximum sums problem. Theor. Comput. Sci. 411(7-9): 986-994 (2010) - 2009
- [j122]Danny Z. Chen, D. T. Lee:
Guest Editors' Forward. Algorithmica 53(2): 155-156 (2009) - [j121]D. T. Lee, Tien-Ching Lin, Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009) - [j120]Te-Chin Chu, Tsunglin Liu, D. T. Lee, Greg C. Lee, Arthur Chun-Chieh Shih:
GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events. Bioinform. 25(17): 2188-2193 (2009) - [j119]Danny Z. Chen, D. T. Lee:
Editors' Foreword. Int. J. Comput. Geom. Appl. 19(3): 213-214 (2009) - [j118]Jyh-Da Wei, Ming-Hung Tsai, Gen-Cher Lee, Jeng-Hung Huang, Der-Tsai Lee:
GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing. IEEE Trans. Vis. Comput. Graph. 15(2): 234-248 (2009) - 2008
- [j117]Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia:
Preface. Theor. Comput. Sci. 408(2-3): 97-98 (2008) - 2007
- [j116]Chun-Nan Hsu, Jin-Mei Lai, Chia-Hung Liu, Huei-Hun Tseng, Chih-Yun Lin, Kuan-Ting Lin, Hsu-Hua Yeh, Ting-Yi Sung, Wen-Lian Hsu, Li-Jen Su, Sheng-An Lee, Chang-Han Chen, Gen-Cher Lee, D. T. Lee, Yow-Ling Shiue, Chang-Wei Yeh, Chao-Hui Chang, Cheng-Yan Kao, Chi-Ying F. Huang:
Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online). BMC Bioinform. 8 (2007) - [j115]Arthur Chun-Chieh Shih, D. T. Lee, Chin-Lin Peng, Yu-Wei Wu:
Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences. BMC Bioinform. 8 (2007) - [j114]Tzu-Lun Huang, D. T. Lee:
A distributed multicast routing algorithm for real-time applications in wide area networks. J. Parallel Distributed Comput. 67(5): 516-530 (2007) - [j113]Tien-Ching Lin, D. T. Lee:
Randomized algorithm for the sum selection problem. Theor. Comput. Sci. 377(1-3): 151-156 (2007) - [j112]Der-Tsai Lee, Shaw-Ji Shiah, Chien-Ming Lee, Ying-Chung Wang:
State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms. IEEE Trans. Veh. Technol. 56(2): 544-556 (2007) - 2006
- [j111]Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Yu-Wei Wu, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao, Mu-Fen Hsieh:
SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools. BMC Bioinform. 7: 103 (2006) - [j110]Tzu-Lun Huang, D. T. Lee:
An iterative distributed algorithm for multi-constraint multicast routing. Comput. Commun. 29(17): 3647-3661 (2006) - [j109]Jinn Ho, Wen-Liang Hwang, Henry Horng-Shing Lu, D. T. Lee:
Gridding spot centers of smoothly distorted microarray images. IEEE Trans. Image Process. 15(2): 342-353 (2006) - 2005
- [j108]Yao-Wen Huang, Chung-Hung Tsai, Tsung-Po Lin, Shih-Kun Huang, D. T. Lee, Sy-Yen Kuo:
A testing framework for Web application security assessment. Comput. Networks 48(5): 739-761 (2005) - [j107]Yu-Shin Chen, D. T. Lee, Chung-Shou Liao:
Labeling Points on a Single Line. Int. J. Comput. Geom. Appl. 15(3): 261-278 (2005) - [j106]Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005) - [j105]Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee:
Crosstalk- and performance-driven multilevel full-chip routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(6): 869-878 (2005) - [j104]Tzu-Lun Huang, D. T. Lee:
Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks". IEEE/ACM Trans. Netw. 13(6): 1410-1411 (2005) - 2004
- [j103]D. T. Lee, Joseph S. B. Mitchell:
A note from the editors-in-chief. Int. J. Comput. Geom. Appl. 14(1-2) (2004) - [j102]Evanthia Papadopoulou, D. T. Lee:
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. 14(6): 421-452 (2004) - [j101]T. K. Yu, D. T. Lee:
On the Crossing Distribution Problem in Two Regions. J. Inf. Sci. Eng. 20(1): 1-25 (2004) - [j100]Chun-Hsin Wu, Jan-Ming Ho, D. T. Lee:
Travel-time prediction with support vector regression. IEEE Trans. Intell. Transp. Syst. 5(4): 276-281 (2004) - 2003
- [j99]D. T. Lee:
Chief Editor's Notice. Int. J. Comput. Geom. Appl. 13(1): 1-2 (2003) - [j98]D. T. Lee, Gen-Cher Lee, Yao-Wen Huang:
Knowledge Management for Computational Problem Solving. J. Univers. Comput. Sci. 9(6): 563-570 (2003) - 2001
- [j97]Kiyoko F. Aoki, D. T. Lee:
Towards Web-Based Computing. Int. J. Comput. Geom. Appl. 11(1): 71-104 (2001) - [j96]Evanthia Papadopoulou, D. T. Lee:
The Linfty-Voronoi Diagram of Segments and VLSI Applications. Int. J. Comput. Geom. Appl. 11(5): 503-528 (2001) - [j95]Swee M. Mok, Chi-haur Wu, D. T. Lee:
Modeling automatic assembly and disassembly operations for virtual manufacturing. IEEE Trans. Syst. Man Cybern. Part A 31(3): 223-232 (2001) - 2000
- [j94]Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica 26(2): 263-289 (2000) - [j93]Hsiao-Feng Steven Chen, D. T. Lee:
A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. Algorithmica 28(4): 390-421 (2000) - [j92]Kaushik Roy, D. T. Lee:
Guest editorial: low-power electronics and design. IEEE Trans. Very Large Scale Integr. Syst. 8(3): 233-234 (2000) - 1999
- [j91]Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh:
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. Algorithmica 23(3): 187-210 (1999) - [j90]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou:
Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. 9(3): 235-248 (1999) - [j89]Evanthia Papadopoulou, D. T. Lee:
Critical area computation via Voronoi diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(4): 463-474 (1999) - 1998
- [j88]Evanthia Papadopoulou, D. T. Lee:
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica 20(4): 319-352 (1998) - [j87]L. H. Tseng, Paul J. Heffernan, D. T. Lee:
Two-Guard Walkability of Simple Polygons. Int. J. Comput. Geom. Appl. 8(1): 85-116 (1998) - [j86]D. T. Lee, Chin-Fang Shen, Dennis S. Sheu:
Geosheet: A Distributed Visualization Tool for Geometric Algorithms. Int. J. Comput. Geom. Appl. 8(2): 119-156 (1998) - [j85]Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan:
Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks 31(4): 249-258 (1998) - [j84]Hsiao-Feng Steven Chen, D. T. Lee:
On crossing minimization problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(5): 406-418 (1998) - 1997
- [j83]Kuo-Hui Tsai, D. T. Lee:
k Best Cuts for Circular-Arc Graphs. Algorithmica 18(2): 198-216 (1997) - [j82]D. T. Lee, Chung-Do Yang, C. K. Wong:
Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. Int. J. Comput. Geom. Appl. 7(6): 581-598 (1997) - [j81]Chung-Do Yang, D. T. Lee, C. K. Wong:
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon. IEEE Trans. Computers 46(8): 930-941 (1997) - 1996
- [j80]D. T. Lee:
Computational Geometry. ACM Comput. Surv. 28(1): 27-31 (1996) - [j79]D. T. Lee, Chung-Do Yang, C. K. Wong:
Rectilinear Paths Among Rectilinear Obstacles. Discret. Appl. Math. 70(3): 185-215 (1996) - [j78]Hsiao-Feng Steven Chen, D. T. Lee:
A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(2): 217-227 (1996) - 1995
- [j77]Pedro Jussieu de Rezende, D. T. Lee:
Point Set Pattern Matching in d-Dimensions. Algorithmica 13(4): 387-404 (1995) - [j76]Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Algorithmica 14(5): 429-441 (1995) - [j75]Marilyn G. Andrews, D. T. Lee:
Parallel Algorithms on Circular-arc Graphs. Comput. Geom. 5: 117-141 (1995) - [j74]Kurt Swanson, D. T. Lee, Vanban L. Wu:
An Optimal Algorithm for Roundness Determination on Convex Polygons. Comput. Geom. 5: 225-235 (1995) - [j73]Muhammad H. Alsuwaiyel, D. T. Lee:
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. 55(2): 75-79 (1995) - [j72]Chung-Do Yang, D. T. Lee, C. K. Wong:
Rectilinear Path Problems among Rectilinear Obstacles Revisited. SIAM J. Comput. 24(3): 457-472 (1995) - 1994
- [j71]Majid Sarrafzadeh, D. T. Lee:
Restricted track assignment with applications. Int. J. Comput. Geom. Appl. 4(1): 53-68 (1994) - [j70]D. T. Lee, Chung-Do Yang, C. K. Wong:
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model. IEEE Trans. Computers 43(6): 711-724 (1994) - 1993
- [j69]Muhammad H. Alsuwaiyel, D. T. Lee:
Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. 3: 1-25 (1993) - [j68]D. T. Lee, Majid Sarrafzadeh:
Maximum independent set of a permutation graph in K tracks. Int. J. Comput. Geom. Appl. 3(3): 291-304 (1993) - [j67]D. T. Lee, Evanthia Papadopoulou:
The All-Pairs Quickest Path Problem. Inf. Process. Lett. 45(5): 261-267 (1993) - 1992
- [j66]Chung-Do Yang, D. T. Lee, C. K. Wong:
On bends and lengths of rectilinear paths: a graph theoretic approach. Int. J. Comput. Geom. Appl. 2(1): 61-74 (1992) - [j65]Hiroshi Imai, D. T. Lee, Chung-Do Yang:
1-Segment Center Problems. INFORMS J. Comput. 4(4): 426-434 (1992) - [j64]Chang-Sung Jeong, Jung-Ju Choi, Der-Tsai Lee:
Parallel enclosing rectangle on SIMD machines. Parallel Comput. 18(2): 221-229 (1992) - [j63]Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem. SIAM J. Discret. Math. 5(2): 285-304 (1992) - 1991
- [j62]D. T. Lee, Chung-Do Yang, T. H. Chen:
Shortest rectilinear paths among weighted obstacles. Int. J. Comput. Geom. Appl. 1(2): 109-124 (1991) - [j61]Van-Ban Le, D. T. Lee:
Out-of-Roundness Problem Revisited. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 217-223 (1991) - [j60]Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong:
Minimum Diameter Spanning Trees and Related Problems. SIAM J. Comput. 20(5): 987-997 (1991) - [j59]Majid Sarrafzadeh, D. T. Lee:
Topological Via Minimization Revisited. IEEE Trans. Computers 40(11): 1307-1312 (1991) - 1990
- [j58]C. S. Jeong, D. T. Lee:
Parallel Geometric Algorithms on a Mesh-Connected Computer. Algorithmica 5(2): 155-177 (1990) - [j57]Kuo-Feng Liao, D. T. Lee, Majid Sarrafzadeh:
Planar subset of multi-terminal nets. Integr. 10(1): 19-37 (1990) - [j56]D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu:
Minimum Cuts for Circular-Arc Graphs. SIAM J. Comput. 19(6): 1041-1050 (1990) - [j55]D. T. Lee:
NSF report - computer and computation research. SIGACT News 21(1): 13 (1990) - [j54]D. T. Lee:
NSF report - computer and computation research. SIGACT News 21(2): 16 (1990) - 1989
- [j53]Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear Shortest Paths in the presence of Rectangular Barriers. Discret. Comput. Geom. 4: 41-53 (1989) - [j52]D. T. Lee, Franco P. Preparata:
Parallel Batched Planar Point Location on the CCC. Inf. Process. Lett. 33(4): 175-179 (1989) - [j51]Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee:
On-Line Bin Packing in Linear Time. J. Algorithms 10(3): 305-326 (1989) - [j50]D. T. Lee:
NSF report - computer and computation research. SIGACT News 20(4): 25 (1989) - [j49]Majid Sarrafzadeh, D. T. Lee:
A new approach to topological via minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(8): 890-900 (1989) - 1986
- [j48]C. C. Lee, D. T. Lee, C. K. Wong:
Generating Binary Trees of Bounded Height. Acta Informatica 23(5): 529-544 (1986) - [j47]D. T. Lee, Ying-Fung Wu:
Geometric Complexity of Some Loction Problems. Algorithmica 1(2): 193-211 (1986) - [j46]Bernard Marie Chazelle, D. T. Lee:
On a circle placement problem. Computing 36(1-2): 1-16 (1986) - [j45]D. T. Lee, Arthur K. Lin:
Computing the visibility polygon from an edge. Comput. Vis. Graph. Image Process. 34(1): 1-19 (1986) - [j44]D. T. Lee, A. K. Lin:
Generalized Dalaunay Triangualtion for Planar Graphs. Discret. Comput. Geom. 1: 201-217 (1986) - [j43]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986) - [j42]D. T. Lee, Arthur K. Lin:
Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2): 276-282 (1986) - 1985
- [j41]Bernard Chazelle, Leonidas J. Guibas, D. T. Lee:
The Power of Geometric Duality. BIT 25(1): 76-90 (1985) - [j40]D. T. Lee, Y. T. Ching:
The Power of Geometric Duality Revisited. Inf. Process. Lett. 21(3): 117-122 (1985) - [j39]C. C. Lee, D. T. Lee:
A Simple On-Line Bin-Packing Algorithm. J. ACM 32(3): 562-572 (1985) - [j38]Y. T. Ching, D. T. Lee:
Finding the diameter of a set of lines. Pattern Recognit. 18(3-4): 249-255 (1985) - [j37]D. T. Lee:
Relative neighborhood graphs in the Li-metric. Pattern Recognit. 18(5): 327-332 (1985) - 1984
- [j36]Der-Yun Yeh, D. T. Lee:
Graph Algorithms on a Tree-Structured Parallel Computer. BIT 24(3): 333-340 (1984) - [j35]Amnon Naamad, D. T. Lee, Wen-Lian Hsu:
On the maximum empty rectangle problem. Discret. Appl. Math. 8(3): 267-277 (1984) - [j34]D. T. Lee:
An optimal time and minimal space algorithm for rectangle intersection problems. Int. J. Parallel Program. 13(1): 23-32 (1984) - [j33]C. C. Lee, D. T. Lee:
On a Circle-Cover Minimization Problem. Inf. Process. Lett. 18(2): 109-115 (1984) - [j32]D. T. Lee, Franco P. Preparata:
Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3): 393-410 (1984) - [j31]D. T. Lee, Joseph Y.-T. Leung:
On the 2-Dimensional Channel Assignment Problem. IEEE Trans. Computers 33(1): 2-6 (1984) - [j30]D. T. Lee, Franco P. Preparata:
Computational Geometry - A Survey. IEEE Trans. Computers 33(12): 1072-1101 (1984) - 1983
- [j29]Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong:
On the X-Y Convex Hull of a Set of X-Y Polygons. BIT 23(4): 456-471 (1983) - [j28]D. T. Lee:
Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22(2): 207-221 (1983) - [j27]D. T. Lee:
On finding the convex hull of a simple polygon. Int. J. Parallel Program. 12(2): 87-98 (1983) - [j26]Udaiprakash I. Gupta, D. T. Lee, C. K. Wong:
Ranking and Unranking of B-Trees. J. Algorithms 4(1): 51-60 (1983) - [j25]D. T. Lee, C. L. Liu, C. K. Wong:
(g 0, g 1, ... g k)-Trees and Unary OL Systems. Theor. Comput. Sci. 22: 209-217 (1983) - [j24]I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad:
Dynamic Voronoi diagrams. IEEE Trans. Inf. Theory 29(5): 724-730 (1983) - 1982
- [j23]D. T. Lee, Franco P. Preparata:
An Improved Algorithm for the Rectangle Enclosure Problem. J. Algorithms 3(3): 218-224 (1982) - [j22]Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung:
Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4): 459-467 (1982) - [j21]D. T. Lee:
Medial Axis Transformation of a Planar Shape. IEEE Trans. Pattern Anal. Mach. Intell. 4(4): 363-369 (1982) - [j20]Udai Gupta, D. T. Lee, C. K. Wong:
Ranking and Unranking of 2-3 Trees. SIAM J. Comput. 11(3): 582-590 (1982) - [j19]Der-Tsai Lee:
On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Trans. Computers 31(6): 478-487 (1982) - [j18]D. T. Lee, Charles B. Silio Jr.:
An Optimal Illumination Region Algorithm for Convex Polygons. IEEE Trans. Computers 31(12): 1225-1227 (1982) - 1981
- [j17]D. T. Lee, C. K. Wong:
Finding Intersection of Rectangles by Range Search. J. Algorithms 2(4): 337-347 (1981) - [j16]J. MacGregor Smith, D. T. Lee, Judith Liebman:
An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric. Networks 11(1): 23-39 (1981) - [j15]D. T. Lee, Robert L. (Scot) Drysdale III:
Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. 10(1): 73-87 (1981) - [j14]D. T. Lee, Hsu Chang, C. K. Wong:
An On-Chip Compare/Steer Bubble Sorter. IEEE Trans. Computers 30(6): 396-405 (1981) - [j13]Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong:
Record Allocation for Minimizing Seek Delay. Theor. Comput. Sci. 16: 307-319 (1981) - 1980
- [j12]D. T. Lee, Bruce J. Schachter:
Two algorithms for constructing a Delaunay triangulation. Int. J. Parallel Program. 9(3): 219-242 (1980) - [j11]D. T. Lee:
Two-Dimensional Voronoi Diagrams in the Lp-Metric. J. ACM 27(4): 604-618 (1980) - [j10]D. T. Lee, C. K. Wong:
Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications. SIAM J. Comput. 9(1): 200-211 (1980) - [j9]D. T. Lee, C. K. Wong:
Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353 (1980) - 1979
- [j8]C. C. Yang, D. T. Lee:
A Note on the all Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 8(4): 193-194 (1979) - [j7]D. T. Lee, C. C. Yang:
Location of Multiple Points in a Planar Subdivision. Inf. Process. Lett. 9(4): 190-193 (1979) - [j6]D. T. Lee, Franco P. Preparata:
An Optimal Algorithm for Finding the Kernel of a Polygon. J. ACM 26(3): 415-421 (1979) - [j5]Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung:
An Optimal Solution for the Channel-Assignment Problem. IEEE Trans. Computers 28(11): 807-810 (1979) - 1978
- [j4]D. T. Lee, Franco P. Preparata:
The All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 7(4): 189-192 (1978) - 1977
- [j3]D. T. Lee, C. K. Wong:
Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Informatica 9: 23-29 (1977) - [j2]D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and Its Applications. SIAM J. Comput. 6(3): 594-606 (1977) - 1976
- [j1]Der-Tsai Lee, Se June Hong:
An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function. IEEE Trans. Computers 25(11): 1117-1123 (1976)
Conference and Workshop Papers
- 2018
- [c99]Hai-Lun Tu, Mong-Jen Kao, D. T. Lee:
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. ICS 2018: 468-475 - [c98]Hung-I Yu, Mong-Jen Kao, D. T. Lee:
The Multi-service Location Problems. ICS 2018: 507-515 - 2017
- [c97]Wei-Chun Chung, Jan-Ming Ho, Chung-Yen Lin, D. T. Lee:
CloudEC: A MapReduce-based algorithm for correcting errors in next-generation sequencing big data. IEEE BigData 2017: 2836-2842 - [c96]Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee:
Tight Approximation for Partial Vertex Cover with Hard Capacities. ISAAC 2017: 64:1-64:13 - 2016
- [c95]Yi-Siang Su, Tsung-Yi Ho, Der-Tsai Lee:
A routability-driven flow routing algorithm for programmable microfluidic devices. ASP-DAC 2016: 605-610 - [c94]I-Hong Jhuo, Li Weng, Wen-Huang Cheng, D. T. Lee:
A feature fusion framework for hashing. ICPR 2016: 2288-2293 - [c93]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. ISAAC 2016: 40:1-40:12 - [c92]Hung-I Yu, Tien-Ching Lin, Der-Tsai Lee:
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints. ISAAC 2016: 64:1-64:12 - 2014
- [c91]I-Hong Jhuo, Shenghua Gao, Liansheng Zhuang, D. T. Lee, Yi Ma:
Unsupervised Feature Learning for RGB-D Image Classification. ACCV (1) 2014: 276-289 - [c90]Wei-Chun Chung, Yu-Jung Chang, D. T. Lee, Jan-Ming Ho:
Using geometric structures to improve the error correction algorithm of high-throughput sequencing data on MapReduce framework. IEEE BigData 2014: 784-789 - [c89]Chun-Xun Lin, Chih-Hung Liu, I-Che Chen, D. T. Lee, Tsung-Yi Ho:
An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. DAC 2014: 141:1-141:6 - [c88]I-Hong Jhuo, D. T. Lee:
Video Event Detection via Multi-modality Deep Learning. ICPR 2014: 666-671 - [c87]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Dynamic Power Management with Hard Real-Time Guarantees. STACS 2014: 226-238 - 2013
- [c86]Wei-Chun Chung, Yu-Jung Chang, Chien-Chih Chen, Der-Tsai Lee, Jan-Ming Ho:
Optimizing a MapReduce module of preprocessing high-throughput DNA sequencing data. IEEE BigData 2013: 1-6 - [c85]Chien-Chih Chen, Yu-Jung Chang, Wei-Chun Chung, Der-Tsai Lee, Jan-Ming Ho:
CloudRS: An error correction algorithm of high-throughput sequencing data based on scalable framework. IEEE BigData 2013: 717-722 - [c84]Chih-Hung Liu, D. T. Lee:
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. SODA 2013: 1633-1645 - [c83]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal Time-Convex Hull under the L p Metrics. WADS 2013: 268-279 - 2012
- [c82]Tsai-Yeh Tung, Laurent Lin, D. T. Lee:
Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices. AINA Workshops 2012: 720-725 - [c81]I-Hong Jhuo, Dong Liu, D. T. Lee, Shih-Fu Chang:
Robust visual domain adaptation with low-rank reconstruction. CVPR 2012: 2168-2175 - [c80]Chih-Hung Liu, I-Che Chen, D. T. Lee:
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. DAC 2012: 613-622 - [c79]Guangnan Ye, I-Hong Jhuo, Dong Liu, Yu-Gang Jiang, D. T. Lee, Shih-Fu Chang:
Joint audio-visual bi-modal codewords for video event detection. ICMR 2012: 39 - [c78]Wei-Chun Chung, Chi-Jen Wu, Chin-Fu Ku, Der-Tsai Lee, Jan-Ming Ho:
DR. ION: Disaster rescue over information-oriented network. SOCA 2012: 1-4 - [c77]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. SWAT 2012: 59-70 - 2011
- [c76]I-Hong Jhuo, D. T. Lee:
Multiple-Instance Learning: Multiple Feature Selection on Instance Representation. AAAI 2011: 1794-1795 - [c75]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c74]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c73]Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee:
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA 2011: 70-81 - [c72]Mong-Jen Kao, D. T. Lee:
Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC 2011: 494-503 - [c71]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
Finding Maximum Sum Segments in Sequences with Uncertainty. ISAAC 2011: 734-743 - 2010
- [c70]Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee:
Broadcasting in Heterogeneous Tree Networks. COCOON 2010: 368-377 - [c69]I-Hong Jhuo, D. T. Lee:
Boosted Multiple Kernel Learning for Scene Category Recognition. ICPR 2010: 3504-3507 - [c68]Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon:
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. ISAAC (2) 2010: 121-131 - [c67]Teng-Kai Yu, D. T. Lee, Shih-Ming Chang, Justin Zhan:
Multi-party k-Means Clustering with Privacy Consideration. ISPA 2010: 200-207 - [c66]I-Hong Jhuo, D. T. Lee:
Boosting-based multiple kernel learning for image re-ranking. ACM Multimedia 2010: 1159-1162 - [c65]I-Hong Jhuo, Tsuhan Chen, D. T. Lee:
Scene Location Guide by Image-Based Retrieval. MMM 2010: 196-206 - 2009
- [c64]Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee:
Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System. CSIE (7) 2009: 356-360 - [c63]Dae-Young Seo, D. T. Lee, Tien-Ching Lin:
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ISAAC 2009: 283-292 - [c62]Tien-Ching Lin, D. T. Lee:
Optimal Randomized Algorithm for the Density Selection Problem. ISAAC 2009: 1004-1013 - 2008
- [c61]Ying-Chung Wang, Chiang-Ju Chien, Der-Tsai Lee:
An output recurrent fuzzy neural network based iterative learning control for nonlinear systems. FUZZ-IEEE 2008: 1563-1569 - [c60]Ying-Chung Wang, Chiang-Ju Chien, Der-Tsai Lee:
Reinforcement fuzzy-neural adaptive iterative learning control for nonlinear systems. ICARCV 2008: 733-738 - 2007
- [c59]Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee:
Maximizing the Number of Independent Labels in the Plane. FAW 2007: 136-147 - [c58]Chia-Mu Yu, Cheng-Chung Li, Chun-Shien Lu, Der-Tsai Lee, Sy-Yen Kuo:
Attack Probability Based Deterministic Key Predistribution Mechanism for Non-Uniform Sensor Deployment. ICDCS Workshops 2007: 18 - [c57]Jyh-Da Wei, Tsai-Yeh Tung, Tai-Yu Chen, D. T. Lee:
Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching. IKE 2007: 414-420 - [c56]Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee:
A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal. IRI 2007: 304-310 - [c55]Teng-Kai Yu, D. T. Lee:
Time Convex Hull with a Highway. ISVD 2007: 240-250 - 2006
- [c54]Ming-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee:
A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects. SCG 2006: 479-480 - [c53]Tien-Ching Lin, D. T. Lee:
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ISAAC 2006: 460-473 - [c52]Ming-Yu Chen, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee:
Design and applications of an algorithm benchmark system in a computational problem solving environment. ITiCSE 2006: 123-127 - [c51]Jyh-Da Wei, D. T. Lee:
Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. SEAL 2006: 424-432 - 2005
- [c50]Chung-Shou Liao, Der-Tsai Lee:
Power Domination Problem in Graphs. COCOON 2005: 818-828 - [c49]Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao:
SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results. CSB Workshops 2005: 269-270 - [c48]Fang Yu, Chung-Hung Tsai, Yao-Wen Huang, D. T. Lee, Hung-Yau Lin, Sy-Yen Kuo:
Efficient Exact Spare Allocation via Boolean Satisfiability. DFT 2005: 361-370 - [c47]Jinn Ho, Wen-Liang Hwang, Henry Horng-Shing Lu, D. T. Lee:
Gridding the spot centers of microarray images. EUSIPCO 2005: 1-4 - [c46]Tien-Ching Lin, D. T. Lee:
Randomized Algorithm for the Sum Selection Problem. ISAAC 2005: 515-523 - 2004
- [c45]Jyh-Da Wei, D. T. Lee:
A new approach to the traveling salesman problem using genetic algorithms with priority encoding. IEEE Congress on Evolutionary Computation 2004: 1457-1464 - [c44]Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo:
Verifying Web Applications Using Bounded Model Checking. DSN 2004: 199-208 - [c43]Ying-Chung Wang, Chiang-Ju Chien, D. T. Lee:
An adaptive PID-type iterative learning controller unknown nonlinear systems. ICARCV 2004: 607-612 - [c42]Yao-Wen Huang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo:
Non-Detrimental Web Application Security Scanning. ISSRE 2004: 219-230 - [c41]Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, Der-Tsai Lee, Sy-Yen Kuo:
Securing web application code by static analysis and runtime protection. WWW 2004: 40-52 - 2003
- [c40]Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee:
A Fast Crosstalk- and Performance-Driven Multilevel Routing System. ICCAD 2003: 382-387 - 2002
- [c39]Hsien-Chung Lai, Jing-Sin Liu, D. T. Lee, Li-Sheng Wang:
Finding battery locations of electrical motorcycles for better perception of riding comfort. ACC 2002: 915-920 - [c38]Evanthia Papadopoulou, D. T. Lee:
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC 2002: 511-522 - [c37]Tzu-Lun Huang, D. T. Lee:
A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks. ISPAN 2002: 335-340 - 2000
- [c36]Kiyoko F. Aoki, D. T. Lee:
A Web-Based Distributed Programming Environment. HPCN Europe 2000: 237-246 - [c35]Swee M. Mok, Chi-haur Wu, D. T. Lee:
A System for Analyzing Automatic Assembly and Disassembly Operations. ICRA 2000: 3695-3700 - 1999
- [c34]Swee M. Mok, Chi-haur Wu, D. T. Lee:
A hierarchical workcell model for intelligent assembly and disassembly. CIRA 1999: 125-130 - [c33]Shih-Lang Chang, Chi-haur Wu, D. T. Lee:
A Muscular-Like Compliance Control for Active Vehicle Suspension. ICRA 1999: 3275-3280 - [c32]Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang:
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. WADS 1999: 231-240 - 1998
- [c31]Evanthia Papadopoulou, D. T. Lee:
Critical area computation - a new approach. ISPD 1998: 89-94 - 1997
- [c30]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances. SCG 1997: 418-420 - [c29]Hsiao-Feng Steven Chen, D. T. Lee:
A Faster One-Dimensional Topological Compaction Algorithm. ISAAC 1997: 303-313 - 1996
- [c28]Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30 - [c27]Chi-haur Wu, Shih-Lang Chang, D. T. Lee:
A study of neuromuscular-like control in rehabilitation robot. ICRA 1996: 1178-1183 - [c26]D. T. Lee, C. F. Shen:
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. ISAAC 1996: 247-255 - [c25]D. T. Lee:
Geometric Algorithm Visualization, Current Status and Future. WACG 1996: 45-50 - 1995
- [c24]Evanthia Papadopoulou, D. T. Lee:
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA 1995: 238-251 - [c23]Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel algorithms for maximum matching in interval graphs. IPPS 1995: 84-92 - [c22]D. T. Lee, Chin-Fang Shen, Cheng-Liang Ding:
On Steiner Tree Problem with 45 Degree Routing. ISCAS 1995: 1680-1682 - 1994
- [c21]Evanthia Papadopoulou, D. T. Lee:
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG 1994: 110-115 - [c20]Danny Z. Chen, D. T. Lee:
Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs. IPPS 1994: 224-228 - [c19]Kuo-Hui Tsai, D. T. Lee:
k-Best Cuts for Circular-Arc Graphs. ISAAC 1994: 550-558 - 1993
- [c18]Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. ESA 1993: 13-24 - 1992
- [c17]D. T. Lee:
Rectilinear Paths among Rectilinear Obstacles. ISAAC 1992: 5-20 - [c16]Majid Sarrafzadeh, D. T. Lee:
Rstricted Track Assignment with Applications. ISAAC 1992: 449-458 - 1991
- [c15]D. T. Lee, Majid Sarrafzadeh:
Maximum Independent Set of a Permutation Graph in k Tracks. ISA 1991: 2-11 - [c14]Chung-Do Yang, D. T. Lee, C. K. Wong:
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. WADS 1991: 320-330 - 1990
- [c13]D. T. Lee, T. H. Chen, Chung-Do Yang:
Shortest Rectilinear Paths among Weighted Obstacles. SCG 1990: 301-310 - [c12]John C. C. Hsueh, D. T. Lee:
Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System. SEKE 1990: 110-115 - [c11]Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem. SODA 1990: 149-158 - 1989
- [c10]Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang:
Bounded-Diameter Minimum Spanning Trees and Related Problems. SCG 1989: 276-282 - [c9]Feng-Tyan Lin, Jie-Yong Juang, Der-Tsai Lee:
Application of mathematical constraint resolution to decision support system. COMPSAC 1989: 685-692 - 1987
- [c8]Tina M. Nicholl, D. T. Lee, Robin A. Nicholl:
An efficient new algorithm for 2-D line clipping: Its development and analysis. SIGGRAPH 1987: 253-262 - 1986
- [c7]D. T. Lee:
Geometric Location Problems and Their Complexity. MFCS 1986: 154-167 - 1985
- [c6]Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear shortest paths with rectangular barriers. SCG 1985: 204-213 - 1984
- [c5]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. STACS 1984: 43-54 - 1983
- [c4]Bernard Chazelle, Leonidas J. Guibas, D. T. Lee:
The Power of Geometric Duality. FOCS 1983: 217-225 - 1981
- [c3]D. T. Lee:
Shading of regions on vector display devises. SIGGRAPH 1981: 37-44 - [c2]D. T. Lee, Franco P. Preparata:
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. WG 1981: 303-314 - 1976
- [c1]D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and its Applications. STOC 1976: 231-235
Parts in Books or Collections
- 1990
- [p1]D. T. Lee, Arthur K. Lin:
Computational Complexity of Art Gallery Problems. Autonomous Robot Vehicles 1990: 303-309
Editorship
- 2018
- [e11]Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao:
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. LIPIcs 123, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-094-1 [contents] - 2012
- [e10]Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, ISBN 978-3-642-35260-7 [contents] - 2010
- [e9]Der-Tsai Lee, Danny Z. Chen, Shi Ying:
Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings. Lecture Notes in Computer Science 6213, Springer 2010, ISBN 978-3-642-14552-0 [contents] - 2008
- [e8]Tzong-Chen Wu, Chin-Laung Lei, Vincent Rijmen, Der-Tsai Lee:
Information Security, 11th International Conference, ISC 2008, Taipei, Taiwan, September 15-18, 2008. Proceedings. Lecture Notes in Computer Science 5222, Springer 2008, ISBN 978-3-540-85884-3 [contents] - 2006
- [e7]Ferng-Ching Lin, Der-Tsai Lee, Bao-Shuh Paul Lin, Shiuhpyng Shieh, Sushil Jajodia:
Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, Taipei, Taiwan, March 21-24, 2006. ACM 2006, ISBN 1-59593-272-0 [contents] - [e6]Danny Z. Chen, D. T. Lee:
Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings. Lecture Notes in Computer Science 4112, Springer 2006, ISBN 3-540-36925-2 [contents] - 2005
- [e5]Arbee L. P. Chen, Der-Tsai Lee:
Proceedings of the 3rd International Conference on Digital Archive Technologies, ICDAT 2005, Taipei, Taiwan, June 16-17, 2005. 2005 [contents] - 2000
- [e4]D. T. Lee, Shang-Hua Teng:
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Lecture Notes in Computer Science 1969, Springer 2000, ISBN 3-540-41255-7 [contents] - 1999
- [e3]Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama:
Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1627, Springer 1999, ISBN 3-540-66200-6 [contents] - 1997
- [e2]Tao Jiang, D. T. Lee:
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings. Lecture Notes in Computer Science 1276, Springer 1997, ISBN 3-540-63357-X [contents] - 1993
- [e1]Majid Sarrafzadeh, D. T. Lee:
Algorithmic Aspects of VLSI Layout. Lecture Notes Series on Computing 2, World Scientific 1993, ISBN 978-981-02-1488-3 [contents]
Reference Works
- 2004
- [r2]D. T. Lee:
Interval, Segment, Range, and Priority Search Trees. Handbook of Data Structures and Applications 2004 - 1997
- [r1]D. T. Lee:
Computational Geometry. The Computer Science and Engineering Handbook 1997: 111-140
Informal and Other Publications
- 2016
- [i7]Hung-I Yu, Tien-Ching Lin, D. T. Lee:
The (1|1)R-Centroid Problem on the Plane. CoRR abs/1608.03680 (2016) - [i6]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. CoRR abs/1609.02640 (2016) - 2013
- [i5]Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner:
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013) - [i4]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013) - [i3]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal Time-Convex Hull under the Lp Metrics. CoRR abs/1304.7833 (2013) - 2012
- [i2]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. CoRR abs/1204.4374 (2012) - 2011
- [i1]Mong-Jen Kao, D. T. Lee:
Capacitated Domination: Constant Factor Approximation for Planar Graphs. CoRR abs/1108.4606 (2011)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 18:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
