| On prime labellings HL Fu, KC Huang Discrete Mathematics 127 (1-3), 181-186, 1994 | 88 | 1994 |
| Connectivity of cages HL Fu, KC Huang, CA Rodger Journal of Graph Theory 24 (2), 187-191, 1997 | 72 | 1997 |
| Group Divisible Designs with Two Associate Classes: n= 2 orm= 2 HL Fu, CA Rodger Journal of Combinatorial Theory, Series A 83 (1), 94-117, 1998 | 67 | 1998 |
| Total chromatic number and chromatic index of split graphs BL Chen, HL Fu, MT Ko Journal of Combinatorial Mathematics and Combinatorial Computing 17, 1995 | 65 | 1995 |
| Nonadaptive algorithms for threshold group testing HB Chen, HL Fu Discrete Applied Mathematics 157 (7), 1581-1585, 2009 | 59 | 2009 |
| The existence of group divisible designs with first and second associates, having block size 3 HL Fu, CA Rodger, DG Sarvate Ars Combinatoria 54, 33-50, 2000 | 55 | 2000 |
| Some results on equalized total coloring HL Fu Congressus numerantium, 111-120, 1994 | 53 | 1994 |
| ON THE CONSTRUCTION OF CERTAIN TYPES OF LATIN SQUARES HAVING PRESCRIBED INTERSECTIONS. H FU | 52 | 1981 |
| Optimal conflict-avoiding codes of length n≡ 0 (mod 16) and weight 3 M Mishima, HL Fu, S Uruno Designs, Codes and Cryptography 52 (3), 275-291, 2009 | 51 | 2009 |
| Decomposing graphs into forests of paths with size less than three. BL Chen, HL Fu, KC Huang Australas. J Comb. 3, 55-74, 1991 | 51 | 1991 |
| Cyclically decomposing the complete graph into cycles HL Fu, SL Wu Discrete mathematics 282 (1-3), 267-273, 2004 | 50 | 2004 |
| The linear 2-arboricity of complete bipartite graphs HL Fu, KC Huang Ars Combin 38, 309-318, 1994 | 44 | 1994 |
| Optimal conflict-avoiding codes of even length and weight 3 HL Fu, YH Lin, M Mishima IEEE transactions on information theory 56 (11), 5747-5756, 2010 | 43 | 2010 |
| An upper bound of the number of tests in pooling designs for the error-tolerant complex model HB Chen, HL Fu, FK Hwang Optimization Letters 2, 425-431, 2008 | 42 | 2008 |
| Linear k-arboricities on trees GJ Chang, BL Chen, HL Fu, KC Huang Discrete applied mathematics 103 (1-3), 281-287, 2000 | 42 | 2000 |
| On the existence of rainbows in 1‐factorizations of K2n DE Woolbright, HL FU Journal of Combinatorial Designs 6 (1), 1-20, 1998 | 32 | 1998 |
| The optimal pebbling number of the complete m-ary tree HL Fu, CL Shiue Discrete Mathematics 222 (1-3), 89-100, 2000 | 31 | 2000 |
| Information rate of McEliece public-key cryptosystem MC Lin, TC Chang, HL Fu Electronics Letters 26 (1), 16-18, 1990 | 28 | 1990 |
| Cyclic m‐cycle systems with m ≤ 32 or m = 2q with q a prime power SL Wu, HL Fu Journal of Combinatorial Designs 14 (1), 66-81, 2006 | 27 | 2006 |
| A note on the ascending subgraph decomposition problem HL Fu Discrete mathematics 84 (3), 315-318, 1990 | 27 | 1990 |
Alan Ling在 cems.uvm.edu 的电子邮件经过验证
