| 2009 |
|---|
| 15 | EE | Min Lü,
Guo-Liang Chen,
Xi-Rong Xu:
On super edge-connectivity of product graphs.
Applied Mathematics and Computation 207(2): 300-306 (2009) |
| 2008 |
|---|
| 14 | EE | Cheng-Dong Jiang,
Guo-Liang Chen:
Double Barrier Coverage in Dense Sensor Networks.
J. Comput. Sci. Technol. 23(1): 154-165 (2008) |
| 13 | EE | Min Lü,
Chao Wu,
Guo-Liang Chen,
Cheng Lv:
On super connectivity of Cartesian product graphs.
Networks 52(2): 78-87 (2008) |
| 2007 |
|---|
| 12 | EE | Min Lü,
Guo-Liang Chen,
Jun-Ming Xu:
On super edge-connectivity of Cartesian product graphs.
Networks 49(2): 152-157 (2007) |
| 2006 |
|---|
| 11 | EE | Guo-Liang Chen,
Guang-Zhong Sun,
Yun-Quan Zhang,
Zeyao Mo:
Study on Parallel Computing.
J. Comput. Sci. Technol. 21(5): 665-673 (2006) |
| 2005 |
|---|
| 10 | EE | Yi-Fei Shen,
Guo-Liang Chen:
Parallel Algorithm for Computing Reversal Distance.
PDCAT 2005: 950-953 |
| 9 | | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
The Smallest Degree Sum that Yields Potentially K2s-graphic Sequences.
Ars Comb. 74: (2005) |
| 8 | EE | Ya-feng Wu,
Yinlong Xu,
Guo-Liang Chen:
Approximation Algorithms for Steiner Connected Dominating Set.
J. Comput. Sci. Technol. 20(5): 713-716 (2005) |
| 7 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen,
Cheng Zhong:
On the fault-tolerant diameter and wide diameter of omega-connected graphs.
Networks 45(2): 88-94 (2005) |
| 2004 |
|---|
| 6 | EE | Kun Wang,
Yinlong Xu,
Guo-Liang Chen,
Ya-feng Wu:
Power-Aware On-Demand Routing Protocol for MANET.
ICDCS Workshops 2004: 723-728 |
| 5 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
A variation of a classical Turán-type extremal problem.
Eur. J. Comb. 25(7): 989-1002 (2004) |
| 4 | EE | Chao Yan,
Guo-Liang Chen,
Yi-Fei Shen:
Outleir Analysis for Gene Expression Data.
J. Comput. Sci. Technol. 19(1): 13-21 (2004) |
| 3 | EE | Peng Zou,
Zhi Zhou,
Ying-Yu Wan,
Guo-Liang Chen,
Jun Gu:
New Meta-Heuristic for Combinatorial Optimization Problems: Intersection Based Scaling.
J. Comput. Sci. Technol. 19(6): 740-751 (2004) |
| 2 | EE | Xian-Chao Zhang,
Ying-Yu Wan,
Guo-Liang Chen:
Max-Flow Problem in Undirected Planar Networks with Node Capacities Being in NC.
J. Comput. Sci. Technol. 19(6): 787-790 (2004) |
| 2003 |
|---|
| 1 | EE | Jian-Hua Yin,
Jiong-Sheng Li,
Guo-Liang Chen:
The smallest degree sum that yields potentially kCl-graphic sequences.
Discrete Mathematics 270(1-3): 318-326 (2003) |
