| |
| 2006 | ||
|---|---|---|
| 3 | EE | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku: Efficient algorithms for a constrained k-tree core problem in a tree network. J. Algorithms 59(2): 107-124 (2006) |
| 2005 | ||
| 2 | EE | Qin-yun Dai, Xiu-lin Hu, Hong-Yi Yu, Jun Zhao: On the Capacity of Wireless Ad-Hoc Network Basing on Graph Theory. ICN (2) 2005: 353-360 |
| 2002 | ||
| 1 | EE | Hong-Yi Yu, Biing-Feng Wang: An Improved Algorithm for Finding k-centrums on Weighted Trees. ICPADS 2002: 222-225 |
| 1 | Qin-yun Dai | [2] |
| 2 | Xiu-lin Hu | [2] |
| 3 | Shan-Chyun Ku | [3] |
| 4 | Shietung Peng | [3] |
| 5 | Biing-Feng Wang | [1] [3] |
| 6 | Jun Zhao | [2] |