D. T. Lee - researchr alias

researchr

You are not signed in
Sign in
Sign up

D. T. Lee, Tien-Ching Lin, Hsueh-I Lu. Fast Algorithms for the Density Finding Problem. algorithmica, 53(3):298-313, 2009. [doi]
Danny Z. Chen, D. T. Lee. Guest Editors Forward. algorithmica, 53(2):155-156, 2009. [doi]

Teng-Kai Yu, D. T. Lee. Time Convex Hull with a Highway. isvd 2007: 240-250 [doi]
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 [doi]
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). bmcbi, 8, 2007. [doi]
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. bmcbi, 8, 2007. [doi]
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
Tzu-Lun Huang, D. T. Lee. A distributed multicast routing algorithm for real-time applications in wide area networks. jpdc, 67(5):516-530, 2007. [doi]
Tien-Ching Lin, D. T. Lee. Randomized algorithm for the sum selection problem. TCS, 377(1-3):151-156, 2007. [doi]

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. compgeom 2006: 479-480 [doi]
Tien-Ching Lin, D. T. Lee. Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. isaac 2006: 460-473 [doi]
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 [doi]
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. bmcbi, 7:103, 2006. [doi]
Tzu-Lun Huang, D. T. Lee. An iterative distributed algorithm for multi-constraint multicast routing. comcom, 29(17):3647-3661, 2006. [doi]
Jinn Ho, Wen-Liang Hwang, Henry Horn-Shing Lu, D. T. Lee. Gridding spot centers of smoothly distorted microarray images. tip, 15(2):342-353, 2006. [doi]
Jyh-Da Wei, D. T. Lee. Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. seal 2006: 424-432 [doi]
Danny Z. Chen, D. T. Lee, editors, Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings. Volume 4112 of Lecture Notes in Computer Science, Springer, 2006.

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 [doi]
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 . ton, 13(6):1410-1411, 2005. [doi]
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. cn, 48(5):739-761, 2005. [doi]
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 2005: 269-270 [doi]
Tien-Ching Lin, D. T. Lee. Randomized Algorithm for the Sum Selection Problem. isaac 2005: 515-523 [doi]
Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee. Two Variations of the Minimum Steiner Problem. jco, 9(1):101-120, 2005. [doi]
Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee. Crosstalk- and performance-driven multilevel full-chip routing. tcad, 24(6):869-878, 2005. [doi]

D. T. Lee. Chief Editor s Notice. ijcga, 13(1):1-2, 2003. [doi]
D. T. Lee, G. C. Lee, Yao-Wen Huang. Knowledge Management for Computational Problem Solving. jucs, 9(6):563-570, 2003. [doi]
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 [doi]

Swee M. Mok, Chi-haur Wu, D. T. Lee. Modeling automatic assembly and disassembly operations for virtual manufacturing. tsmc, 31(3):223-232, 2001.
Kiyoko F. Aoki, D. T. Lee. Towards Web-Based Computing. ijcga, 11(1):71-104, 2001.
Evanthia Papadopoulou, D. T. Lee. The L::infty::-Voronoi Diagram of Segments and VLSI Applications. ijcga, 11(5):503-528, 2001.

