|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 14 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang |
Bonds with parity constraints.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Chen, Xujin Chen |
Packing cycles exactly in polynomial time. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Álvarez-Miranda, Xujin Chen, Jie Hu, Xiaodong Hu, Alfredo Candia-Véjar |
Deterministic risk control for cost-effective network connections. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Chen, Xujin Chen, Xiaodong Hu |
The price of atomic selfish ring routing. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Zhibin Chen, Wenan Zang |
A Unified Approach to Box-Mengerian Hypergraphs. |
Math. Oper. Res. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li 0004 |
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. |
AAIM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Weidong Ma |
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Bo Chen |
Cost-effective designs of fault-tolerant access networks in communication systems. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Bo Chen |
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee |
| 1 | Xujin Chen, Jie Hu, Xiaodong Hu |
A polynomial solvable minimum risk spanning tree problem with interval data. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Jie Hu, Xiaodong Hu |
A new model for path planning with interval data. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Jianming Zhu |
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks. |
IJDSN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Guoli Ding, Wenan Zang |
The box-TDI system associated with 2-edge connected spanning subgraphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Guoli Ding, Wenan Zang |
A Characterization of Box-Mengerian Matroid Ports. |
Math. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Xiaohua Jia |
Inapproximability and approximability of minimal tree routing and coloring. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Xu, Xujin Chen, Xiaodong Hu |
On the restricted forwarding index problem in communication networks. |
Computers & Mathematics with Applications |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Wenan Zang |
A Min-Max Theorem on Tournaments. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Jie Hu, Xiaodong Hu |
The Minimum Risk Spanning Tree Problem. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Jie Hu, Xiaodong Hu |
On the Minimum Risk-Sum Path Problem. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Tianping Shuai |
Inapproximability and approximability of maximal tree routing and coloring. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
coloring, multicast routing, maximum independent set |
| 1 | Xujin Chen, Wenan Zang |
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Feedback set, Cycle packing, Algorithm, Complexity, Network flow |
| 1 | Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang |
A Min-Max Relation on Packing Feedback Vertex Sets. |
Math. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianming Zhu, Xujin Chen, Xiaodong Hu |
Minimum Multicast Time Problem in Wireless Sensor Networks. |
WASA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Zhiquan Hu, Wenan Zang |
Perfect Circular Arc Coloring. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
complexity, matching, graph coloring, perfect graph, circular-arc graph |
| 1 | Xujin Chen, Xiao-Dong Hu, Xiaohua Jia |
Complexity of Minimal Tree Routing and Coloring. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiaodong Hu, Jianming Zhu |
Minimum Data Aggregation Time Problem in Wireless Sensor Networks. |
MSN |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Xiao-Dong Hu, Tianping Shuai |
Routing and Coloring for Maximal Number of Trees. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang |
A Min-Max Relation on Packing Feedback Vertex Sets. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Wenan Zang |
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
feedback set, cycle packing, algorithm, complexity, network flow |
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")