The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xingxing Yu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  41. Preface. [Citation Graph (, )][DBLP]


  42. Bounds for pairs in partitions of graphs. [Citation Graph (, )][DBLP]


  43. A note on balanced bipartitions. [Citation Graph (, )][DBLP]


Search in 0.055secs, Finished in 0.056secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002