| 2009 |
|---|
| 144 | EE | Danny Z. Chen,
D. T. Lee:
Guest Editors' Forward.
Algorithmica 53(2): 155-156 (2009) |
| 143 | EE | D. T. Lee,
Tien-Ching Lin,
Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem.
Algorithmica 53(3): 298-313 (2009) |
| 2007 |
|---|
| 142 | | 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 |
| 141 | EE | 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 |
| 140 | EE | Teng-Kai Yu,
D. T. Lee:
Time Convex Hull with a Highway.
ISVD 2007: 240-250 |
| 139 | EE | Tzu-Lun Huang,
D. T. Lee:
A distributed multicast routing algorithm for real-time applications in wide area networks.
J. Parallel Distrib. Comput. 67(5): 516-530 (2007) |
| 138 | EE | Tien-Ching Lin,
D. T. Lee:
Randomized algorithm for the sum selection problem.
Theor. Comput. Sci. 377(1-3): 151-156 (2007) |
| 2006 |
|---|
| 137 | | Danny Z. Chen,
D. T. Lee:
Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
Springer 2006 |
| 136 | EE | Tien-Ching Lin,
D. T. Lee:
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem.
ISAAC 2006: 460-473 |
| 135 | EE | 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 |
| 134 | EE | Jyh-Da Wei,
D. T. Lee:
Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem.
SEAL 2006: 424-432 |
| 133 | EE | 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.
Symposium on Computational Geometry 2006: 479-480 |
| 132 | EE | 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 Bioinformatics 7: 103 (2006) |
| 131 | EE | Tzu-Lun Huang,
D. T. Lee:
An iterative distributed algorithm for multi-constraint multicast routing.
Computer Communications 29(17): 3647-3661 (2006) |
| 130 | EE | Jinn Ho,
Wen-Liang Hwang,
Henry Horn-Shing Lu,
D. T. Lee:
Gridding spot centers of smoothly distorted microarray images.
IEEE Transactions on Image Processing 15(2): 342-353 (2006) |
| 2005 |
|---|
| 129 | EE | 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 |
| 128 | EE | 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 |
| 127 | EE | Tien-Ching Lin,
D. T. Lee:
Randomized Algorithm for the Sum Selection Problem.
ISAAC 2005: 515-523 |
| 126 | EE | 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.
Computer Networks 48(5): 739-761 (2005) |
| 125 | EE | Tsung-Yi Ho,
Yao-Wen Chang,
Sao-Jie Chen,
D. T. Lee:
Crosstalk- and performance-driven multilevel full-chip routing.
IEEE Trans. on CAD of Integrated Circuits and Systems 24(6): 869-878 (2005) |
| 124 | EE | 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) |
| 123 | EE | 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) |
| 2004 |
|---|
| 122 | EE | 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 |
| 121 | EE | Yao-Wen Huang,
Chung-Hung Tsai,
D. T. Lee,
Sy-Yen Kuo:
Non-Detrimental Web Application Security Scanning.
ISSRE 2004: 219-230 |
| 120 | EE | D. T. Lee,
Joseph S. B. Mitchell:
A note from the editors-in-chief.
Int. J. Comput. Geometry Appl. 14(1-2): (2004) |
| 119 | EE | Evanthia Papadopoulou,
D. T. Lee:
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach.
Int. J. Comput. Geometry Appl. 14(6): 421-452 (2004) |
| 118 | EE | T. K. Yu,
D. T. Lee:
On the Crossing Distribution Problem in Two Regions.
J. Inf. Sci. Eng. 20(1): 1-25 (2004) |
| 2003 |
|---|
| 117 | EE | 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 |
| 116 | EE | D. T. Lee:
Chief Editor's Notice.
Int. J. Comput. Geometry Appl. 13(1): 1-2 (2003) |
| 115 | EE | D. T. Lee,
G. C. Lee,
Yao-Wen Huang:
Knowledge Management for Computational Problem Solving.
J. UCS 9(6): 563-570 (2003) |
| 2002 |
|---|
| 114 | EE | Evanthia Papadopoulou,
D. T. Lee:
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.
ISAAC 2002: 511-522 |
| 113 | EE | Tzu-Lun Huang,
D. T. Lee:
A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks.
ISPAN 2002: 335-340 |
| 2001 |
|---|
| 112 | | Swee M. Mok,
Chi-haur Wu,
D. T. Lee:
Modeling automatic assembly and disassembly operations for virtual manufacturing.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(3): 223-232 (2001) |
| 111 | | Kiyoko F. Aoki,
D. T. Lee:
Towards Web-Based Computing.
Int. J. Comput. Geometry Appl. 11(1): 71-104 (2001) |
| 110 | | Evanthia Papadopoulou,
D. T. Lee:
The Linfty-Voronoi Diagram of Segments and VLSI Applications.
Int. J. Comput. Geometry Appl. 11(5): 503-528 (2001) |
| 2000 |
|---|
| 109 | | D. T. Lee,
Shang-Hua Teng:
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings
Springer 2000 |
| 108 | EE | Kiyoko F. Aoki,
D. T. Lee:
A Web-Based Distributed Programming Environment.
HPCN Europe 2000: 237-246 |
| 107 | | Swee M. Mok,
Chi-haur Wu,
D. T. Lee:
A System for Analyzing Automatic Assembly and Disassembly Operations.
ICRA 2000: 3695-3700 |
| 106 | EE | 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) |
| 105 | EE | Hsiao-Feng Steven Chen,
D. T. Lee:
A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion.
Algorithmica 28(4): 390-421 (2000) |
| 104 | EE | K. Roy,
D. T. Lee:
Guest editorial: low-power electronics and design.
IEEE Trans. VLSI Syst. 8(3): 233-234 (2000) |
| 1999 |
|---|
| 103 | | 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
Springer 1999 |
| 102 | | Shih-Lang Chang,
Chi-haur Wu,
D. T. Lee:
A Muscular-Like Compliance Control for Active Vehicle Suspension.
ICRA 1999: 3275- |
| 101 | EE | 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) |
| 100 | EE | Evanthia Papadopoulou,
D. T. Lee:
Critical area computation via Voronoi diagrams.
IEEE Trans. on CAD of Integrated Circuits and Systems 18(4): 463-474 (1999) |
| 99 | | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Evanthia Papadopoulou:
Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl. 9(3): 235- (1999) |
| 1998 |
|---|
| 98 | EE | Evanthia Papadopoulou,
D. T. Lee:
Critical area computation - a new approach.
ISPD 1998: 89-94 |
| 97 | | 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) |
| 96 | EE | Hsiao-Feng Steven Chen,
D. T. Lee:
On crossing minimization problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(5): 406-418 (1998) |
| 95 | | L. H. Tseng,
Paul J. Heffernan,
D. T. Lee:
Two-Guard Walkability of Simple Polygons.
Int. J. Comput. Geometry Appl. 8(1): 85-116 (1998) |
| 94 | | D. T. Lee,
Chin-Fang Shen,
Dennis S. Sheu:
Geosheet: A Distributed Visualization Tool for Geometric Algorithms.
Int. J. Comput. Geometry Appl. 8(2): 119-156 (1998) |
| 93 | EE | 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) |
| 1997 |
|---|
| 92 | | Tao Jiang,
D. T. Lee:
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings
Springer 1997 |
| 91 | | Hsiao-Feng Steven Chen,
D. T. Lee:
A Faster One-Dimensional Topological Compaction Algorithm.
ISAAC 1997: 303-313 |
| 90 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Asish Mukhopadhyay,
Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances.
Symposium on Computational Geometry 1997: 418-420 |
| 89 | | D. T. Lee:
Computational Geometry.
The Computer Science and Engineering Handbook 1997: 111-140 |
| 88 | | Kuo-Hui Tsai,
D. T. Lee:
k Best Cuts for Circular-Arc Graphs.
Algorithmica 18(2): 198-216 (1997) |
| 87 | | C. D. 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) |
| 86 | | D. T. Lee,
C. D. Yang,
C. K. Wong:
Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model.
Int. J. Comput. Geometry Appl. 7(6): 581-598 (1997) |
| 1996 |
|---|
| 85 | | Tsan-sheng Hsu,
Kuo-Hui Tsai,
Da-Wei Wang,
D. T. Lee:
Steiner Problems on Directed Acyclic Graphs.
COCOON 1996: 21-30 |
| 84 | | D. T. Lee,
C. F. Shen:
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane.
ISAAC 1996: 247-255 |
| 83 | | D. T. Lee:
Geometric Algorithm Visualization, Current Status and Future.
WACG 1996: 45-50 |
| 82 | | D. T. Lee:
Computational Geometry.
ACM Comput. Surv. 28(1): 27-31 (1996) |
| 81 | EE | D. T. Lee,
Chung-Do Yang,
C. K. Wong:
Rectilinear Paths Among Rectilinear Obstacles.
Discrete Applied Mathematics 70(3): 185-215 (1996) |
| 80 | EE | Hsiao-Feng Steven Chen,
D. T. Lee:
A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(2): 217-227 (1996) |
| 1995 |
|---|
| 79 | | Evanthia Papadopoulou,
D. T. Lee:
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract).
ESA 1995: 238-251 |
| 78 | EE | Marilyn G. Andrews,
Mikhail J. Atallah,
Danny Z. Chen,
D. T. Lee:
Parallel algorithms for maximum matching in interval graphs.
IPPS 1995: 84-92 |
| 77 | | D. T. Lee,
Chin-Fang Shen,
Cheng-Liang Ding:
On Steiner Tree Problem with 45 Degree Routing.
ISCAS 1995: 1680-1682 |
| 76 | | Pedro Jussieu de Rezende,
D. T. Lee:
Point Set Pattern Matching in d-Dimensions.
Algorithmica 13(4): 387-404 (1995) |
| 75 | | 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) |
| 74 | | Marilyn G. Andrews,
D. T. Lee:
Parallel Algorithms on Circular-arc Graphs.
Comput. Geom. 5: 117-141 (1995) |
| 73 | | Kurt Swanson,
D. T. Lee,
Vanban L. Wu:
An Optimal Algorithm for Roundness Determination on Convex Polygons.
Comput. Geom. 5: 225-235 (1995) |
| 72 | EE | 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) |
| 71 | | 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 |
|---|
| 70 | | Evanthia Papadopoulou,
D. T. Lee:
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices.
CCCG 1994: 110-115 |
| 69 | | Danny Z. Chen,
D. T. Lee:
Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs.
IPPS 1994: 224-228 |
| 68 | | Kuo-Hui Tsai,
D. T. Lee:
k-Best Cuts for Circular-Arc Graphs.
ISAAC 1994: 550-558 |
| 67 | | 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) |
| 66 | | Majid Sarrafzadeh,
D. T. Lee:
Restricted track assignment with applications.
Int. J. Comput. Geometry Appl. 4(1): 53-68 (1994) |
| 1993 |
|---|
| 65 | | 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 |
| 64 | | Muhammad H. Alsuwaiyel,
D. T. Lee:
Minimal Link Visibility Paths Inside a Simple Polygon.
Comput. Geom. 3: 1-25 (1993) |
| 63 | | D. T. Lee,
Evanthia Papadopoulou:
The All-Pairs Quickest Path Problem.
Inf. Process. Lett. 45(5): 261-267 (1993) |
| 62 | | D. T. Lee,
Majid Sarrafzadeh:
Maximum independent set of a permutation graph in K tracks.
Int. J. Comput. Geometry Appl. 3(3): 291-304 (1993) |
| 1992 |
|---|
| 61 | | Majid Sarrafzadeh,
D. T. Lee:
Rstricted Track Assignment with Applications.
ISAAC 1992: 449-458 |
| 60 | | D. T. Lee:
Rectilinear Paths among Rectilinear Obstacles.
ISAAC 1992: 5-20 |
| 59 | | C. D. Yang,
D. T. Lee,
C. K. Wong:
On bends and lengths of rectilinear paths: a graph theoretic approach.
Int. J. Comput. Geometry Appl. 2(1): 61-74 (1992) |
| 58 | | Ruey-Der Lou,
Majid Sarrafzadeh,
D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem.
SIAM J. Discrete Math. 5(2): 285-304 (1992) |
| 1991 |
|---|
| 57 | | D. T. Lee,
Majid Sarrafzadeh:
Maximum Independent Set of a Permutation Graph in k Tracks.
ISA 1991: 2-11 |
| 56 | | C. D. Yang,
D. T. Lee,
C. K. Wong:
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.
WADS 1991: 320-330 |
| 55 | | Majid Sarrafzadeh,
D. T. Lee:
Topological Via Minimization Revisited.
IEEE Trans. Computers 40(11): 1307-1312 (1991) |
| 54 | EE | Van-Ban Le,
D. T. Lee:
Out-of-Roundness Problem Revisited.
IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 217-223 (1991) |
| 53 | | D. T. Lee,
C. D. Yang,
T. H. Chen:
Shortest rectilinear paths among weighted obstacles.
Int. J. Comput. Geometry Appl. 1(2): 109-124 (1991) |
| 52 | | 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) |
| 1990 |
|---|
| 51 | | John C. C. Hsueh,
D. T. Lee:
Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System.
SEKE 1990: 110-115 |
| 50 | | Ruey-Der Lou,
Majid Sarrafzadeh,
D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem.
SODA 1990: 149-158 |
| 49 | EE | D. T. Lee,
T. H. Chen,
Chung-Do Yang:
Shortest Rectilinear Paths among Weighted Obstacles.
Symposium on Computational Geometry 1990: 301-310 |
| 48 | | C. S. Jeong,
D. T. Lee:
Parallel Geometric Algorithms on a Mesh-Connected Computer.
Algorithmica 5(2): 155-177 (1990) |
| 47 | | D. T. Lee,
Majid Sarrafzadeh,
Ying-Fung Wu:
Minimum Cuts for Circular-Arc Graphs.
SIAM J. Comput. 19(6): 1041-1050 (1990) |
| 1989 |
|---|
| 46 | EE | Jan-Ming Ho,
D. T. Lee:
Bounded Diameter Minimum Spanning Trees and Related Problems.
Symposium on Computational Geometry 1989: 276-282 |
| 45 | | Pedro Jussieu de Rezende,
D. T. Lee,
Ying-Fung Wu:
Rectilinear Shortest Paths in the presence of Rectangular Barriers.
Discrete & Computational Geometry 4: 41-53 (1989) |
| 44 | EE | Majid Sarrafzadeh,
D. T. Lee:
A new approach to topological via minimization.
IEEE Trans. on CAD of Integrated Circuits and Systems 8(8): 890-900 (1989) |
| 43 | | D. T. Lee,
Franco P. Preparata:
Parallel Batched Planar Point Location on the CCC.
Inf. Process. Lett. 33(4): 175-179 (1989) |
| 42 | | 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) |
| 1987 |
|---|
| 41 | EE | 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 |
|---|
| 40 | | D. T. Lee:
Geometric Location Problems and Their Complexity.
MFCS 1986: 154-167 |
| 39 | | C. C. Lee,
D. T. Lee,
C. K. Wong:
Generating Binary Trees of Bounded Height.
Acta Inf. 23(5): 529-544 (1986) |
| 38 | | D. T. Lee,
Ying-Fung Wu:
Complexity of Some Laction Problems.
Algorithmica 1(2): 193-211 (1986) |
| 37 | | D. T. Lee,
A. K. Lin:
Generalized Dalaunay Triangualtion for Planar Graphs.
Discrete & Computational Geometry 1: 201-217 (1986) |
| 36 | | D. T. Lee,
Arthur K. Lin:
Computational complexity of art gallery problems.
IEEE Transactions on Information Theory 32(2): 276-282 (1986) |
| 35 | | Bernard Chazelle,
Robert L. (Scot) Drysdale III,
D. T. Lee:
Computing the Largest Empty Rectangle.
SIAM J. Comput. 15(1): 300-315 (1986) |
| 1985 |
|---|
| 34 | | Bernard Chazelle,
Leonidas J. Guibas,
D. T. Lee:
The Power of Geometric Duality.
BIT 25(1): 76-90 (1985) |
| 33 | | D. T. Lee,
Y. T. Ching:
The Power of Geometric Duality Revisited.
Inf. Process. Lett. 21(3): 117-122 (1985) |
| 32 | EE | C. C. Lee,
D. T. Lee:
A Simple On-Line Bin-Packing Algorithm
J. ACM 32(3): 562-572 (1985) |
| 31 | EE | Y. T. Ching,
D. T. Lee:
Finding the diameter of a set of lines.
Pattern Recognition 18(3-4): 249-255 (1985) |
| 30 | EE | D. T. Lee:
Relative neighborhood graphs in the Li-metric.
Pattern Recognition 18(5): 327-332 (1985) |
| 1984 |
|---|
| 29 | | Bernard Chazelle,
Robert L. (Scot) Drysdale III,
D. T. Lee:
Computing the Largest Empty Rectangle.
STACS 1984: 43-54 |
| 28 | | D. Y. Yeh,
D. T. Lee:
Graph Algorithms on a Tree-Structured Parallel Computer.
BIT 24(3): 333-340 (1984) |
| 27 | | D. T. Lee,
Joseph Y.-T. Leung:
On the 2-Dimensional Channel Assignment Problem.
IEEE Trans. Computers 33(1): 2-6 (1984) |
| 26 | | D. T. Lee,
Franco P. Preparata:
Computational Geometry - A Survey.
IEEE Trans. Computers 33(12): 1072-1101 (1984) |
| 25 | | C. C. Lee,
D. T. Lee:
On a Circle-Cover Minimization Problem.
Inf. Process. Lett. 18(2): 109-115 (1984) |
| 1983 |
|---|
| 24 | | Bernard Chazelle,
Leonidas J. Guibas,
D. T. Lee:
The Power of Geometric Duality
FOCS 1983: 217-225 |
| 23 | | 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) |
| 22 | EE | D. T. Lee:
Visibility of a simple polygon.
Computer Vision, Graphics, and Image Processing 22(2): 207-221 (1983) |
| 21 | | I. G. Gowda,
David G. Kirkpatrick,
D. T. Lee,
Amnon Naamad:
Dynamic Voronoi diagrams.
IEEE Transactions on Information Theory 29(5): 724-730 (1983) |
| 20 | | U. I. Gupta,
D. T. Lee,
C. K. Wong:
Ranking and Unranking of B-Trees.
J. Algorithms 4(1): 51-60 (1983) |
| 19 | | 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) |
| 1982 |
|---|
| 18 | | D. T. Lee,
Charles B. Silio Jr.:
An Optimal Illumination Region Algorithm for Convex Polygons.
IEEE Trans. Computers 31(12): 1225-1227 (1982) |
| 17 | | D. T. Lee,
Franco P. Preparata:
An Improved Algorithm for the Rectangle Enclosure Problem.
J. Algorithms 3(3): 218-224 (1982) |
| 16 | | Udai Gupta,
D. T. Lee,
C. K. Wong:
Ranking and Unranking of 2-3 Trees.
SIAM J. Comput. 11(3): 582-590 (1982) |
| 1981 |
|---|
| 15 | | D. T. Lee,
Hsu Chang,
C. K. Wong:
An On-Chip Compare/Steer Bubble Sorter.
IEEE Trans. Computers 30(6): 396-405 (1981) |
| 14 | | D. T. Lee,
C. K. Wong:
Finding Intersection of Rectangles by Range Search.
J. Algorithms 2(4): 337-347 (1981) |
| 13 | | D. T. Lee,
Robert L. (Scot) Drysdale III:
Generalization of Voronoi Diagrams in the Plane.
SIAM J. Comput. 10(1): 73-87 (1981) |
| 12 | | U. 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 |
|---|
| 11 | EE | D. T. Lee,
C. K. Wong:
Quintary Trees: A File Structure for Multidimensional Database Systems.
ACM Trans. Database Syst. 5(3): 339-353 (1980) |
| 10 | EE | D. T. Lee:
Two-Dimensional Voronoi Diagrams in the Lp-Metric.
J. ACM 27(4): 604-618 (1980) |
| 9 | | D. T. Lee,
C. K. Wong:
Voronoi Diagrams in L_1 (L_infty) Metrics with 2-Dimensional Storage Applications.
SIAM J. Comput. 9(1): 200-211 (1980) |
| 1979 |
|---|
| 8 | | U. 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) |
| 7 | | 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) |
| 6 | | D. T. Lee,
C. C. Yang:
Location of Multiple Points in a Planar Subdivision.
Inf. Process. Lett. 9(4): 190-193 (1979) |
| 5 | EE | D. T. Lee,
Franco P. Preparata:
An Optimal Algorithm for Finding the Kernel of a Polygon.
J. ACM 26(3): 415-421 (1979) |
| 1978 |
|---|
| 4 | | D. T. Lee,
Franco P. Preparata:
The All Nearest-Neighbor Problem for Convex Polygons.
Inf. Process. Lett. 7(4): 189-192 (1978) |
| 1977 |
|---|
| 3 | | 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 Inf. 9: 23-29 (1977) |
| 2 | | 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 |
|---|
| 1 | | D. T. Lee,
Franco P. Preparata:
Location of a Point in a Planar Subdivision and its Applications
STOC 1976: 231-235 |
