![]() | ![]() |
2008 | ||
---|---|---|
6 | EE | Longcheng Liu, Enyu Yao: Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. Theor. Comput. Sci. 396(1-3): 28-34 (2008) |
2007 | ||
5 | EE | Longcheng Liu, Enyu Yao: Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance. ESCAPE 2007: 375-383 |
4 | EE | Longcheng Liu, Enyu Yao: A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance. APJOR 24(5): 725-736 (2007) |
3 | EE | Wenqing Dou, Enyu Yao: On rearrangeable multirate three-stage Clos networks. Theor. Comput. Sci. 372(1): 103-107 (2007) |
2006 | ||
2 | EE | Haiyan Lu, Enyu Yao, Liqun Qi: Some further results on minimum distribution cost flow problems. J. Comb. Optim. 11(4): 351-371 (2006) |
2005 | ||
1 | EE | Yong He, Binwu Zhang, Enyu Yao: Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. J. Comb. Optim. 9(1): 91-100 (2005) |
1 | Wenqing Dou | [3] |
2 | Yong He | [1] |
3 | Longcheng Liu | [4] [5] [6] |
4 | Haiyan Lu | [2] |
5 | Liqun Qi | [2] |
6 | Binwu Zhang | [1] |