D. T. Lee - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

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

2007

Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online)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. bmcbi, 8, 2007. [doi]
A distributed multicast routing algorithm for real-time applications in wide area networksTzu-Lun Huang, D. T. Lee. jpdc, 67(5):516-530, 2007. [doi]
Randomized algorithm for the sum selection problemTien-Ching Lin, D. T. Lee. TCS, 377(1-3):151-156, 2007. [doi]
::::Phylo-mLogo::::: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequencesArthur Chun-Chieh Shih, D. T. Lee, Chin-Lin Peng, Yu-Wei Wu. bmcbi, 8, 2007. [doi]
Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by TeachingJyh-Da Wei, Tsai-Yeh Tung, Tai-Yu Chen, D. T. Lee. ike 2007: 414-420
A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge PortalJyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee. iri 2007: 304-310 [doi]
Time Convex Hull with a HighwayTeng-Kai Yu, D. T. Lee. isvd 2007: 240-250 [doi]

2006

Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, ProceedingsDanny Z. Chen, D. T. Lee, editors, Volume 4112 of Lecture Notes in Computer Science, Springer, 2006.
Design and applications of an algorithm benchmark system in a computational problem solving environmentMing-Yu Chen, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee. iticse 2006: 123-127 [doi]
Gridding spot centers of smoothly distorted microarray imagesJinn Ho, Wen-Liang Hwang, Henry Horn-Shing Lu, D. T. Lee. TIP, 15(2):342-353, 2006. [doi]
An iterative distributed algorithm for multi-constraint multicast routingTzu-Lun Huang, D. T. Lee. comcom, 29(17):3647-3661, 2006. [doi]
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums ProblemTien-Ching Lin, D. T. Lee. isaac 2006: 460-473 [doi]
SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment toolsArthur 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. bmcbi, 7:103, 2006. [doi]
A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objectsMing-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee. compgeom 2006: 479-480 [doi]
Priority-Based Genetic Local Search and Its Application to the Traveling Salesman ProblemJyh-Da Wei, D. T. Lee. seal 2006: 424-432 [doi]

2005

Crosstalk- and performance-driven multilevel full-chip routingTsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee. tcad, 24(6):869-878, 2005. [doi]
Two Variations of the Minimum Steiner ProblemTsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee. jco, 9(1):101-120, 2005. [doi]
A testing framework for Web application security assessmentYao-Wen Huang, Chung-Hung Tsai, Tsung-Po Lin, Shih-Kun Huang, D. T. Lee, Sy-Yen Kuo. cn, 48(5):739-761, 2005. [doi]
Comments and an improvement on A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks Tzu-Lun Huang, D. T. Lee. ton, 13(6):1410-1411, 2005. [doi]
Randomized Algorithm for the Sum Selection ProblemTien-Ching Lin, D. T. Lee. isaac 2005: 515-523 [doi]
SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment ResultsArthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao. csb 2005: 269-270 [doi]
Efficient Exact Spare Allocation via Boolean SatisfiabilityFang Yu, Chung-Hung Tsai, Yao-Wen Huang, D. T. Lee, Hung-Yau Lin, Sy-Yen Kuo. dft 2005: 361-370 [doi]

2004

2003

A Fast Crosstalk- and Performance-Driven Multilevel Routing SystemTsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee. iccad 2003: 382-387 [doi]
Chief Editor s NoticeD. T. Lee. ijcga, 13(1):1-2, 2003. [doi]
Knowledge Management for Computational Problem SolvingD. T. Lee, G. C. Lee, Yao-Wen Huang. jucs, 9(6):563-570, 2003. [doi]

2002

2001

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

2000

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related ProblemsMarilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. algorithmica, 26(2):263-289, 2000. [doi]
A Web-Based Distributed Programming EnvironmentKiyoko F. Aoki, D. T. Lee. hpcn 2000: 237-246 [doi]
A Faster One-Dimensional Topological Compaction Algorithm with Jog InsertionHsiao-Feng Steven Chen, D. T. Lee. algorithmica, 28(4):390-421, 2000. [doi]
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, ProceedingsD. T. Lee, Shang-Hua Teng, editors, Volume 1969 of Lecture Notes in Computer Science, Springer, 2000.
A System for Analyzing Automatic Assembly and Disassembly OperationsSwee M. Mok, Chi-haur Wu, D. T. Lee. icra 2000: 3695-3700
Guest editorial: low-power electronics and designK. Roy, D. T. Lee. tvlsi, 8(3):233-234, 2000. [doi]

1999

Skew Voronoi DiagramsOswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou. ijcga, 9(3):235, 1999.
Computing and Combinatorics, 5th Annual International Conference, COCOON 99, Tokyo, Japan, July 26-28, 1999, ProceedingsTakao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama, editors, Volume 1627 of Lecture Notes in Computer Science, Springer, 1999.
A Muscular-Like Compliance Control for Active Vehicle SuspensionShih-Lang Chang, Chi-haur Wu, D. T. Lee. icra 1999: 3275
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width MaximizationAmir H. Farrahi, D. T. Lee, Majid Sarrafzadeh. algorithmica, 23(3):187-210, 1999. [doi]
Critical area computation via Voronoi diagramsEvanthia Papadopoulou, D. T. Lee. tcad, 18(4):463-474, 1999. [doi]

1998

1997

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

1996

1995

Finding an Approximate Minimum-Link Visibility Path Inside a Simple PolygonMuhammad H. Alsuwaiyel, D. T. Lee. ipl, 55(2):75-79, 1995. [doi]
Parallel algorithms for maximum matching in interval graphsMarilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. ipps 1995: 84-92 [doi]
Parallel Algorithms on Circular-arc GraphsMarilyn G. Andrews, D. T. Lee. comgeo, 5:117-141, 1995.
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with ApplicationsMikhail J. Atallah, Danny Z. Chen, D. T. Lee. algorithmica, 14(5):429-441, 1995.
Point Set Pattern Matching in d-DimensionsPedro Jussieu de Rezende, D. T. Lee. algorithmica, 13(4):387-404, 1995.
On Steiner Tree Problem with 45 Degree RoutingD. T. Lee, Chin-Fang Shen, Cheng-Liang Ding. iscas 1995: 1680-1682
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract)Evanthia Papadopoulou, D. T. Lee. esa 1995: 238-251
An Optimal Algorithm for Roundness Determination on Convex PolygonsKurt Swanson, D. T. Lee, Vanban L. Wu. comgeo, 5:225-235, 1995.
Rectilinear Path Problems among Rectilinear Obstacles RevisitedChung-Do Yang, D. T. Lee, C. K. Wong. siamcomp, 24(3):457-472, 1995.

1994

1993

Minimal Link Visibility Paths Inside a Simple PolygonMuhammad H. Alsuwaiyel, D. T. Lee. comgeo, 3:1-25, 1993.
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with ApplicationsMikhail J. Atallah, Danny Z. Chen, D. T. Lee. esa 1993: 13-24
The All-Pairs Quickest Path ProblemD. T. Lee, Evanthia Papadopoulou. ipl, 45(5):261-267, 1993.
Maximum independent set of a permutation graph in K tracksD. T. Lee, Majid Sarrafzadeh. ijcga, 3(3):291-304, 1993.

1992

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

1991

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

1990

PreviousNext