The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xiao Zhou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:63-72 [Conf]
  2. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for Finding Distance-Edge-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:798-807 [Conf]
  3. Takehiro Ito, Takao Nishizeki, Xiao Zhou
    Algorithms for the Multicolorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:430-439 [Conf]
  4. Abul Kashem, Xiao Zhou, Takao Nishizeki
    Generalized Vertex-Rankings of Partial k-trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:212-221 [Conf]
  5. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
    List Total Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:172-181 [Conf]
  6. Xiao Zhou, Takao Nishizeki
    Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:288-297 [Conf]
  7. Xiao Zhou, Takao Nishizeki
    Simple Reduction of f-Colorings to Edge-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:223-228 [Conf]
  8. Xiao Zhou, Takao Nishizeki
    An Efficient Algorithm for Edge-Ranking Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:118-129 [Conf]
  9. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:409-418 [Conf]
  10. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Total Colorings of Degenerated Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:506-517 [Conf]
  11. Xiao Zhou, Hong Jia, Yanlin Lu, Weilong Ding
    Product Model Data Exchange Technology of Heterogeneous Systems in Collaborative Design Environment. [Citation Graph (0, 0)][DBLP]
    ICAT Workshops, 2006, pp:145-148 [Conf]
  12. Weilong Ding, Wei-tong Zhang, Xiao Zhou
    An Improved Algorithm Based on Sub-Structures for Creating Virtual Plant. [Citation Graph (0, 0)][DBLP]
    ICAT Workshops, 2006, pp:200-204 [Conf]
  13. Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
    Wavelength Assignment on Bounded Degree Trees of Rings. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:73-80 [Conf]
  14. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:129-145 [Conf]
  15. Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
    Tight Bounds for Wavelength Assignment on Trees of Rings. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  16. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Linear Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:347-356 [Conf]
  17. Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    Approximability of Partitioning Graphs with Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:121-130 [Conf]
  18. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning Trees of Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:612-623 [Conf]
  19. Xiao Zhou, Takao Nishizeki
    Finding Independent Spanning Trees in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:168-179 [Conf]
  20. Xiao Zhou, Takao Nishizeki
    Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:514-524 [Conf]
  21. Xiao Zhou, Takao Nishizeki
    Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:166-175 [Conf]
  22. Xiao Zhou, Takao Nishizeki
    Edge-Coloring and f-Coloring for Various Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:199-207 [Conf]
  23. Xiao Zhou, Takao Nishizeki
    Algorithms for Finding f-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:332-341 [Conf]
  24. Xiao Zhou, Takao Nishizeki
    The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:417-426 [Conf]
  25. Xiao Zhou, Syurei Tamura, Takao Nishizeki
    Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:203-212 [Conf]
  26. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning graphs of supply and demand. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:160-163 [Conf]
  27. Abul Kashem, Xiao Zhou, Takao Nishizeki
    An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:105-111 [Conf]
  28. Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
    An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:516-529 [Conf]
  29. Ronghua Liang, Zhongyu Chen, Xujia Qin, Xiao Zhou, Liang Tang
    Perception and emotion modeling of avatars in IVE. [Citation Graph (0, 0)][DBLP]
    SMC (3), 2004, pp:2871-2876 [Conf]
  30. Xiao Zhou, Takao Nishizeki
    Finding Optimal Edge-Rankings of Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:122-131 [Conf]
  31. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Parallel Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:359-369 [Conf]
  32. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:100-113 [Conf]
  33. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:365-376 [Conf]
  34. Xiao Zhou, Abul Kashem, Takao Nishizeki
    Generalized Edge-Ranking of Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:390-404 [Conf]
  35. Xiao Zhou, Takao Nishizeki
    Orthogonal drawings of series-parallel graphs with minimum bends. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:3-12 [Conf]
  36. Xiao Zhou, K. Fuse, Takao Nishizeki
    A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:227-243 [Journal]
  37. Xiao Zhou, Takao Nishizeki
    Multicolorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:271-297 [Journal]
  38. Xiao Zhou, Syurei Tamura, Takao Nishizeki
    Finding Edge-Disjoint Paths in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:3-30 [Journal]
  39. Takao Nishizeki, Jens Vygen, Xiao Zhou
    The edge-disjoint paths problem is NP-complete for series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:177-186 [Journal]
  40. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:171-194 [Journal]
  41. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning trees of supply and demand. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:803-827 [Journal]
  42. Xiao Zhou, Nobuaki Nagai, Takao Nishizeki
    Generalized Vertex-Rankings of Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:321-328 [Journal]
  43. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:598-617 [Journal]
  44. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:174-201 [Journal]
  45. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:359-374 [Journal]
  46. Xiao Zhou, Takao Nishizeki
    Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:1, pp:97-108 [Journal]
  47. Xiao Zhou, Takao Nishizeki
    Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:270-287 [Journal]
  48. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
    List total colorings of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:47-60 [Journal]
  49. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:304-322 [Journal]
  50. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:142-154 [Journal]
  51. Xiao Zhou, Takao Nishizeki
    Edge-Coloring and f-Coloring for Various Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:1, pp:- [Journal]
  52. Abul Kashem, Xiao Zhou, Takao Nishizeki
    Algorithms for generalized vertex-rankings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:407-427 [Journal]
  53. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Total Colorings Of Degenerate Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:167-182 [Journal]

  54. CFAR Method Based on Half Side Gaussian Model for Small Target Detection. [Citation Graph (, )][DBLP]


  55. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. [Citation Graph (, )][DBLP]


  56. Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. [Citation Graph (, )][DBLP]


  57. Small Grid Drawings of Planar Graphs with Balanced Bipartition. [Citation Graph (, )][DBLP]


  58. Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. [Citation Graph (, )][DBLP]


  59. Approved HG-CFAR Method for Infrared Small Target Detection. [Citation Graph (, )][DBLP]


  60. Efficient algorithms for wavelength assignment on trees of rings. [Citation Graph (, )][DBLP]


  61. Partitioning graphs of supply and demand. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.027secs
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