 | 2009 |
|---|
| 8 |       | Peng Zhang,
Jin-yi Cai,
Linqing Tang,
Wenbo Zhao:
Approximation and Hardness Results for Label Cut and Related Problems.
TAMC 2009: 460-469 |
| 2008 |
|---|
| 7 | | Jun Sun,
Wenbo Zhao,
Jiangwei Xue,
Zhiyong Shen,
Yi-Dong Shen:
Clustering with Feature Order Preferences.
PRICAI 2008: 382-393 |
| 6 | | Ding-Zhu Du,
Ronald L. Graham,
Panos M. Pardalos,
Peng-Jun Wan,
Weili Wu,
Wenbo Zhao:
Analysis of greedy approximations with nonsubmodular potential functions.
SODA 2008: 167-175 |
| 2007 |
|---|
| 5 | | Peng Zhang,
Wenbo Zhao:
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.
ESCAPE 2007: 70-81 |
| 4 | | Wenbo Zhao,
Peng Zhang:
Approximation to the Minimum Rooted Star Cover Problem.
TAMC 2007: 670-679 |
| 3 | | Mingji Xia,
Peng Zhang,
Wenbo Zhao:
Computational complexity of counting problems on 3-regular planar graphs.
Theor. Comput. Sci. 384(1): 111-125 (2007) |
| 2006 |
|---|
| 2 | | Mingji Xia,
Wenbo Zhao:
#3-Regular Bipartite Planar Vertex Cover is #P-Complete.
TAMC 2006: 356-364 |
| 1 | | Wenbo Zhao,
Peng Zhang,
Tao Jiang:
A network flow approach to the Minimum Common Integer Partition Problem.
Theor. Comput. Sci. 369(1-3): 456-462 (2006) |
