2009 |
5 | EE | Mingyu Xiao:
New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs
CoRR abs/0904.2712: (2009) |
2008 |
4 | EE | Mingyu Xiao:
Algorithms for Multiterminal Cuts.
CSR 2008: 314-325 |
3 | EE | Mingyu Xiao:
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts.
ISAAC 2008: 208-219 |
2 | EE | Mingyu Xiao:
Finding Minimum 3-Way Cuts in Hypergraphs.
TAMC 2008: 270-281 |
1 | EE | Mingyu Xiao,
Leizhen Cai,
Andrew C. Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
CoRR abs/0811.3723: (2008) |