Swee M. Mok, Chi-haur Wu, D. T. Lee. A System for Analyzing Automatic Assembly and Disassembly Operations. icra 2000: 3695-3700
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. [doi]
K. Roy, D. T. Lee. Guest editorial: low-power electronics and design. tvlsi, 8(3):233-234, 2000. [doi]
Kiyoko F. Aoki, D. T. Lee. A Web-Based Distributed Programming Environment. hpcn 2000: 237-246 [doi]
Hsiao-Feng Steven Chen, D. T. Lee. A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. algorithmica, 28(4):390-421, 2000. [doi]
D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, Springer, 2000.

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. [doi]
Evanthia Papadopoulou, D. T. Lee. Critical area computation via Voronoi diagrams. tcad, 18(4):463-474, 1999. [doi]
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou. Skew Voronoi Diagrams. ijcga, 9(3):235, 1999.
Shih-Lang Chang, Chi-haur Wu, D. T. Lee. A Muscular-Like Compliance Control for Active Vehicle Suspension. icra 1999: 3275
Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama, editors, Computing and Combinatorics, 5th Annual International Conference, COCOON 99, Tokyo, Japan, July 26-28, 1999, Proceedings. Volume 1627 of Lecture Notes in Computer Science, Springer, 1999.

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. [doi]
L. H. Tseng, Paul J. Heffernan, D. T. Lee. Two-Guard Walkability of Simple Polygons. ijcga, 8(1):85-116, 1998.
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.
Hsiao-Feng Steven Chen, D. T. Lee. On crossing minimization problem. tcad, 17(5):406-418, 1998. [doi]
Evanthia Papadopoulou, D. T. Lee. Critical area computation - a new approach. ispd 1998: 89-94 [doi]
D. T. Lee, Chin-Fang Shen, Dennis S. Sheu. Geosheet: A Distributed Visualization Tool for Geometric Algorithms. ijcga, 8(2):119-156, 1998.

D. T. Lee. Computational Geometry. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 111-140, CRC Press, 1997.
Kuo-Hui Tsai, D. T. Lee. k Best Cuts for Circular-Arc Graphs. algorithmica, 18(2):198-216, 1997.
C. D. Yang, D. T. Lee, C. K. Wong. The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon. TC, 46(8):930-941, 1997.
Hsiao-Feng Steven Chen, D. T. Lee. A Faster One-Dimensional Topological Compaction Algorithm. isaac 1997: 303-313
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou. Voronoi Diagrams for Direction-Sensitive Distances. compgeom 1997: 418-420 [doi]
D. T. Lee, C. D. Yang, C. K. Wong. Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. ijcga, 7(6):581-598, 1997.
Tao Jiang, D. T. Lee, editors, Computing and Combinatorics, Third Annual International Conference, COCOON 97, Shanghai, China, August 20-22, 1997, Proceedings. Volume 1276 of Lecture Notes in Computer Science, Springer, 1997.

Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee. Steiner Problems on Directed Acyclic Graphs. cocoon 1996: 21-30
D. T. Lee. Computational Geometry. csur, 28(1):27-31, 1996.
D. T. Lee, C. F. Shen. The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. isaac 1996: 247-255
D. T. Lee. Geometric Algorithm Visualization, Current Status and Future. wacg 1996: 45-50
D. T. Lee, Chung-Do Yang, C. K. Wong. Rectilinear Paths Among Rectilinear Obstacles. dam, 70(3):185-215, 1996. [doi]
Hsiao-Feng Steven Chen, D. T. Lee. A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. tcad, 15(2):217-227, 1996. [doi]

Evanthia Papadopoulou, D. T. Lee. Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). esa 1995: 238-251
D. T. Lee, Chin-Fang Shen, Cheng-Liang Ding. On Steiner Tree Problem with 45 Degree Routing. iscas 1995: 1680-1682
Chung-Do Yang, D. T. Lee, C. K. Wong. Rectilinear Path Problems among Rectilinear Obstacles Revisited. siamcomp, 24(3):457-472, 1995.
Kurt Swanson, D. T. Lee, Vanban L. Wu. An Optimal Algorithm for Roundness Determination on Convex Polygons. comgeo, 5:225-235, 1995.
Pedro Jussieu de Rezende, D. T. Lee. Point Set Pattern Matching in d-Dimensions. algorithmica, 13(4):387-404, 1995.
Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. Parallel algorithms for maximum matching in interval graphs. ipps 1995: 84-92 [doi]
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.
Muhammad H. Alsuwaiyel, D. T. Lee. Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. ipl, 55(2):75-79, 1995. [doi]
Marilyn G. Andrews, D. T. Lee. Parallel Algorithms on Circular-arc Graphs. comgeo, 5:117-141, 1995.

