Orderly spanning trees with applications YT Chiang, CC Lin, HI Lu SIAM Journal on Computing 34 (4), 924-945, 2005 | 165 | 2005 |
Approximating maximum leaf spanning trees in almost linear time HI Lu, R Ravi Journal of Algorithms 29 (1), 132-141, 1998 | 161 | 1998 |
Compact encodings of planar graphs via canonical orderings and multiple parentheses RCN Chuang, A Garg, X He, MY Kao, HI Lu Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998 | 142 | 1998 |
Operations of interlaced trees and graceful trees WC Chen, HI Lu, YN Yeh Southeast Asian Bull. Math 21 (4), 337-348, 1997 | 131 | 1997 |
Segmented bus design for low-power systems JY Chen, WB Jone, JS Wang, HI Lu, TF Chen IEEE Transactions on Very Large Scale Integration (VLSI) Systems 7 (1), 25-29, 1999 | 116 | 1999 |
The power of local optimization: Approximation algorithms for maximum-leaf spanning tree (DRAFT) HI Lu, R Ravi Proc. 30th Annual Allerton Conference on Communication Control and Computing …, 1996 | 116 | 1996 |
Multicast routing with multiple QoS constraints in ATM networks JJ Wu, RH Hwang, HI Lu Information sciences 124 (1-4), 29-57, 2000 | 82 | 2000 |
Linear-time succinct encodings of planar graphs via canonical orderings X He, MY Kao, HI Lu SIAM Journal on Discrete Mathematics 12 (3), 317-325, 1999 | 79 | 1999 |
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING P Klein, HI Lu STOC 96, 338-347, 1996 | 79 | 1996 |
Compact floor-planning via orderly spanning trees CC Liao, HI Lu, HC Yen Journal of Algorithms 48 (2), 441-451, 2003 | 75* | 2003 |
An optimal algorithm for the maximum-density segment problem KM Chung, HI Lu SIAM Journal on Computing 34 (2), 373-387, 2005 | 74 | 2005 |
A fast general methodology for information-theoretically optimal encodings of graphs X He, MY Kao, HI Lu SIAM Journal on Computing 30 (3), 838-846, 2000 | 70 | 2000 |
Balanced parentheses strike back HI Lu, CC Yeh ACM Transactions on Algorithms (TALG) 4 (3), 1-13, 2008 | 65 | 2008 |
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications MH Goldwasser, MY Kao, HI Lu Journal of Computer and System Sciences 70 (2), 128-144, 2005 | 64* | 2005 |
Improved compact visibility representation of planar graph via Schnyder's realizer CC Lin, HI Lu, IF Sun SIAM Journal on Discrete Mathematics 18 (1), 19-29, 2004 | 48* | 2004 |
Design theory and implementation for low-power segmented bus systems WB Jone, JS Wang, HI Lu, IP Hsu, JY Chen ACM Transactions on Design Automation of Electronic Systems (TODAES) 8 (1 …, 2003 | 46 | 2003 |
An optimal algorithm for maximum-sum segment and its application in bioinformatics TH Fan, S Lee, HI Lu, TS Tsou, TC Wang, A Yao Implementation and Application of Automata: 8th International Conference …, 2003 | 44 | 2003 |
Image set compression through minimal-cost prediction structure CP Chen, CS Chen, KL Chung, HI Lu, GY Tang 2004 International Conference on Image Processing, 2004. ICIP'04. 2, 1289-1292, 2004 | 43 | 2004 |
Power-saving scheduling for weakly dynamic voltage scaling devices JJ Chen, TW Kuo, HI Lu Algorithms and Data Structures: 9th International Workshop, WADS 2005 …, 2005 | 40 | 2005 |
A faster algorithm to recognize even-hole-free graphs HC Chang, HI Lu Journal of Combinatorial Theory, Series B 113, 141-161, 2015 | 38 | 2015 |