D. T. Lee - RankMe

235 papers A* 14A 10B 26C 5Misc 9Journal 140Unranked 27

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Finding maximum sum segments in sequences with uncertainty. Theor. Comput. Sci. Hung-I Yu, Tien-Ching Lin, D. T. Lee
2019	J	`jnl`	O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. Algorithmica Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2019	J	`jnl`	Tight approximation for partial vertex cover with hard capacities. Theor. Comput. Sci. Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee
2018	A	`conf`	An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. ICS Hai-Lun Tu, Mong-Jen Kao, D. T. Lee
2018	J	`jnl`	The (1\|1)-Centroid Problem in the Plane with Distance Constraints. Int. J. Comput. Geom. Appl. Hung-I Yu, Tien-Ching Lin, D. T. Lee
2018	A	`conf`	The Multi-service Location Problems. ICS Hung-I Yu, Mong-Jen Kao, D. T. Lee
2018	J	`jnl`	The multi-service center problem. Theor. Comput. Sci. Hung-I Yu, Cheng-Chung Li, D. T. Lee
2017	—	`conf`	CloudEC: A MapReduce-based algorithm for correcting errors in next-generation sequencing big data. IEEE BigData Wei-Chun Chung, Jan-Ming Ho, Chung-Yen Lin, D. T. Lee
2017	B	`conf`	Tight Approximation for Partial Vertex Cover with Hard Capacities. ISAAC Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee
2016	B	`conf`	A feature fusion framework for hashing. ICPR I-Hong Jhuo, Li Weng, Wen-Huang Cheng, D. T. Lee
2016	J	`jnl`	Broadcasting in weighted trees under the postal model. Theor. Comput. Sci. Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee
2016	B	`conf`	O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. ISAAC Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2016	J	`jnl`	O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. CoRR Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2016	J	`jnl`	Optimal time-convex hull for a straight-line highway in L Comput. Geom. Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2016	J	`jnl`	The (1\|1) CoRR Hung-I Yu, Tien-Ching Lin, D. T. Lee
2015	J	`jnl`	Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica Mong-Jen Kao, Han-Lin Chen, D. T. Lee
2015	J	`jnl`	Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2014	J	`jnl`	Algorithms and Computation (ISAAC 2012). Theor. Comput. Sci. Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee
2014	A*	`conf`	An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips. DAC Chun-Xun Lin, Chih-Hung Liu, I-Che Chen, D. T. Lee, Tsung-Yi Ho
2014	J	`jnl`	Discovering joint audio-visual codewords for video event detection. Mach. Vis. Appl. I-Hong Jhuo, Guangnan Ye, Shenghua Gao, Dong Liu, Yu-Gang Jiang, D. T. Lee, Shih-Fu Chang
2014	J	`jnl`	Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Chih-Hung Liu, Chun-Xun Lin, I-Che Chen, D. T. Lee, Ting-Chi Wang
2014	A	`conf`	Online Dynamic Power Management with Hard Real-Time Guarantees. STACS Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2014	J	`jnl`	Preface Algorithms and Computation (ISAAC 2012). Algorithmica Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee
2014	—	`conf`	Unsupervised Feature Learning for RGB-D Image Classification. ACCV (1) I-Hong Jhuo, Shenghua Gao, Liansheng Zhuang, D. T. Lee, Yi Ma
2014	—	`conf`	Using geometric structures to improve the error correction algorithm of high-throughput sequencing data on MapReduce framework. IEEE BigData Wei-Chun Chung, Yu-Jung Chang, D. T. Lee, Jan-Ming Ho
2014	B	`conf`	Video Event Detection via Multi-modality Deep Learning. ICPR I-Hong Jhuo, D. T. Lee
2013	A*	`conf`	Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. SODA Chih-Hung Liu, D. T. Lee
2013	J	`jnl`	Online Power-Managing Strategy with Hard Real-Time Guarantees CoRR Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013	B	`conf`	Optimal Time-Convex Hull under the L p Metrics. WADS Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2013	J	`jnl`	Optimal Time-Convex Hull under the Lp Metrics CoRR Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2013	J	`jnl`	Power Domination in Circular-Arc Graphs. Algorithmica Chung-Shou Liao, D. T. Lee
2013	J	`jnl`	The density maximization problem in graphs. J. Comb. Optim. Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2012	A*	`conf`	An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction. DAC Chih-Hung Liu, I-Che Chen, D. T. Lee
2012	J	`jnl`	Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geom. Appl. Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu
2012	J	`jnl`	Higher Order City Voronoi Diagrams CoRR Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
2012	—	`conf`	Higher Order City Voronoi Diagrams. SWAT Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
2012	B	`conf`	Joint audio-visual bi-modal codewords for video event detection. ICMR Guangnan Ye, I-Hong Jhuo, Dong Liu, Yu-Gang Jiang, D. T. Lee, Shih-Fu Chang
2012	J	`jnl`	Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Chih-Hung Liu, Sy-Yen Kuo, D. T. Lee, Chun-Syun Lin, Jung-Hung Weng, Shih-Yi Yuan
2012	—	`conf`	Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices. AINA Workshops Tsai-Yeh Tung, Laurent Lin, D. T. Lee
2012	A*	`conf`	Robust visual domain adaptation with low-rank reconstruction. CVPR I-Hong Jhuo, Dong Liu, D. T. Lee, Shih-Fu Chang
2011	A	`conf`	An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee
2011	J	`jnl`	Capacitated Domination Problem. Algorithmica Mong-Jen Kao, Chung-Shou Liao, D. T. Lee
2011	J	`jnl`	Capacitated Domination: Constant Factor Approximation for Planar Graphs CoRR Mong-Jen Kao, D. T. Lee
2011	B	`conf`	Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC Mong-Jen Kao, D. T. Lee
2011	—	`conf`	Connecting Two Trees with Optimal Routing Cost. CCCG Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
2011	B	`conf`	Finding Maximum Sum Segments in Sequences with Uncertainty. ISAAC Hung-I Yu, Tien-Ching Lin, D. T. Lee
2011	A*	`conf`	Multiple-Instance Learning: Multiple Feature Selection on Instance Representation. AAAI I-Hong Jhuo, D. T. Lee
2011	Misc	`conf`	The Density Maximization Problem in Graphs. COCOON Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2010	B	`conf`	Boosted Multiple Kernel Learning for Scene Category Recognition. ICPR I-Hong Jhuo, D. T. Lee
2010	A*	`conf`	Boosting-based multiple kernel learning for image re-ranking. ACM Multimedia I-Hong Jhuo, D. T. Lee
2010	Misc	`conf`	Broadcasting in Heterogeneous Tree Networks. COCOON Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee
2010	J	`jnl`	Efficient algorithms for the sum selection problem and k maximum sums problem. Theor. Comput. Sci. Tien-Ching Lin, D. T. Lee
2010	C	`conf`	Multi-party k-Means Clustering with Privacy Consideration. ISPA Teng-Kai Yu, D. T. Lee, Shih-Ming Chang, Justin Zhan
2010	B	`conf`	Scene Location Guide by Image-Based Retrieval. MMM I-Hong Jhuo, Tsuhan Chen, D. T. Lee
2010	—	`conf`	Spanning Ratio and Maximum Detour of Rectilinear Paths in the ISAAC (2) Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon
2009	J	`jnl`	Editors' Foreword. Int. J. Comput. Geom. Appl. Danny Z. Chen, D. T. Lee
2009	J	`jnl`	Fast Algorithms for the Density Finding Problem. Algorithmica D. T. Lee, Tien-Ching Lin, Hsueh-I Lu
2009	J	`jnl`	GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events. Bioinform. Te-Chin Chu, Tsunglin Liu, D. T. Lee, Greg C. Lee, Arthur Chun-Chieh Shih
2009	B	`conf`	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. ISAAC Dae-Young Seo, D. T. Lee, Tien-Ching Lin
2009	J	`jnl`	Guest Editors' Forward. Algorithmica Danny Z. Chen, D. T. Lee
2009	—	`conf`	Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System. CSIE (7) Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee
2009	B	`conf`	Optimal Randomized Algorithm for the Density Selection Problem. ISAAC Tien-Ching Lin, D. T. Lee
2007	Misc	`conf`	A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal. IRI Jyh-Da Wei, Tai-Yu Chen, Tsai-Yeh Tung, D. T. Lee
2007	J	`jnl`	A distributed multicast routing algorithm for real-time applications in wide area networks. J. Parallel Distributed Comput. Tzu-Lun Huang, D. T. Lee
2007	J	`jnl`	Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online). BMC Bioinform. 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
2007	Misc	`conf`	Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching. IKE Jyh-Da Wei, Tsai-Yeh Tung, Tai-Yu Chen, D. T. Lee
2007	Misc	`conf`	Maximizing the Number of Independent Labels in the Plane. FAW Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee
2007	J	`jnl`	Randomized algorithm for the sum selection problem. Theor. Comput. Sci. Tien-Ching Lin, D. T. Lee
2007	—	`conf`	Time Convex Hull with a Highway. ISVD Teng-Kai Yu, D. T. Lee
2006	—	`conf`	A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects. SCG Ming-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee
2006	J	`jnl`	An iterative distributed algorithm for multi-constraint multicast routing. Comput. Commun. Tzu-Lun Huang, D. T. Lee
2006	Misc	`ed.`	Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings COCOON Danny Z. Chen, D. T. Lee
2006	B	`conf`	Design and applications of an algorithm benchmark system in a computational problem solving environment. ITiCSE Ming-Yu Chen, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee
2006	B	`conf`	Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ISAAC Tien-Ching Lin, D. T. Lee
2006	J	`jnl`	Gridding spot centers of smoothly distorted microarray images. IEEE Trans. Image Process. Jinn Ho, Wen-Liang Hwang, Henry Horng-Shing Lu, D. T. Lee
2006	—	`conf`	Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. SEAL Jyh-Da Wei, D. T. Lee
2006	J	`jnl`	SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools. BMC Bioinform. 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
2005	J	`jnl`	A testing framework for Web application security assessment. Comput. Networks Yao-Wen Huang, Chung-Hung Tsai, Tsung-Po Lin, Shih-Kun Huang, D. T. Lee, Sy-Yen Kuo
2005	J	`jnl`	Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks". IEEE/ACM Trans. Netw. Tzu-Lun Huang, D. T. Lee
2005	J	`jnl`	Crosstalk- and performance-driven multilevel full-chip routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee
2005	—	`conf`	Efficient Exact Spare Allocation via Boolean Satisfiability. DFT Fang Yu, Chung-Hung Tsai, Yao-Wen Huang, D. T. Lee, Hung-Yau Lin, Sy-Yen Kuo
2005	—	`conf`	Gridding the spot centers of microarray images. EUSIPCO Jinn Ho, Wen-Liang Hwang, Henry Horng-Shing Lu, D. T. Lee
2005	J	`jnl`	Labeling Points on a Single Line. Int. J. Comput. Geom. Appl. Yu-Shin Chen, D. T. Lee, Chung-Shou Liao
2005	B	`conf`	Randomized Algorithm for the Sum Selection Problem. ISAAC Tien-Ching Lin, D. T. Lee
2005	—	`conf`	SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results. CSB Workshops Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Chin-Lin Peng, Shiang-Heng Chen, Chun-Yi Wong, Meng-Yuan Chou, Tze-Chang Shiao
2005	J	`jnl`	Two Variations of the Minimum Steiner Problem. J. Comb. Optim. Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee
2004	B	`conf`	A new approach to the traveling salesman problem using genetic algorithms with priority encoding. IEEE Congress on Evolutionary Computation Jyh-Da Wei, D. T. Lee
2004	J	`jnl`	A note from the editors-in-chief. Int. J. Comput. Geom. Appl. D. T. Lee, Joseph S. B. Mitchell
2004	C	`conf`	An adaptive PID-type iterative learning controller unknown nonlinear systems. ICARCV Ying-Chung Wang, Chiang-Ju Chien, D. T. Lee
2004	—	`ch.`	Interval, Segment, Range, and Priority Search Trees. Handbook of Data Structures and Applications D. T. Lee
2004	A	`conf`	Non-Detrimental Web Application Security Scanning. ISSRE Yao-Wen Huang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo
2004	J	`jnl`	On the Crossing Distribution Problem in Two Regions. J. Inf. Sci. Eng. T. K. Yu, D. T. Lee
2004	J	`jnl`	The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, D. T. Lee
2004	J	`jnl`	Travel-time prediction with support vector regression. IEEE Trans. Intell. Transp. Syst. Chun-Hsin Wu, Jan-Ming Ho, D. T. Lee
2004	A	`conf`	Verifying Web Applications Using Bounded Model Checking. DSN Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo
2003	A	`conf`	A Fast Crosstalk- and Performance-Driven Multilevel Routing System. ICCAD Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee
2003	J	`jnl`	Chief Editor's Notice. Int. J. Comput. Geom. Appl. D. T. Lee
2003	J	`jnl`	Knowledge Management for Computational Problem Solving. J. Univers. Comput. Sci. D. T. Lee, Gen-Cher Lee, Yao-Wen Huang
2002	—	`conf`	A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks. ISPAN Tzu-Lun Huang, D. T. Lee
2002	C	`conf`	Finding battery locations of electrical motorcycles for better perception of riding comfort. ACC Hsien-Chung Lai, Jing-Sin Liu, D. T. Lee, Li-Sheng Wang
2002	B	`conf`	The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC Evanthia Papadopoulou, D. T. Lee
2001	J	`jnl`	Modeling automatic assembly and disassembly operations for virtual manufacturing. IEEE Trans. Syst. Man Cybern. Part A Swee M. Mok, Chi-haur Wu, D. T. Lee
2001	J	`jnl`	The L Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, D. T. Lee
2001	J	`jnl`	Towards Web-Based Computing. Int. J. Comput. Geom. Appl. Kiyoko F. Aoki, D. T. Lee
2000	J	`jnl`	A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion. Algorithmica Hsiao-Feng Steven Chen, D. T. Lee
2000	A*	`conf`	A System for Analyzing Automatic Assembly and Disassembly Operations. ICRA Swee M. Mok, Chi-haur Wu, D. T. Lee
2000	—	`conf`	A Web-Based Distributed Programming Environment. HPCN Europe Kiyoko F. Aoki, D. T. Lee
2000	B	`ed.`	Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings ISAAC D. T. Lee, Shang-Hua Teng
2000	J	`jnl`	Guest editorial: low-power electronics and design. IEEE Trans. Very Large Scale Integr. Syst. Kaushik Roy, D. T. Lee
2000	J	`jnl`	Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
1999	A*	`conf`	A Muscular-Like Compliance Control for Active Vehicle Suspension. ICRA Shih-Lang Chang, Chi-haur Wu, D. T. Lee
1999	—	`conf`	A hierarchical workcell model for intelligent assembly and disassembly. CIRA Swee M. Mok, Chi-haur Wu, D. T. Lee
1999	Misc	`ed.`	Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings COCOON Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama
1999	J	`jnl`	Critical area computation via Voronoi diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Evanthia Papadopoulou, D. T. Lee
1999	J	`jnl`	Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
1999	J	`jnl`	Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. Algorithmica Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh
1998	J	`jnl`	A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica Evanthia Papadopoulou, D. T. Lee
1998	—	`conf`	Critical area computation - a new approach. ISPD Evanthia Papadopoulou, D. T. Lee
1998	J	`jnl`	Geosheet: A Distributed Visualization Tool for Geometric Algorithms. Int. J. Comput. Geom. Appl. D. T. Lee, Chin-Fang Shen, Dennis S. Sheu
1998	J	`jnl`	On crossing minimization problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Hsiao-Feng Steven Chen, D. T. Lee
1998	J	`jnl`	Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan
1998	J	`jnl`	Two-Guard Walkability of Simple Polygons. Int. J. Comput. Geom. Appl. L. H. Tseng, Paul J. Heffernan, D. T. Lee
1997	B	`conf`	A Faster One-Dimensional Topological Compaction Algorithm. ISAAC Hsiao-Feng Steven Chen, D. T. Lee
1997	—	`ch.`	Computational Geometry. The Computer Science and Engineering Handbook D. T. Lee
1997	Misc	`ed.`	Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings COCOON Tao Jiang, D. T. Lee
1997	J	`jnl`	Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. Int. J. Comput. Geom. Appl. D. T. Lee, Chung-Do Yang, C. K. Wong
1997	J	`jnl`	The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon. IEEE Trans. Computers Chung-Do Yang, D. T. Lee, C. K. Wong
1997	—	`conf`	Voronoi Diagrams for Direction-Sensitive Distances. SCG Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
1997	J	`jnl`	k Best Cuts for Circular-Arc Graphs. Algorithmica Kuo-Hui Tsai, D. T. Lee
1996	J	`jnl`	A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Hsiao-Feng Steven Chen, D. T. Lee
1996	A*	`conf`	A study of neuromuscular-like control in rehabilitation robot. ICRA Chi-haur Wu, Shih-Lang Chang, D. T. Lee
1996	J	`jnl`	Computational Geometry. ACM Comput. Surv. D. T. Lee
1996	—	`conf`	Geometric Algorithm Visualization, Current Status and Future. WACG D. T. Lee
1996	J	`jnl`	Rectilinear Paths Among Rectilinear Obstacles. Discret. Appl. Math. D. T. Lee, Chung-Do Yang, C. K. Wong
1996	Misc	`conf`	Steiner Problems on Directed Acyclic Graphs. COCOON Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee
1996	B	`conf`	The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. ISAAC D. T. Lee, C. F. Shen
1995	J	`jnl`	An Optimal Algorithm for Roundness Determination on Convex Polygons. Comput. Geom. Kurt Swanson, D. T. Lee, Vanban L. Wu
1995	J	`jnl`	An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Algorithmica Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
1995	A	`conf`	Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA Evanthia Papadopoulou, D. T. Lee
1995	J	`jnl`	Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. Muhammad H. Alsuwaiyel, D. T. Lee
1995	C	`conf`	On Steiner Tree Problem with 45 Degree Routing. ISCAS D. T. Lee, Chin-Fang Shen, Cheng-Liang Ding
1995	J	`jnl`	Parallel Algorithms on Circular-arc Graphs. Comput. Geom. Marilyn G. Andrews, D. T. Lee
1995	—	`conf`	Parallel algorithms for maximum matching in interval graphs. IPPS Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
1995	J	`jnl`	Point Set Pattern Matching in d-Dimensions. Algorithmica Pedro Jussieu de Rezende, D. T. Lee
1995	J	`jnl`	Rectilinear Path Problems among Rectilinear Obstacles Revisited. SIAM J. Comput. Chung-Do Yang, D. T. Lee, C. K. Wong
1994	J	`jnl`	On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model. IEEE Trans. Computers D. T. Lee, Chung-Do Yang, C. K. Wong
1994	J	`jnl`	Restricted track assignment with applications. Int. J. Comput. Geom. Appl. Majid Sarrafzadeh, D. T. Lee
1994	—	`conf`	Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG Evanthia Papadopoulou, D. T. Lee
1994	—	`conf`	Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs. IPPS Danny Z. Chen, D. T. Lee
1994	B	`conf`	k-Best Cuts for Circular-Arc Graphs. ISAAC Kuo-Hui Tsai, D. T. Lee
1993	—	`book`	Algorithmic Aspects of VLSI Layout Majid Sarrafzadeh, D. T. Lee
1993	A	`conf`	An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. ESA Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
1993	J	`jnl`	Maximum independent set of a permutation graph in K tracks. Int. J. Comput. Geom. Appl. D. T. Lee, Majid Sarrafzadeh
1993	J	`jnl`	Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. Muhammad H. Alsuwaiyel, D. T. Lee
1993	J	`jnl`	The All-Pairs Quickest Path Problem. Inf. Process. Lett. D. T. Lee, Evanthia Papadopoulou
1992	J	`jnl`	1-Segment Center Problems. INFORMS J. Comput. Hiroshi Imai, D. T. Lee, Chung-Do Yang
1992	J	`jnl`	An Optimal Algorithm for the Maximum Two-Chain Problem. SIAM J. Discret. Math. Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee
1992	J	`jnl`	On bends and lengths of rectilinear paths: a graph theoretic approach. Int. J. Comput. Geom. Appl. Chung-Do Yang, D. T. Lee, C. K. Wong
1992	B	`conf`	Rectilinear Paths among Rectilinear Obstacles. ISAAC D. T. Lee
1992	B	`conf`	Rstricted Track Assignment with Applications. ISAAC Majid Sarrafzadeh, D. T. Lee
1991	—	`conf`	Maximum Independent Set of a Permutation Graph in ISA D. T. Lee, Majid Sarrafzadeh
1991	J	`jnl`	Minimum Diameter Spanning Trees and Related Problems. SIAM J. Comput. Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong
1991	B	`conf`	On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. WADS Chung-Do Yang, D. T. Lee, C. K. Wong
1991	J	`jnl`	Out-of-Roundness Problem Revisited. IEEE Trans. Pattern Anal. Mach. Intell. Van-Ban Le, D. T. Lee
1991	J	`jnl`	Shortest rectilinear paths among weighted obstacles. Int. J. Comput. Geom. Appl. D. T. Lee, Chung-Do Yang, T. H. Chen
1991	J	`jnl`	Topological Via Minimization Revisited. IEEE Trans. Computers Majid Sarrafzadeh, D. T. Lee
1990	A*	`conf`	An Optimal Algorithm for the Maximum Two-Chain Problem. SODA Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee
1990	—	`ch.`	Computational Complexity of Art Gallery Problems. Autonomous Robot Vehicles D. T. Lee, Arthur K. Lin
1990	C	`conf`	Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System. SEKE John C. C. Hsueh, D. T. Lee
1990	J	`jnl`	Minimum Cuts for Circular-Arc Graphs. SIAM J. Comput. D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu
1990	J	`jnl`	NSF report - computer and computation research. SIGACT News D. T. Lee
1990	J	`jnl`	NSF report - computer and computation research. SIGACT News D. T. Lee
1990	J	`jnl`	Parallel Geometric Algorithms on a Mesh-Connected Computer. Algorithmica C. S. Jeong, D. T. Lee
1990	J	`jnl`	Planar subset of multi-terminal nets. Integr. Kuo-Feng Liao, D. T. Lee, Majid Sarrafzadeh
1990	—	`conf`	Shortest Rectilinear Paths among Weighted Obstacles. SCG D. T. Lee, T. H. Chen, Chung-Do Yang
1989	J	`jnl`	A new approach to topological via minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Majid Sarrafzadeh, D. T. Lee
1989	—	`conf`	Bounded-Diameter Minimum Spanning Trees and Related Problems. SCG Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang
1989	J	`jnl`	NSF report - computer and computation research. SIGACT News D. T. Lee
1989	J	`jnl`	On-Line Bin Packing in Linear Time. J. Algorithms Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee
1989	J	`jnl`	Parallel Batched Planar Point Location on the CCC. Inf. Process. Lett. D. T. Lee, Franco P. Preparata
1989	J	`jnl`	Rectilinear Shortest Paths in the presence of Rectangular Barriers. Discret. Comput. Geom. Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu
1987	A*	`conf`	An efficient new algorithm for 2-D line clipping: Its development and analysis. SIGGRAPH Tina M. Nicholl, D. T. Lee, Robin A. Nicholl
1986	J	`jnl`	Computational complexity of art gallery problems. IEEE Trans. Inf. Theory D. T. Lee, Arthur K. Lin
1986	J	`jnl`	Computing the Largest Empty Rectangle. SIAM J. Comput. Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee
1986	J	`jnl`	Computing the visibility polygon from an edge. Comput. Vis. Graph. Image Process. D. T. Lee, Arthur K. Lin
1986	J	`jnl`	Generalized Dalaunay Triangualtion for Planar Graphs. Discret. Comput. Geom. D. T. Lee, A. K. Lin
1986	J	`jnl`	Generating Binary Trees of Bounded Height. Acta Informatica C. C. Lee, D. T. Lee, C. K. Wong
1986	J	`jnl`	Geometric Complexity of Some Loction Problems. Algorithmica D. T. Lee, Ying-Fung Wu
1986	B	`conf`	Geometric Location Problems and Their Complexity. MFCS D. T. Lee
1986	J	`jnl`	On a circle placement problem. Computing Bernard Marie Chazelle, D. T. Lee
1985	J	`jnl`	A Simple On-Line Bin-Packing Algorithm J. ACM C. C. Lee, D. T. Lee
1985	J	`jnl`	Finding the diameter of a set of lines. Pattern Recognit. Y. T. Ching, D. T. Lee
1985	—	`conf`	Rectilinear shortest paths with rectangular barriers. SCG Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu
1985	J	`jnl`	Relative neighborhood graphs in the L Pattern Recognit. D. T. Lee
1985	J	`jnl`	The Power of Geometric Duality Revisited. Inf. Process. Lett. D. T. Lee, Y. T. Ching
1985	J	`jnl`	The Power of Geometric Duality. BIT Bernard Chazelle, Leonidas J. Guibas, D. T. Lee
1984	J	`jnl`	An optimal time and minimal space algorithm for rectangle intersection problems. Int. J. Parallel Program. D. T. Lee
1984	J	`jnl`	Computational Geometry - A Survey. IEEE Trans. Computers D. T. Lee, Franco P. Preparata
1984	A	`conf`	Computing the Largest Empty Rectangle. STACS Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee
1984	J	`jnl`	Euclidean shortest paths in the presence of rectilinear barriers. Networks D. T. Lee, Franco P. Preparata
1984	J	`jnl`	Graph Algorithms on a Tree-Structured Parallel Computer. BIT Der-Yun Yeh, D. T. Lee
1984	J	`jnl`	On a Circle-Cover Minimization Problem. Inf. Process. Lett. C. C. Lee, D. T. Lee
1984	J	`jnl`	On the 2-Dimensional Channel Assignment Problem. IEEE Trans. Computers D. T. Lee, Joseph Y.-T. Leung
1984	J	`jnl`	On the maximum empty rectangle problem. Discret. Appl. Math. Amnon Naamad, D. T. Lee, Wen-Lian Hsu
1983	J	`jnl`	(g 0, g 1, ... g k)-Trees and Unary OL Systems. Theor. Comput. Sci. D. T. Lee, C. L. Liu, C. K. Wong
1983	J	`jnl`	Dynamic Voronoi diagrams. IEEE Trans. Inf. Theory I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad
1983	J	`jnl`	On finding the convex hull of a simple polygon. Int. J. Parallel Program. D. T. Lee
1983	J	`jnl`	On the X-Y Convex Hull of a Set of X-Y Polygons. BIT Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong
1983	J	`jnl`	Ranking and Unranking of B-Trees. J. Algorithms Udaiprakash I. Gupta, D. T. Lee, C. K. Wong
1983	A*	`conf`	The Power of Geometric Duality FOCS Bernard Chazelle, Leonidas J. Guibas, D. T. Lee
1983	J	`jnl`	Visibility of a simple polygon. Comput. Vis. Graph. Image Process. D. T. Lee
1982	J	`jnl`	An Improved Algorithm for the Rectangle Enclosure Problem. J. Algorithms D. T. Lee, Franco P. Preparata
1982	J	`jnl`	An Optimal Illumination Region Algorithm for Convex Polygons. IEEE Trans. Computers D. T. Lee, Charles B. Silio Jr.
1982	J	`jnl`	Efficient algorithms for interval graphs and circular-arc graphs. Networks Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung
1982	J	`jnl`	Medial Axis Transformation of a Planar Shape. IEEE Trans. Pattern Anal. Mach. Intell. D. T. Lee
1982	J	`jnl`	Ranking and Unranking of 2-3 Trees. SIAM J. Comput. Udai Gupta, D. T. Lee, C. K. Wong
1981	J	`jnl`	An O( Networks J. MacGregor Smith, D. T. Lee, Judith Liebman
1981	J	`jnl`	An On-Chip Compare/Steer Bubble Sorter. IEEE Trans. Computers D. T. Lee, Hsu Chang, C. K. Wong
1981	B	`conf`	Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. WG D. T. Lee, Franco P. Preparata
1981	J	`jnl`	Finding Intersection of Rectangles by Range Search. J. Algorithms D. T. Lee, C. K. Wong
1981	J	`jnl`	Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. D. T. Lee, Robert L. (Scot) Drysdale III
1981	J	`jnl`	Record Allocation for Minimizing Seek Delay. Theor. Comput. Sci. Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong
1981	A*	`conf`	Shading of regions on vector display devises. SIGGRAPH D. T. Lee
1980	J	`jnl`	Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. D. T. Lee, C. K. Wong
1980	J	`jnl`	Two algorithms for constructing a Delaunay triangulation. Int. J. Parallel Program. D. T. Lee, Bruce J. Schachter
1980	J	`jnl`	Two-Dimensional Voronoi Diagrams in the L J. ACM D. T. Lee
1980	J	`jnl`	Voronoi Diagrams in L SIAM J. Comput. D. T. Lee, C. K. Wong
1979	J	`jnl`	A Note on the all Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. C. C. Yang, D. T. Lee
1979	J	`jnl`	An Optimal Algorithm for Finding the Kernel of a Polygon. J. ACM D. T. Lee, Franco P. Preparata
1979	J	`jnl`	An Optimal Solution for the Channel-Assignment Problem. IEEE Trans. Computers Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung
1979	J	`jnl`	Location of Multiple Points in a Planar Subdivision. Inf. Process. Lett. D. T. Lee, C. C. Yang
1978	J	`jnl`	The All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. D. T. Lee, Franco P. Preparata
1977	J	`jnl`	Location of a Point in a Planar Subdivision and Its Applications. SIAM J. Comput. D. T. Lee, Franco P. Preparata
1977	J	`jnl`	Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Informatica D. T. Lee, C. K. Wong
1976	A*	`conf`	Location of a Point in a Planar Subdivision and its Applications STOC D. T. Lee, Franco P. Preparata