| 2009 |
|---|
| 46 | EE | Qing Cui,
Jian Wang,
Xingxing Yu:
Hamilton circles in infinite planar graphs.
J. Comb. Theory, Ser. B 99(1): 110-138 (2009) |
| 45 | EE | Baogang Xu,
Xingxing Yu:
Judicious k-partitions of graphs.
J. Comb. Theory, Ser. B 99(2): 324-337 (2009) |
| 2008 |
|---|
| 44 | EE | Baogang Xu,
Xingxing Yu:
Triangle-free subcubic graphs with minimum bipartite density.
J. Comb. Theory, Ser. B 98(3): 516-537 (2008) |
| 43 | EE | Xingxing Yu:
Infinite paths in planar graphs V, 3-indivisible graphs.
Journal of Graph Theory 57(4): 275-312 (2008) |
| 2007 |
|---|
| 42 | EE | Wen Jiang,
Ye Li,
Xingxing Yu:
Truncation for Low-Complexity MIMO Signal Detection.
IEEE Transactions on Information Theory 53(4): 1564-1571 (2007) |
| 41 | EE | Mark Bilinski,
Young Soo Kwon,
Xingxing Yu:
On the reconstruction of planar graphs.
J. Comb. Theory, Ser. B 97(5): 745-756 (2007) |
| 40 | EE | Zemin Jin,
Xingxing Yu,
Xiaoyan Zhang:
Contractible subgraphs in k-connected graphs.
Journal of Graph Theory 55(2): 121-136 (2007) |
| 2006 |
|---|
| 39 | EE | Xiaolong Huang,
Zemin Jin,
Xingxing Yu,
Xiaoyan Zhang:
Contractible Cliques in k-Connected Graphs.
Graphs and Combinatorics 22(3): 361-370 (2006) |
| 38 | EE | Xingxing Yu,
Florian Zickfeld:
Reducing Hajós' 4-coloring conjecture to 4-connected graphs.
J. Comb. Theory, Ser. B 96(4): 482-492 (2006) |
| 37 | EE | Guantao Chen,
Laura Sheppardson,
Xingxing Yu,
Wenan Zang:
The circumference of a graph with no K3, t-minor.
J. Comb. Theory, Ser. B 96(6): 822-845 (2006) |
| 36 | EE | Xingxing Yu:
Infinite paths in planar graphs III, 1-way infinite paths.
Journal of Graph Theory 51(3): 175-198 (2006) |
| 35 | EE | Xingxing Yu:
Infinite paths in planar graphs IV, dividing cycles.
Journal of Graph Theory 53(3): 173-195 (2006) |
| 34 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Finding Four Independent Trees .
SIAM J. Comput. 35(5): 1023-1058 (2006) |
| 33 | EE | Guantao Chen,
Zhicheng Gao,
Xingxing Yu,
Wenan Zang:
Approximating Longest Cycles in Graphs with Bounded Degrees.
SIAM J. Comput. 36(3): 635-656 (2006) |
| 2005 |
|---|
| 32 | EE | Guantao Chen,
Zhicheng Gao,
Xingxing Yu,
Wenan Zang:
Approximating the Longest Cycle Problem on Graphs with Bounded Degree.
COCOON 2005: 870-884 |
| 31 | EE | József Balogh,
Martin Kochol,
András Pluhár,
Xingxing Yu:
Covering planar graphs with forests.
J. Comb. Theory, Ser. B 94(1): 147-158 (2005) |
| 30 | EE | Robin Thomas,
Xingxing Yu,
Wenan Zang:
Hamilton paths in toroidal graphs.
J. Comb. Theory, Ser. B 94(2): 214-236 (2005) |
| 29 | EE | Xingxing Yu:
Infinite paths in planar graphs II, structures and ladder nets.
Journal of Graph Theory 48(4): 247-266 (2005) |
| 28 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Nonseparating Planar Chains in 4-Connected Graphs.
SIAM J. Discrete Math. 19(2): 399-419 (2005) |
| 27 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Chain Decompositions of 4-Connected Graphs.
SIAM J. Discrete Math. 19(4): 848-880 (2005) |
| 2004 |
|---|
| 26 | EE | Guantao Chen,
Genghua Fan,
Xingxing Yu:
Cycles in 4-connected planar graphs.
Eur. J. Comb. 25(6): 763-780 (2004) |
| 25 | EE | Jun Xu,
Abhishek Kumar,
Xingxing Yu:
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks.
IEEE Journal on Selected Areas in Communications 22(1): 151-163 (2004) |
| 24 | EE | Xingxing Yu:
Infinite paths in planar graphs I: Graphs with radial nets.
Journal of Graph Theory 47(2): 147-162 (2004) |
| 23 | EE | Liang Sun,
Xingxing Yu:
Positively curved cubic plane graphs are finite.
Journal of Graph Theory 47(4): 241-274 (2004) |
| 22 | EE | Guantao Chen,
Jun Xu,
Xingxing Yu:
Circumference of Graphs with Bounded Degree.
SIAM J. Comput. 33(5): 1136-1170 (2004) |
| 2003 |
|---|
| 21 | EE | Abhishek Kumar,
Shashidhar Merugu,
Jun Xu,
Xingxing Yu:
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network.
ICNP 2003: 258-267 |
| 20 | EE | Sean Curran,
Orlando Lee,
Xingxing Yu:
Chain decompositions and independent trees in 4-connected graphs.
SODA 2003: 186-191 |
| 19 | EE | Guantao Chen,
Ronald J. Gould,
Xingxing Yu:
Graph Connectivity After Path Removal.
Combinatorica 23(2): 185-203 (2003) |
| 18 | EE | Sean Curran,
Xingxing Yu:
Nonseparating Cycles in 4-Connected Graphs.
SIAM J. Discrete Math. 16(4): 616-629 (2003) |
| 2002 |
|---|
| 17 | EE | Guantao Chen,
Xingxing Yu:
A note on fragile graphs.
Discrete Mathematics 249(1-3): 41-43 (2002) |
| 16 | EE | Guantao Chen,
Xingxing Yu:
Long Cycles in 3-Connected Graphs.
J. Comb. Theory, Ser. B 86(1): 80-99 (2002) |
| 1998 |
|---|
| 15 | EE | Zhicheng Gao,
Xingxing Yu:
Tutte cycles in circuit graphs.
Discrete Mathematics 182(1-3): 113-124 (1998) |
| 14 | EE | Xingxing Yu:
Subdivisions in Planar Graphs.
J. Comb. Theory, Ser. B 72(1): 10-52 (1998) |
| 1997 |
|---|
| 13 | EE | Zhicheng Gao,
Xingxing Yu:
Convex Programming and Circumference of 3-Connected Graphs of Low Genus.
J. Comb. Theory, Ser. B 69(1): 39-51 (1997) |
| 12 | EE | Robin Thomas,
Xingxing Yu:
Five-Connected Toroidal Graphs Are Hamiltonian.
J. Comb. Theory, Ser. B 69(1): 79-96 (1997) |
| 1995 |
|---|
| 11 | | Yoshimi Egawa,
Katsuhiro Ota,
Akira Saito,
Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph.
Combinatorica 15(3): 357-364 (1995) |
| 1994 |
|---|
| 10 | EE | Pavol Hell,
Xingxing Yu,
Huishan Zhou:
Independence ratios of graph powers.
Discrete Mathematics 127(1-3): 213-220 (1994) |
| 9 | EE | Hong-Jian Lai,
Xingxing Yu,
Cun-Quan Zhang:
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory, Ser. B 60(2): 177-194 (1994) |
| 8 | EE | Robin Thomas,
Xingxing Yu:
4-Connected Projective-Planar Graphs Are Hamiltonian.
J. Comb. Theory, Ser. B 62(1): 114-132 (1994) |
| 1992 |
|---|
| 7 | EE | Robert L. Hemminger,
Xingxing Yu:
On 3-connected graphs with contractible edge covers of size k.
Discrete Mathematics 101(1-3): 115-133 (1992) |
| 6 | EE | M. R. Hart,
Xingxing Yu:
On a problem of Hendry.
Discrete Mathematics 102(1): 107-108 (1992) |
| 5 | EE | Xingxing Yu:
On several symmetry conditions for graphs.
Discrete Mathematics 102(1): 51-59 (1992) |
| 4 | EE | Xingxing Yu:
Ends in spanning trees.
Discrete Mathematics 104(3): 327-328 (1992) |
| 3 | EE | Xingxing Yu:
Cyclomatic numbers of connected induced subgraphs.
Discrete Mathematics 105(1-3): 275-284 (1992) |
| 2 | EE | Xingxing Yu:
Non-separating cycles and discrete Jordan curves.
J. Comb. Theory, Ser. B 54(1): 142-154 (1992) |
| 1990 |
|---|
| 1 | EE | Xingxing Yu:
On neighbourhood line graphs.
Discrete Mathematics 91(3): 295-309 (1990) |
