D. T. Lee

816 total citations
29 papers, 489 citations indexed

About

D. T. Lee is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, D. T. Lee has authored 29 papers receiving a total of 489 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 7 papers in Computational Theory and Mathematics and 5 papers in Electrical and Electronic Engineering. Recurrent topics in D. T. Lee's work include Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (5 papers) and Advanced Graph Theory Research (5 papers). D. T. Lee is often cited by papers focused on Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (5 papers) and Advanced Graph Theory Research (5 papers). D. T. Lee collaborates with scholars based in Taiwan, United States and Germany. D. T. Lee's co-authors include I‐Hong Jhuo, Shih-Fu Chang, Dong Liu, Evanthia Papadopoulou, Tsung-Yi Ho, Yao‐Wen Chang, Sao‐Jie Chen, Yao‐Wen Huang, Sy‐Yen Kuo and Chung-Hung Tsai and has published in prestigious journals such as PLoS ONE, IEEE/ACM Transactions on Networking and Computer Networks.

In The Last Decade

D. T. Lee

27 papers receiving 467 citations

Peers

D. T. Lee
Ilya Razenshteyn United States
D. T. Lee
Citations per year, relative to D. T. Lee D. T. Lee (= 1×) peers Ilya Razenshteyn

Countries citing papers authored by D. T. Lee

Since Specialization
Citations

This map shows the geographic impact of D. T. Lee's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by D. T. Lee with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. T. Lee more than expected).

Fields of papers citing papers by D. T. Lee

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. T. Lee. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by D. T. Lee. The network helps show where D. T. Lee may publish in the future.

Co-authorship network of co-authors of D. T. Lee

This figure shows the co-authorship network connecting the top 25 collaborators of D. T. Lee. A scholar is included among the top collaborators of D. T. Lee based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. T. Lee. D. T. Lee is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lee, D. T., et al.. (2019). Tight approximation for partial vertex cover with hard capacities. Theoretical Computer Science. 778. 61–72. 3 indexed citations
2.
Lee, D. T., et al.. (2018). O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. Algorithmica. 81(5). 1800–1817. 1 indexed citations
4.
Chao, Kun‐Mao, Tsan‐sheng Hsu, & D. T. Lee. (2014). Algorithms and Computation (ISAAC 2012). Theoretical Computer Science. 544. 1–2. 13 indexed citations
5.
Chen, Chien-Chih, Jan-Ming Ho, Chung‐Yen Lin, et al.. (2014). CloudDOE: A User-Friendly Tool for Deploying Hadoop Clouds and Analyzing High-Throughput Sequencing Data with MapReduce. PLoS ONE. 9(6). e98146–e98146. 16 indexed citations
6.
Jhuo, I‐Hong & D. T. Lee. (2014). Video Event Detection via Multi-modality Deep Learning. 12 indexed citations
8.
Chen, Hanlin, et al.. (2013). Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica. 72(1). 1–43. 10 indexed citations
9.
Liao, Chung-Shou & D. T. Lee. (2011). Power Domination in Circular-Arc Graphs. Algorithmica. 65(2). 443–466. 11 indexed citations
10.
Jhuo, I‐Hong & D. T. Lee. (2011). Multiple-Instance Learning: Multiple Feature Selection on Instance Representation. Proceedings of the AAAI Conference on Artificial Intelligence. 25(1). 1794–1795. 1 indexed citations
11.
Lee, D. T., et al.. (2006). An iterative distributed algorithm for multi-constraint multicast routing. Computer Communications. 29(17). 3647–3661. 5 indexed citations
12.
Lee, D. T., et al.. (2006). Design and applications of an algorithm benchmark system in a computational problem solving environment. ACM SIGCSE Bulletin. 38(3). 123–127. 7 indexed citations
13.
Hsu, Tsan‐sheng, et al.. (2005). Two Variations of the Minimum Steiner Problem. Journal of Combinatorial Optimization. 9(1). 101–120. 1 indexed citations
14.
Lee, D. T., et al.. (2005). Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area Networks". IEEE/ACM Transactions on Networking. 13(6). 1410–1411. 7 indexed citations
15.
Lee, D. T., et al.. (2005). Computer Security in the 21st Century. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 14 indexed citations
16.
Lee, D. T., et al.. (2004). On the Crossing Distribution Problem in Two Regions. Journal of information science and engineering. 20. 1–25. 1 indexed citations
17.
Papadopoulou, Evanthia & D. T. Lee. (2004). THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH. International Journal of Computational Geometry & Applications. 14(6). 421–452. 10 indexed citations
18.
Lee, D. T.. (2003). CHIEF EDITOR'S NOTICE. International Journal of Computational Geometry & Applications. 13(1). 1–1. 2 indexed citations
19.
Papadopoulou, Evanthia & D. T. Lee. (2001). THE L VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS. International Journal of Computational Geometry & Applications. 11(5). 503–528. 32 indexed citations
20.
Aoki‐Kinoshita, Kiyoko F. & D. T. Lee. (2001). TOWARDS WEB-BASED COMPUTING. International Journal of Computational Geometry & Applications. 11(1). 71–104. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026