D. T. Lee, Evanthia Papadopoulou. The All-Pairs Quickest Path Problem. ipl, 45(5):261-267, 1993.
D. T. Lee, Majid Sarrafzadeh. Maximum independent set of a permutation graph in K tracks. ijcga, 3(3):291-304, 1993.
Muhammad H. Alsuwaiyel, D. T. Lee. Minimal Link Visibility Paths Inside a Simple Polygon. comgeo, 3:1-25, 1993.
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

Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee. An Optimal Algorithm for the Maximum Two-Chain Problem. siamdm, 5(2):285-304, 1992.
Majid Sarrafzadeh, D. T. Lee. Rstricted Track Assignment with Applications. isaac 1992: 449-458
D. T. Lee. Rectilinear Paths among Rectilinear Obstacles. isaac 1992: 5-20
C. D. Yang, D. T. Lee, C. K. Wong. On bends and lengths of rectilinear paths: a graph theoretic approach. ijcga, 2(1):61-74, 1992.

Van-Ban Le, D. T. Lee. Out-of-Roundness Problem Revisited. pami, 13(3):217-223, 1991. [doi]
Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong. Minimum Diameter Spanning Trees and Related Problems. siamcomp, 20(5):987-997, 1991.
Majid Sarrafzadeh, D. T. Lee. Topological Via Minimization Revisited. TC, 40(11):1307-1312, 1991.
C. D. Yang, D. T. Lee, C. K. Wong. On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. wads 1991: 320-330
D. T. Lee, Majid Sarrafzadeh. Maximum Independent Set of a Permutation Graph in ::::k:::: Tracks. sersc-isa 1991: 2-11
D. T. Lee, C. D. Yang, T. H. Chen. Shortest rectilinear paths among weighted obstacles. ijcga, 1(2):109-124, 1991.

D. T. Lee, Franco P. Preparata. Parallel Batched Planar Point Location on the CCC. ipl, 33(4):175-179, 1989.
Jan-Ming Ho, D. T. Lee. Bounded Diameter Minimum Spanning Trees and Related Problems. compgeom 1989: 276-282 [doi]
Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu. Rectilinear Shortest Paths in the presence of Rectangular Barriers. dcg, 4:41-53, 1989.
Majid Sarrafzadeh, D. T. Lee. A new approach to topological via minimization. tcad, 8(8):890-900, 1989. [doi]
Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee. On-Line Bin Packing in Linear Time. jal, 10(3):305-326, 1989.

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 [doi]

D. T. Lee, Arthur K. Lin. Computational complexity of art gallery problems. TIT, 32(2):276-282, 1986.
D. T. Lee. Geometric Location Problems and Their Complexity. mfcs 1986: 154-167
D. T. Lee, Ying-Fung Wu. Complexity of Some Laction Problems. algorithmica, 1(2):193-211, 1986.
D. T. Lee, A. K. Lin. Generalized Dalaunay Triangualtion for Planar Graphs. dcg, 1:201-217, 1986.
Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee. Computing the Largest Empty Rectangle. siamcomp, 15(1):300-315, 1986.
C. C. Lee, D. T. Lee, C. K. Wong. Generating Binary Trees of Bounded Height. acta, 23(5):529-544, 1986.

