 | 2009 |
|---|
| 20 |       | Xujin Chen,
Bo Chen:
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.
Algorithmica 53(3): 263-297 (2009) |
| 19 | | Xujin Chen,
Jie Hu,
Xiaodong Hu:
A new model for path planning with interval data.
Computers & OR 36(6): 1893-1899 (2009) |
| 18 | | Xujin Chen,
Guoli Ding,
Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs.
Discrete Applied Mathematics 157(1): 118-125 (2009) |
| 17 | | Xujin Chen,
Jie Hu,
Xiaodong Hu:
A polynomial solvable minimum risk spanning tree problem with interval data.
European Journal of Operational Research 198(1): 43-46 (2009) |
| 16 | | Xujin Chen,
Bo Chen:
Cost-effective designs of fault-tolerant access networks in communication systems.
Networks 53(4): 382-391 (2009) |
| 2008 |
|---|
| 15 | | Xujin Chen,
Xiaodong Hu,
Xiaohua Jia:
Inapproximability and approximability of minimal tree routing and coloring.
J. Discrete Algorithms 6(2): 341-351 (2008) |
| 14 | | Xujin Chen,
Guoli Ding,
Wenan Zang:
A Characterization of Box-Mengerian Matroid Ports.
Math. Oper. Res. 33(2): 497-512 (2008) |
| 2007 |
|---|
| 13 | | Xujin Chen,
Jie Hu,
Xiaodong Hu:
The Minimum Risk Spanning Tree Problem.
COCOA 2007: 81-90 |
| 12 | | Xujin Chen,
Jie Hu,
Xiaodong Hu:
On the Minimum Risk-Sum Path Problem.
ESCAPE 2007: 175-185 |
| 11 | | Xujin Chen,
Xiaodong Hu,
Wenan Zang:
A Min-Max Theorem on Tournaments.
SIAM J. Comput. 37(3): 923-937 (2007) |
| 2006 |
|---|
| 10 | | Jianming Zhu,
Xujin Chen,
Xiaodong Hu:
Minimum Multicast Time Problem in Wireless Sensor Networks.
WASA 2006: 490-501 |
| 9 | | Xujin Chen,
Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
Algorithmica 44(3): 195-211 (2006) |
| 8 | | Xujin Chen,
Xiaodong Hu,
Tianping Shuai:
Inapproximability and approximability of maximal tree routing and coloring.
J. Comb. Optim. 11(2): 219-229 (2006) |
| 7 | | Xujin Chen,
Guoli Ding,
Xiaodong Hu,
Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets.
Math. Oper. Res. 31(4): 777-788 (2006) |
| 2005 |
|---|
| 6 | | Xujin Chen,
Xiao-Dong Hu,
Xiaohua Jia:
Complexity of Minimal Tree Routing and Coloring.
AAIM 2005: 6-15 |
| 5 | | Xujin Chen,
Xiao-Dong Hu,
Tianping Shuai:
Routing and Coloring for Maximal Number of Trees.
COCOON 2005: 199-209 |
| 4 | | Xujin Chen,
Guoli Ding,
Xiaodong Hu,
Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets.
ISAAC 2005: 126-135 |
| 3 | | Xujin Chen,
Xiaodong Hu,
Jianming Zhu:
Minimum Data Aggregation Time Problem in Wireless Sensor Networks.
MSN 2005: 133-142 |
| 2 | | Xujin Chen,
Zhiquan Hu,
Wenan Zang:
Perfect Circular Arc Coloring.
J. Comb. Optim. 9(3): 267-280 (2005) |
| 2004 |
|---|
| 1 | | Xujin Chen,
Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.
ISAAC 2004: 306-317 |
