| 2008 |
|---|
| 27 | EE | Yu Zong,
Xian-Chao Zhang,
He Jiang,
MingChu Li:
A Creditable Subspace Labeling Method Based on D-S Evidence Theory.
PAKDD 2008: 839-848 |
| 26 | EE | MingChu Li,
Liming Xiong,
H. J. Broersma:
Connected even factors in claw-free graphs.
Discrete Mathematics 308(11): 2282-2284 (2008) |
| 25 | EE | Liming Xiong,
Qiuxin Wu,
MingChu Li:
Radius and subpancyclicity in line graphs.
Discrete Mathematics 308(23): 5325-5333 (2008) |
| 24 | EE | He Jiang,
Xianchao Zhang,
Guoliang Chen,
MingChu Li:
Backbone analysis and algorithm design for the quadratic assignment problem.
Science in China Series F: Information Sciences 51(5): 476-488 (2008) |
| 2007 |
|---|
| 23 | EE | He Jiang,
Xianchao Zhang,
MingChu Li:
Backbone of the p-Median Problem.
Australian Conference on Artificial Intelligence 2007: 699-704 |
| 22 | EE | He Jiang,
Xianchao Zhang,
MingChu Li,
HaoYang Che:
Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem.
International Conference on Computational Science (3) 2007: 293-298 |
| 21 | EE | MingChu Li,
Liming Xiong,
Hong Liu:
Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs.
International Conference on Computational Science (3) 2007: 329-333 |
| 20 | EE | Liming Xiong,
MingChu Li:
On the 2-factor index of a graph.
Discrete Mathematics 307(21): 2478-2483 (2007) |
| 19 | EE | MingChu Li,
Cheng Guo,
Liming Xiong,
Dengxin Li,
Hong-Jian Lai:
Quadrangularly connected claw-free graphs.
Discrete Mathematics 307(9-10): 1205-1211 (2007) |
| 2006 |
|---|
| 18 | EE | MingChu Li,
Hongyan Yao,
Jianbo Ma:
Recovery Mechanism of Online Certification Chain in Grid Computing.
ARES 2006: 558-562 |
| 17 | EE | MingChu Li,
Hongyan Yao:
Recovery Mechanism of Cooperative Process Chain in Grid.
ARES 2006: 571-576 |
| 16 | EE | MingChu Li,
Yongrui Cui,
Yuan Tian,
Dong Wang,
Songyuan Yan:
A New Architecture of Grid Security System Construction.
ICPP Workshops 2006: 100-108 |
| 15 | EE | MingChu Li:
Circumferences of regular claw-free graphs.
Discrete Mathematics 306(21): 2682-2694 (2006) |
| 2005 |
|---|
| 14 | EE | Weisheng Si,
MingChu Li:
On the Connectedness of Peer-to-Peer Overlay Networks.
ICPADS (1) 2005: 474-480 |
| 13 | EE | MingChu Li,
Liming Xiong:
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs.
Electronic Notes in Discrete Mathematics 22: 93-99 (2005) |
| 12 | EE | Tomás Kaiser,
MingChu Li,
Zdenek Ryjácek,
Liming Xiong:
Hourglasses and Hamilton cycles in 4-connected claw-free graphs.
Journal of Graph Theory 48(4): 267-276 (2005) |
| 2004 |
|---|
| 11 | EE | Qing Xu,
Roberto Brunelli,
Stefano Messelodi,
Jiawan Zhang,
MingChu Li:
Image Coherence Based Adaptive Sampling for Image Synthesis.
ICCSA (2) 2004: 693-702 |
| 10 | EE | Liming Xiong,
Hajo Broersma,
Xueliang Li,
MingChu Li:
The hamiltonian index of a graph and its branch-bonds.
Discrete Mathematics 285(1-3): 279-288 (2004) |
| 9 | EE | MingChu Li:
Hamiltonian Connected Claw-Free Graphs.
Graphs and Combinatorics 20(3): 341-362 (2004) |
| 2003 |
|---|
| 8 | | MingChu Li:
Circumferences of 2-Connected Claw-Free Graphs.
Ars Comb. 67: (2003) |
| 2002 |
|---|
| 7 | | MingChu Li:
Hamiltonian Cycles in N2-Locally Connected Claw-Free Graphs.
Ars Comb. 62: (2002) |
| 2001 |
|---|
| 6 | EE | MingChu Li:
Hamiltonian Cycles in Almost Claw-Free Graphs.
Graphs and Combinatorics 17(4): 687-706 (2001) |
| 2000 |
|---|
| 5 | EE | MingChu Li:
On hamiltonian connectedness of K1, 4-free graphs.
Discrete Mathematics 216(1-3): 279-285 (2000) |
| 1998 |
|---|
| 4 | | MingChu Li:
On Pancyclic Claw-Free Graphs.
Ars Comb. 50: (1998) |
| 3 | EE | MingChu Li:
Vertex pancyclism in claw-free graphs.
Discrete Mathematics 188(1-3): 151-173 (1998) |
| 1996 |
|---|
| 2 | EE | MingChu Li:
Hamiltonian cycles in regular 3-connected claw-free graphs.
Discrete Mathematics 156(1-3): 171-196 (1996) |
| 1995 |
|---|
| 1 | EE | MingChu Li:
Longest cycles in regular 2-connected claw-free graphs.
Discrete Mathematics 137(1-3): 277-295 (1995) |
