| 2007 |
|---|
| 12 | EE | Xujin Chen,
Jie Hu,
Xiaodong Hu:
The Minimum Risk Spanning Tree Problem.
COCOA 2007: 81-90 |
| 11 | EE | Xujin Chen,
Jie Hu,
Xiaodong Hu:
On the Minimum Risk-Sum Path Problem.
ESCAPE 2007: 175-185 |
| 10 | EE | Xujin Chen,
Xiaodong Hu,
Wenan Zang:
A Min-Max Theorem on Tournaments.
SIAM J. Comput. 37(3): 923-937 (2007) |
| 2006 |
|---|
| 9 | EE | Jianming Zhu,
Xujin Chen,
Xiaodong Hu:
Minimum Multicast Time Problem in Wireless Sensor Networks.
WASA 2006: 490-501 |
| 8 | EE | Xujin Chen,
Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
Algorithmica 44(3): 195-211 (2006) |
| 7 | EE | Xujin Chen,
Xiaodong Hu,
Tianping Shuai:
Inapproximability and approximability of maximal tree routing and coloring.
J. Comb. Optim. 11(2): 219-229 (2006) |
| 2005 |
|---|
| 6 | EE | Xujin Chen,
Xiao-Dong Hu,
Xiaohua Jia:
Complexity of Minimal Tree Routing and Coloring.
AAIM 2005: 6-15 |
| 5 | EE | Xujin Chen,
Xiao-Dong Hu,
Tianping Shuai:
Routing and Coloring for Maximal Number of Trees.
COCOON 2005: 199-209 |
| 4 | EE | Xujin Chen,
Guoli Ding,
Xiaodong Hu,
Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets.
ISAAC 2005: 126-135 |
| 3 | EE | Xujin Chen,
Xiaodong Hu,
Jianming Zhu:
Minimum Data Aggregation Time Problem in Wireless Sensor Networks.
MSN 2005: 133-142 |
| 2 | EE | Xujin Chen,
Zhiquan Hu,
Wenan Zang:
Perfect Circular Arc Coloring.
J. Comb. Optim. 9(3): 267-280 (2005) |
| 2004 |
|---|
| 1 | EE | Xujin Chen,
Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
ISAAC 2004: 306-317 |
