Results 1-44 of 44 (Search time: 0.003 seconds).
Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
---|---|---|---|---|---|---|---|
1 | 2019 | O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities(AACT 2019 Best Journal Paper Award) | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | Algorithmica 81, 1800-1817 | |||
2 | 2018 | The (1|1)-Centroid Problem in the Plane with Distance Constraints | Hung-I Yu; Tien-Ching Lin; D. T. Lee | International Journal of Computational Geometry and Applications 28, 81-109 | |||
3 | 2018 | The multi-service center problem | Hung-I Yu; Cheng-Chung Li; D.T. Lee | Theoretical Computer Science 705, 58-74 | |||
4 | 2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities | Jia-Yau Shiao; Mong-Jen Kao; Ching-Chi Lin; D. T. Lee | ||||
5 | 2016 | The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints | Hung-I Yu; Tien-Ching Lin; D. T. Lee | ||||
6 | 2016 | O(f) Bi-approximation for Capacitated Covering with Hard Capacities | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | ||||
7 | 2016 | Broadcasting in Weighted Trees under the Postal Model | Yu-Hsuan Su; Ching-Chi Lin; D. T. Lee | Theoretical Comput. Sci. 621, 73-81 | |||
8 | 2016 | Optimal Time-Convex Hull for a Straight-Line Highway in Lp-Metrics | B.-S. Dai; Mong-Jen Kao; D.T. Lee | Computational Geometry: Theory and Applications 53, 1-20 | |||
9 | 2015 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Theoretical Comput. Sci. 595, 46-64 | |||
10 | 2015 | Capacitated Domination: Problem Complexity and Approximation Algorithms | Mong-Jen Kao; Han-Lin Chen; D.T. Lee | Algorithmica 72(1), 1-43 | |||
11 | 2015 | The k-Nearest-Neighbor Voronoi Diagram Revisited | Chih-Hung Liu; Evanthia Papadopoulou; D. T. Lee | Algorithmica 71(2), 429-449 | |||
12 | 2014 | Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | |||
13 | 2014 | Preface Algorithms and Computation (ISAAC 2012) | Kun-Mao Chao; Tsan-sheng Hsu ; D. T. Lee | Algorithmica 70(4), 694-695 | |||
14 | 2014 | Efficien Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction | Chih-Hung Liu; Chun-Xun Lin; I-Che Chen; D. T. Lee ; Ting-Chi Wang | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33(12), 1928-1941 | |||
15 | 2014 | Using Geometric Structures to Improve the Error Correction Algorithm of High-Throughput Sequencing Data on MapReduce Framework | Wei-Chun Chung; Yu-Jung Chang; D. T. Lee ; Jan-Ming Ho | ||||
16 | 2014 | Video Event Detection via Multi-modality Deep Learning | I-Hong Jhuo; D.T. Lee | ||||
17 | 2014 | Algorithms and Computation (ISAAC 2012) | Kun-Mao Chao; Tsan-sheng Hsu ; D. T. Lee | Theoretical Comput. Sci. 544, 1-2 | |||
18 | 2014 | CloudDOE: A User-Friendly Tool for Deploying Hadoop Clouds and Analyzing High-Throughput Sequencing Data with MapReduce | Wei-Chun Chung; Chien-Chih Chen; Jan-Ming Ho ; Chung-Yen Lin ; Wen-Lian Hsu ; Yu-Chun Wang; Der-Tsai Lee ; Feipei Lai; Chih-Wei Huang; Yu-Jung Chang | PLoS One 9(6):e98146 | |||
19 | 2014 | An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips | Chun-Xun Lin; Chih-Hung Liu; I-Che Chen; D.T. Lee ; Tsung-Yi Ho | ||||
20 | 2014 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D. T. Lee ; Ignaz Rutter; Dorothea Wagner | ||||
21 | 2014 | Discovering joint audio–visual codewords for video event detection | I.-Hong Jhuo; Guangnan Ye; Shenghua Gao; Dong Liu; Yu-Gang Jiang; D. T. Lee ; Shih-Fu Chang | Machine Vision and Applications 25(1), 33-47 | |||
22 | 2013 | Reviving Globally Stagnant Careers of Postdoctorates | Der-Tsai Lee | ||||
23 | 2013 | The Density Maximization Problem in Graphs | Mong-Jen Kao; Bastian Katz; Marcus Krug; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Journal of Combinatorial Optimization 26(4), 723-754 | |||
24 | 2013 | CloudRS: An Error Correction Algorithm of High-Throughput Sequencing Data | Chen, Chien-Chih; Chang, Yu-Jung; Chung, Wei-Chun; Lee, Der-Tsai ; Ho, Jan-Ming | ||||
25 | 2013 | Optimizing a MapReduce Module of Preprocessing High-Throughput DNA Sequencing Data | Wei-Chun Chung; Yu-Jung Chang; Chien-Chih Chen; Der-Tsai Lee ; Jan-Ming Ho | ||||
26 | 2013 | Optimal Time-Convex Hull under the L_p Metrics | Bang-Sin Dai; Mong-Jen Kao; D. T. Lee | ||||
27 | 2013 | Power Domination in Circular-arc Graphs | Liao, Chung-Shou; Lee, D. T. | Algorithmica 65, 443-466 | |||
28 | 2012 | DR. ION: Disaster Rescue over Information-Oriented Network | Chung, Wei-Chun; Wu, Chi-Jen; Fu, Ku Chin; Lee, D. T. ; Ho, Jan-Ming | ||||
29 | 2012 | Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm | Liu, Chih-Hung; Kuo, Sy-Yen; Lee, D. T. ; Lin, Chun-Syun; Weng, Jung-Hung; Yuan, Shih-Yi | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 31(7), 1050-1060 | |||
30 | 2012 | Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices | Tung, Tsai-Yeh; Lin, Laurent; Lee, D. T. | IEEE WAINA 1, 100 | |||
31 | 2012 | Computing the Stretch Factor and Maximum Detour of Paths, Trees, and Cycles in the Normed Space | C. Wulff-Nilsen; A. Grüne; R. Klein; E. Langetepe; D.T. Lee ; T.-C. Lin; S.-H. Poon; T.-K. Yu | International Journal of Computational Geometry and Applications 22(1), 45-60 | |||
32 | 2011 | Finding Maximum Sum Segments in Sequences with Uncertainty | Hung-I Yu; Tien-Ching Lin; D. T. Lee | ||||
33 | 2011 | An Output-Sensitive Approach for the L_1/L_infinity k Nearest Neighbor Voronoi Diagram | Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, D. T. | ||||
34 | 2011 | Connecting Two Trees with Optimal Routing Cost | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Noellenburg, Martin; Rutter, Ignaz | ||||
35 | 2011 | The Density Maximization Problem in Graphs | Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T. ; Rutter, Ignaz; Wagner, Dorothea | ||||
36 | 2011 | Multiple-Instance Learning: Multiple Feature Selection on Instance Representation | Jhuo, I-Hong; Lee, D. T. | ||||
37 | 2011 | Capacitated domination problem | Kao, M. J.; Liao, C. S.; Lee, D. T. | Algorithmica 60, 274-300 | |||
38 | 2011 | Constructing Optimal Shortcuts in Directed Weighted Paths | Klein, R.; Krug, M.; Langetepe, E.; Lee, D. T. ; Wagner, D. | ||||
39 | 2010 | Maximum Detour and Spanning Ratio on Rectilinear Path in L_1 Plane | Gruene, A.; Lin, Tien-Chin; Yu, Teng-Kai; Klein, Rolf; Langetepe, Elmar; Lee, D. T. ; Poon, Sheung-Hung | ||||
40 | 2010 | 國家型數位典藏計畫之回顧、現況與展望:以台灣為例 | 陳淑君 ; 李德財 | ||||
41 | 2010 | Boosting-based Multiple Kernel Learning for Image Re-ranking | Jhuo, I-Hong; Lee, D. T. | ||||
42 | 2010 | Boosted Multiple Kernel Learning for Scene Category Recognition | Jhuo, I-Hong; Lee, D. T. | ||||
43 | 2010 | Broadcasting in Heterogeneous Tree Networks | Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. | ||||
44 | 2010 | Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem | Lin, T. -C.; Lee, D. T. | Theoretical Comput. Sci. 411, 986-994 |