|
Search the dblp DataBase
Mingji Xia:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mingji Xia, Wenbo Zhao
#3-Regular Bipartite Planar Vertex Cover is #P-Complete. [Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:356-364 [Conf]
- Mingji Xia
Maximum Edge-Disjoint Paths Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:566-572 [Conf]
- Mingji Xia, Peng Zhang, Wenbo Zhao
Computational complexity of counting problems on 3-regular planar graphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:384, n:1, pp:111-125 [Journal]
The gardener's problem for web information monitoring. [Citation Graph (, )][DBLP]
OLAP For Multicriteria Maintenance Scheduling. [Citation Graph (, )][DBLP]
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. [Citation Graph (, )][DBLP]
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems. [Citation Graph (, )][DBLP]
A Theory for Valiant's Matchcircuits (Extended Abstract). [Citation Graph (, )][DBLP]
Holant problems and counting CSP. [Citation Graph (, )][DBLP]
A Computational Proof of Complexity of Some Restricted Counting Problems. [Citation Graph (, )][DBLP]
A Family of Counter Examples to an Approach to Graph Isomorphism [Citation Graph (, )][DBLP]
A Theory for Valiant's Matchcircuits (Extended Abstract) [Citation Graph (, )][DBLP]
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|