The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
D. T. Lee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  137. Broadcasting in Heterogeneous Tree Networks. [Citation Graph (, )][DBLP]


  138. Rectilinear shortest paths with rectangular barriers. [Citation Graph (, )][DBLP]


  139. Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching. [Citation Graph (, )][DBLP]


  140. Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. [Citation Graph (, )][DBLP]


  141. Scene Location Guide by Image-Based Retrieval. [Citation Graph (, )][DBLP]


  142. Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System. [Citation Graph (, )][DBLP]


  143. Fast Algorithms for the Density Finding Problem. [Citation Graph (, )][DBLP]


  144. Guest Editors' Forward. [Citation Graph (, )][DBLP]


  145. GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events. [Citation Graph (, )][DBLP]


  146. Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences. [Citation Graph (, )][DBLP]


  147. Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online). [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.787secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002