C. C. Lee, D. T. Lee. A Simple On-Line Bin-Packing Algorithm. JACM, 32(3):562-572, July 1985. [doi]
D. T. Lee. Relative neighborhood graphs in the L:::i:::-metric. pr, 18(5):327-332, 1985. [doi]
Bernard Chazelle, Leonidas J. Guibas, D. T. Lee. The Power of Geometric Duality. bit, 25(1):76-90, 1985.
Y. T. Ching, D. T. Lee. Finding the diameter of a set of lines. pr, 18(3-4):249-255, 1985. [doi]
D. T. Lee, Y. T. Ching. The Power of Geometric Duality Revisited. ipl, 21(3):117-122, 1985.

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee. Computing the Largest Empty Rectangle. stacs 1984: 43-54
D. Y. Yeh, D. T. Lee. Graph Algorithms on a Tree-Structured Parallel Computer. bit, 24(3):333-340, 1984.
D. T. Lee, Joseph Y.-T. Leung. On the 2-Dimensional Channel Assignment Problem. TC, 33(1):2-6, 1984.
C. C. Lee, D. T. Lee. On a Circle-Cover Minimization Problem. ipl, 18(2):109-115, 1984.
D. T. Lee, Franco P. Preparata. Computational Geometry - A Survey. TC, 33(12):1072-1101, 1984.

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee. The Power of Geometric Duality. focs 1983: 217-225
I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad. Dynamic Voronoi diagrams. TIT, 29(5):724-730, 1983.
D. T. Lee. Visibility of a simple polygon. cvgip, 22(2):207-221, 1983. [doi]
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.
D. T. Lee, C. L. Liu, C. K. Wong. (g 0, g 1, ... g k)-Trees and Unary OL Systems. TCS, 22:209-217, 1983.
U. I. Gupta, D. T. Lee, C. K. Wong. Ranking and Unranking of B-Trees. jal, 4(1):51-60, 1983.

Udai Gupta, D. T. Lee, C. K. Wong. Ranking and Unranking of 2-3 Trees. siamcomp, 11(3):582-590, 1982.
D. T. Lee, Franco P. Preparata. An Improved Algorithm for the Rectangle Enclosure Problem. jal, 3(3):218-224, 1982.
D. T. Lee, Charles B. Silio Jr.. An Optimal Illumination Region Algorithm for Convex Polygons. TC, 31(12):1225-1227, 1982.

U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong. Record Allocation for Minimizing Seek Delay. TCS, 16:307-319, 1981.
D. T. Lee, C. K. Wong. Finding Intersection of Rectangles by Range Search. jal, 2(4):337-347, 1981.
D. T. Lee, Hsu Chang, C. K. Wong. An On-Chip Compare/Steer Bubble Sorter. TC, 30(6):396-405, 1981.
D. T. Lee, Robert L. (Scot) Drysdale III. Generalization of Voronoi Diagrams in the Plane. siamcomp, 10(1):73-87, 1981.

D. T. Lee. Two-Dimensional Voronoi Diagrams in the L::p::-Metric. JACM, 27(4):604-618, 1980. [doi]
D. T. Lee, C. K. Wong. Quintary Trees: A File Structure for Multidimensional Database Systems. tods, 5(3):339-353, 1980. [doi]
D. T. Lee, C. K. Wong. Voronoi Diagrams in L_1 (L_infty) Metrics with 2-Dimensional Storage Applications. siamcomp, 9(1):200-211, 1980.

U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung. An Optimal Solution for the Channel-Assignment Problem. TC, 28(11):807-810, 1979.
C.-C. Yang, D. T. Lee. A Note on the all Nearest-Neighbor Problem for Convex Polygons. ipl, 8(4):193-194, 1979.
D. T. Lee, C.-C. Yang. Location of Multiple Points in a Planar Subdivision. ipl, 9(4):190-193, 1979.
D. T. Lee, Franco P. Preparata. An Optimal Algorithm for Finding the Kernel of a Polygon. JACM, 26(3):415-421, 1979. [doi]

D. T. Lee, Franco P. Preparata. The All Nearest-Neighbor Problem for Convex Polygons. ipl, 7(4):189-192, 1978.

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, 9:23-29, 1977.
D. T. Lee, Franco P. Preparata. Location of a Point in a Planar Subdivision and Its Applications. siamcomp, 6(3):594-606, 1977.

D. T. Lee, Franco P. Preparata. Location of a Point in a Planar Subdivision and its Applications. stoc 1976: 231-235