 | 2009 |
|---|
| 12 |       | Byron J. Gao,
Mingji Xia,
Walter Cai,
David C. Anastasiu:
The gardener's problem for web information monitoring.
CIKM 2009: 1525-1528 |
| 11 |  | Walter Cai,
David C. Anastasiu,
Mingji Xia,
Byron J. Gao:
OLAP For Multicriteria Maintenance Scheduling.
DMIN 2009: 35-41 |
| 10 | | Jin-yi Cai,
Pinyan Lu,
Mingji Xia:
Holant problems and counting CSP.
STOC 2009: 715-724 |
| 9 | | Jin-yi Cai,
Pinyan Lu,
Mingji Xia:
A Computational Proof of Complexity of Some Restricted Counting Problems.
TAMC 2009: 138-149 |
| 8 | | Peng Zhang,
Mingji Xia:
An approximation algorithm to the k-Steiner Forest problem.
Theor. Comput. Sci. 410(11): 1093-1098 (2009) |
| 2008 |
|---|
| 7 | | Jin-yi Cai,
Pinyan Lu,
Mingji Xia:
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness.
FOCS 2008: 644-653 |
| 6 | | Angsheng Li,
Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract).
STACS 2008: 491-502 |
| 5 | | Jin-yi Cai,
Pinyan Lu,
Mingji Xia:
A Family of Counter Examples to an Approach to Graph Isomorphism
CoRR abs/0801.1766: (2008) |
| 4 | | Angsheng Li,
Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract)
CoRR abs/0802.2860: (2008) |
| 2007 |
|---|
| 3 | | Mingji Xia:
Maximum Edge-Disjoint Paths Problem in Planar Graphs.
TAMC 2007: 566-572 |
| 2 | | 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 |
|---|
| 1 | | Mingji Xia,
Wenbo Zhao:
#3-Regular Bipartite Planar Vertex Cover is #P-Complete.
TAMC 2006: 356-364 |
