Xiao Zhou
Xiao Zhou
Professor
Graduate School of Information Sciences
Tohoku University
Aobayama 6-6-05, Aoba-ku
Sendai 980-8579, Japan


Japanese


Hello and welcome to my Home Page.

Research Interests
Education
Professional Appointments
Teaching
Awards
Graduate Students
Activities
Publications

Research Interests


Education

    1. Ph.D. in Information Sciences, Tohoku University, Japan
      Advisor: Takao Nishizeki
      Thesis Topic: Efficient Algorithms for Edge-Coloring Graphs
    2. M.S. in Elcectrical Communication Engineering, Tohoku University, Japan
      Advisor: Takao Nishizeki
      Thesis Topic: Edge-Coloring Algorithms for Partial k-Trees
    3. B.E. in Computer Science, the East China Normal University, China

      Return to the top


Professional Appointments

  • Apr. 2010 - present
  • Professor, Graduate School of Information Sciences, Tohoku University, Japan
  • Jan. 2001 - Mar. 2010
  • Associate Professor, Graduate School of Information Sciences, Tohoku University, Japan
  • Jun. 2002 - Mar. 2003
  • Visiting Professor, School of Computing Science, Simon Fraser University, Canada
  • Jan. 1998 - Dec. 2000
  • Lecturer, Graduate School of Information Sciences, Tohoku University, Japan
  • Apr. 1995 - Dec. 1997
  • Assistant Professor, Education Center for Information Processing, Tohoku University, Japan

    Return to the top


Teaching

  • 1998 - present
  • Introduction of Algorithms (Tohoku University)
  • 2004 - present
  • Discrete Mathematics (Tohoku University)
  • 2004 - present
  • Algorithm and Data Structure (Tohoku University)
  • 1998 - 2003
  • C Programming (Tohoku University)
  • 1998 - 2001
  • Introduction of Information Processing (Tohoku University)

    Return to the top


Awards

  • 2012
  • Best Paper Award (FAW-AAIM 2012)
  • 2008
  • Best Paper Award (ISAAC 2008)
  • 2008
  • Achievement Award (IEICE)
  • 2004
  • Ishita Commemorative Award for Best Research Work
  • 1997
  • Niwa Commemorative Award for Best Research Work
  • 1994
  • TELECOM System Technology Student Award
  • 1992
  • IPSJ (Information Processing Society of Japan) Award for Promising Researchers

    Return to the top


Graduate Students Supervised

Current Graduate Students:

  • Takehiro Ito (Ph.D.)
  • Yuki Matsuo (Ph.D.)
  • Akira Kato (M.S.)

Former Graduate Students:

  • Shuji Isobe (Ph.D.,2002)
  • Md. Abul Kashem (Ph.D., 1998)
  • Akira Kato (M.S., 2005)
  • Yuki Matsuo (M.S., 2004)
  • Takehiro Ito (M.S., 2003)
  • Tomoya Fujino (M.S., 2003)
  • Kenta Sato (M.S., 2003)
  • Takashi Hikota (M.S.,2002)
  • Masanori Kabakura (M.S.,2002)
  • Takashi Hayashi (M.S.,2001)
  • Salahuddin Muhammad Salim Zabir (M.S.,2000)
  • Kazunari Kono (M.S.,2000)
  • Yasuaki Kanari (M.S.,1999)
  • Syurei Tamura (M.S., 1998)
  • Iki Fuse (M.S., 1997)
  • Luwen Zhao (M.S., 1996)
  • Nobuaki Nagai (M.S., 1996)

Return to the top


Activities

Associate Editor for Journals:

  • 2000 - 2001
  • IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, Special Section on Discrete Mathematics and Its Applications
  • 2001 - 2005
  • IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences

Program Committees:

  • The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Bergen, Norway, June 22-24, 2006
  • The 3rd International Conference on Innovative Applications of Information Technology for the Developing World (AACC 2005), Kathomandu, Nepal, December 10-12, 2005

Referee for Journals:

  • Algorithmica
  • Combinatorica
  • Discrete Applied Mathematics
  • IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences
  • Information Processing Letters
  • International Journal of Foundations of Computer Science
  • Journal of Algorithms
  • Journal of Combinatorial Optimization
  • Journal of Combinatorial Theory
  • Journal of Discrete Algorithms
  • Journal of Graph Algorithms and Applications
  • Theoretical Computer Science

Referee for Conference:

  • Europian Symposium on Algorithms (ESA)
  • International Conference on Computing and Combinatorics (COCOON)
  • International Conference on Computer and Information Technology (ICCIT)
  • International Symposium on Algorithms and Computation (ISAAC)
  • International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN)
  • International Workshop, Graph-Theoretic Concepts in Computer Science (WG)
  • Scandianavian Workshop on Algorithm Theory (SWAT)

Return to the top


Publications

Journals:

  1. Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad and Xiao Zhou,
    The Minimum Vulnerability Problem on Specific Graph Classes,
    Journal of Combinatorial Optimization (JCO), to appear.

  2. Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,
    Reconfiguration of Vertex Covers in a Graph,
    IEICE Trans. on Information and Systems, Vol. E99-D, No. 3, pp. 598-606, March 2016.

  3. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Algorithms for the Independent Feedback Vertex Set Problem,
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98-A, No. 6, pp. 1179-1188, June 2015.

  4. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs,
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98-A, No. 6, pp. 1168-1178, June 2015.

  5. Takashi Hasegawa, Takehiro Ito, Akira Suzuki and Xiao Zhou,
    Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks,
    Interdisciplinary Information Sciences(IIS), Vol. 21, No. 1, pp. 25-35, March 2015.

  6. Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,
    Generalized rainbow connectivity of graphs
    Theoretical Computer Science (TCS), 555, pp. 35-42, 23 October 2014.

  7. Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and Xiao Zhou
    Reconfigure on list L(2,1)-labelings in a graph
    Theoretical Computer Science (TCS), 544, pp. 84-97, August 2014.

  8. Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    Bandwidth consecutive multicolorings of graphs
    Theoretical Computer Science (TCS), 532, pp. 64-72, May 2014.

  9. Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou
    On the Minimum Caterpillar Problem in Digraphs
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 3, pp. 848-857, March 2014.

  10. Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou
    On the rainbow connectivity of graphs: complexity and FPT algorithms,
    Algorithmica, 67, Issue 2, pp. 161-179, October 2013.

  11. Akira Suzuki, Kei Uchizawa and Xiao Zhou
    Energy and fan-in of logic circuits computing symmetric Boolean functions
    Theoretical Computer Science (TCS), 505, pp. 74-80, September 2013.

  12. Akira Suzuki, Kei Uchizawa and Xiao Zhou
    Energy-efficient threshold circuits computing MOD functions
    International Journal of Foundations of Computer Science (IJFCS) , 24, pp. 15-29, January 2013.

  13. Kei Uchizawa and Xiao Zhou
    Energy-efficient threshold circuits for comparison functions
    Interdisciplinary Information Sciences(IIS) , 18, pp. 161-166, January 2012.

  14. Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki
    Minimum cost partitions of trees with supply and demand
    Algorithmica, 64, pp. 400-415, November 2012.

  15. Xiao Zhou, Takashi Hikino and Takao Nishizeki
    Small grid drawings of planar graphs with balanced partition
    Journal of Combinatorial Optimization, 24, pp. 99-115, August 2012.

  16. Takehiro Ito, Takao Nishizeki, Michael Schroder, Takeaki Uno and Xiao Zhou
    Partitioning a weighted tree into subtrees with weights in a given range
    Algorithmica, Vol. 62, Numbers 3-4, pp. 823-841, April 2012.

  17. Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    An improved sufficient condition for reconfiguration of list edge-colorings in a tree
    IEICE Trans. on Information and Systems, Vol. E95-D, No. 3, pp. 737-745, March 2012.

  18. Takehiro Ito, Naoki Sakamoto, Xiao Zhou and Takao Nishizeki
    Minimum cost edge-colorings of trees can be reduced to matchings
    IEICE Trans. on Information and Systems, Vol. E94-D, No. 2, pp. 190-195, February 2011.

  19. Xiao Zhou and Takao Nishizeki
    Convex drawings of internally triconnected plane graphs on $O(n^2)$ grids
    Discrete Mathematics, Algorithms and Applications, 2 (2010), pp. 347-362.

  20. Takehiro Ito, Xiao Zhou and Takao Nishizeki
    Partitioning graphs with supply and demand
    Discrete Applied Math., 157 (2009), pp. 2620-2633.

  21. Zhengbing Bian, Qianping Gu and Xiao Zhou
    Efficient algorithms for wavelength assignment on trees of rings
    Discrete Applied Mathematics, 157 (2009), pp. 875-889.

  22. Xiao Zhou and Takao Nishizek
    Orthogonal drawings of series-parallel graphs with minimum bends
    SIAM J. Discrete Math., 22(2008), pp. 1570-1604.

  23. Takehiro Ito, Erik D. Demaine, Xiao Zhou and Takao Nishizeki
    Approximability of partitioning graphs with supply and demand
    Journal of Discrete Algorithms, 6(2008), pp. 627-650.

  24. Yuki Matsuo, Xiao Zhou and Takao Nishizeki
    List total colorings of series-parallel graphs
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E90-A(2007), pp. 907-916.

  25. Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs
    Journal of Discrete Algorithms, 5(2007), pp.304-322.

  26. Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki
    Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
    IEICE Trans. on Information and Systems, E90-D(2007), pp.449-456.

  27. Shuji Isobe, Xiao Zhou,Takao Nishizeki
    Total colorings of degenerate graphs
    Combinatorica, 27(2007), pp.167-182.

  28. Takehiro Ito, Xiao Zhou and Takao Nishizeki
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
    Journal of Discrete Algorithms, 4(2006), pp.142-154.

  29. Xiao Zhou,Matsuo Yuki,Takao Nishizeki
    List total colorings of series- parallel graphs
    Journal of Discrete Algorithms, 3(2005), pp.47-60

  30. Takehiro Ito, Xiao Zhou,Takao Nishizeki
    Partition trees of supply and demand
    International Journal of Foundations of Computer Science, 16(2005), pp. 803-827

  31. Shuji Isobe, Xiao Zhou,Takao Nishizeki
    Cost total colorings of trees
    IEICE Trans. on Information and System, E87-D(2004), pp.337-342

  32. Xiao Zhou,Takao Nishizeki
    Multicoloring of series-parallel graphs
    Algorithmica, 38(2004), pp. 271-297

  33. Xiao Zhou,Takao Nishizeki
    Algorithm for the cost edge-colorings of trees
    Journal of Combinatorial Optimization, 8(2004), pp. 97-108

  34. Tomoya Fujino, Xiao Zhou,Takao Nishizeki
    List edge-colorings of series -parallel graphs
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E86-A(2003), pp. 1034-1045

  35. Takehiro Ito, Takao Nishizeki, Xiao Zhou
    Algorithms for multicolorings of partial k-trees
    IEICE Trans. on Information and Systems, E86-D(2003), pp. 191 -200

  36. Tomoya Fujino, Shuji Isobe, Xiao Zhou,and Takao Nishizeki
    Linear algorithm for finding list edge-colorings of series-parallel graphs
    IEICE Trans. on Information and Systems, E86-D(2003), pp. 186-190

  37. 藤野友也, 周暁, 西関隆夫
    t直辺列グラフをリスト辺彩色するアルゴリズム
    情報技術レターズ, 1(2002), pp. 21-22

  38. Takao Nishizeki, Jens Vygen and Xiao Zhou
    The edge-disjoint paths problem is NP-complete for series-parallel graphs
    Discrete Applied Mathematics,115(2001), pp. 177-186

  39. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki
    Algorithms for generalized vertex-rankings of partial k-trees
    Theoretical Computer Science, 240(2000), pp. 407-427

  40. Xiao Zhou, Yasuaki Kanari and Takao Nishizeki
    Generalized vertex- coloring of partial k-trees
    IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, E83-A(2000), pp. 671-678

  41. Xiao Zhou, Kazuki Fuse and Takao Nishizeki
    A linear algorithm for finding [g,f]-colorings of partial k-trees
    Algorithmica, 27 (2000), pp. 227-243

  42. Xiao Zhou, Syurei Tamura and Takao Nishizeki
    Finding edge-disjoint paths in partial k-trees
    Algorithmica, 26(2000), pp. 3-30

  43. Shuji Isobe, Xiao Zhou and Takao Nishizeki
    A polynomial-time algorithm for finding total colorings of partial k-trees
    International Journal of Foundations of Computer Science,10(1999), pp. 171-194

  44. Xiao Zhou and Takao Nishizeki
    Edge-coloring and f-colorings for various classes of graphs
    Journal of Graph Algorithms and Applications,3(1999), pp. 1-18

  45. Xiao Zhou and Takao Nishizeki
    Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
    Journal of Combinatorial Theory, Series B, 75(1999), pp. 270-287

  46. Xiao Zhou, Md. Abul Kashem and Takao Nishizeki
    Generalized edge- rankings of trees
    IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, E81-A(1998), pp. 310-320

  47. Xiao Zhou, Hitoshi Suzuki and Takao Nishizeki
    An NC parallel algorithm for edge-coloring series-parallel multigraphs
    Journal of Algorithms, 23(1997), pp. 359-374

  48. Xiao Zhou, Shin-ichi Nakano and Takao Nishizeki
    Edge-coloring partial k-trees
    Journal of Algorithms, 21(1996), pp. 598-617

  49. Xiao Zhou, Hitoshi Suzuki and Takao Nishizeki
    A linear algorithm for edge-coloring series-parallel multigraphs
    Journal of Algorithms, 20(1996), pp. 174-201

  50. Xiao Zhou, Nobuaki Nagai and Takao Nishizeki
    Generalized vertex- rankings of trees
    Information Processing Letters, 56(1995), pp. 321-328.

  51. Xiao Zhou and Takao Nishizeki
    Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees.
    IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, E78-A(1995), pp. 463-469.

Return to the top


Conferences:

  1. Haruka Mizuta, Takehiro Ito and Xiao Zhou,
    Reconfiguration of Steiner Trees in an Unweighted Graph,
    In Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Lecture Notes in Computer Science, Vol. 9843, pp. 163-175, 2016. (Helsinki, Finland, August 17-19, 2016: Our presentation was on August 17.)

  2. Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou,
    Competitive Diffusion on Weighted Graphs,
    In Proceedings of the 14th Algorithms and Data Structures Symposiums (WADS 2015), Lecture Notes in Computer Science, Vol. 9214, pp. 422-433, 2015. (Victoria, BC, Canada, August 5-7, 2015: Our presentation was on August 6.)

  3. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs,
    In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applicationss (COCOA 2014), Lecture Notes in Computer Science, Vol. 8881, pp. 314-328, 2014. (Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.)

  4. Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad and Xiao Zhou,
    The Minimum Vulnerability Problem on Graphs,
    In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applicationss (COCOA 2014), Lecture Notes in Computer Science, Vol. 8881, pp. 299-313, 2014. (Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.)

  5. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Deterministic Algorithms for the Independent Feedback Vertex Set Problem,
    In Proceedings of the 25th International Workshop on Combinatorial Algorithmss (IWOCA 2014), Lecture Notes in Computer Science, Vol. 8986, pp. 351-363, 2015. (Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 17.)

  6. Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,
    Reconfiguration of Vertex Covers in a Graph,
    In Proceedings of the 25th International Workshop on Combinatorial Algorithmss (IWOCA 2014), Lecture Notes in Computer Science, Vol. 8986, pp. 164-175, 2015. (Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 15.)

  7. Taku Okada, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    On the minimum caterpillar problem in digraphs,
    In Proceedings of the 19th Annual International Computing and Combinatorics Conference (COCOON'13), Lect. Notes in Computer Science, Springer, 7936, pp. 729-736, June 2013.

  8. Akira Suzuki, Kei Uchizawa and Xiao Zhou
    Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays,
    In Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC'13), Lect. Notes in Computer Science, Springer, 7876, pp. 248-259, May 2013.

  9. Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,
    Generalized Rainbow Connectivity of Graphs,
    In Proc. of the 7th International Workshop on Algorithms and Computatio (WALCOM'13), Lect. Notes in Computer Science, Springer, 7748, pp. 233-244, Feb., 2013

  10. Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou,
    Complexity of counting output patterns of logic circuits,
    In Proc. of the 19th edition of Computing: the Australasian Theory Symposium (CATS'13), 141, pp. 37-42, Jan. 2013.

  11. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,
    Reconfiguration of list L(2,1)-labelings in a graph,
    In Proc. of the 23th Annual International Symposium on Algorithms and Computation (ISAAC'12), Lect. Notes in Computer Science, Springer, 7676, pp. 34-43, Dec., 2012

  12. Yiming Li, Zhiqian Ye and Xiao Zhou
    Algorithm for cost non-preemptive scheduling of partial k-trees
    In Proceedings of the 2012 Symposium on Applied and Engineering Mathematics (AEM'12), pp. 233-236, Oct., 2012.

  13. Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    Algorithms for bandwidth consecutive multicolorings of graphs
    In Proceedings of FAW-AAIM 2012, Lect. Notes in Computer Science, Springer, 7285, pp. 117-128, 2012.

  14. Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, and Xiao Zhou
    On the rainbow connectivity of graphs: complexity and FPT algorithms
    In Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON'11), Lect. Notes in Computer Science, Springer, 6842, pp. 86-97, 2011.

  15. Akira Suzuki, Kei Uchizawa and Xiao Zhou
    Energy and fan-in of threshold circuits computing Mod functions
    In Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC'11), Lect. Notes in Computer Science, Springer, 6648, pp. 154-163, 2011.

  16. Akira Suzuki, Kei Uchizawa and Xiao Zhou
    Energy-efficient threshold circuits computing MOD functions
    In Proc. Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS'11), CRIPT Series, CRIPT, 119, 105-110, 2011.

  17. Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki
    Minimum cost partitions of trees with supply and demand
    In Proc. of the 21th Annual International Symposium on Algorithms and Computation (ISAAC'10), Lect. Notes in Computer Science, Springer, 6507, pp. 351-362, 2010.

  18. Takehiro Ito, Naoki Sakamoto, Xiao Zhou and Takao Nishizeki
    Minimum cost edge-colorings of trees can be reduced to matchings
    In Proc. of the 4th International Frontiers of Algorithmics Workshop (FAW 2010), Lect. Notes in Computer Science, Springer, 6213, pp. 274-284, 2010.

  19. Xiao Zhou, Takashi Hikino and Takao Nishizeki
    Grid drawings of planar graphs with balanced bipartition
    In Proc. of the 4th Workshop on Algorithms and Computation (WALCOM'10), Lect. Notes in Computer Science, Springer, 5942, pp. 47-57, 2010.

  20. Xiao Zhou and Takao Nishizeki
    Convex drawings of internally triconnected plane graphs on O(n^2) grids
    In Proc. of the 20th Annual International Symposium on Algorithms and Computation (ISAAC'09), Lect. Notes in Computer Science, Springer, 5878, pp. 760-770, 2009.

  21. Takehiro Ito, Takeaki Uno, Xiao Zhou and Takao Nishizeki
    Partitioning a weighted tree to subtrees of almost uniform size
    In Proc. of the 19th Annual International Symposium on Algorithms and Computation (ISAAC'08), Lect. Notes in Computer Science, Springer, 5369, pp. 196-207, 2008.

  22. Takehiro Ito, Erik Demaine, Xiao Zhou and Takao Nishizeki
    Approximability of partition graphs with supply and demand
    In Proc. of the 17th Annual International Symposium on Algorithms and Computation (ISAAC'06), Lect. Notes in Computer Science, Springer, 4288, pp. 121-130, 2006.

  23. Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki
    Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
    In Proc. of the 12th International Conference on Computing and Combinatorics (COCOON'06), Lect. Notes in Computer Science, Springer, 4112, pp. 63-72, 2006

  24. Yuki Matsuo, Xiao Zhou and Takao Nishizeki
    Sufficient condition and algorithm for list total colorings of series-parallel graphs
    In Proc. of the 9th Japan-Korea workshop on Algorithms and Computation (WAAC'06), pp. 49-56, 2006

  25. Xiao Zhou and Takao Nishizeki
    Orthogonal drawings of series-parallel graphs with minimum bends
    In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC'05), Lect. Notes in Computer Science, Springer, 3827, pp.~166-175, 2005

  26. Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs
    In Proc. of the 11th International Conference on Computing and Combinatorics (COCOON'05), Lect. Notes in Computer Science, Springer, 3595, pp.~798-807, 2005

  27. Takehiro Ito, Xiao Zhou and Takao Nishizeki
    Algorithm for partitioning graphs of bounded tree-width of supply and demand
    In Proc. of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (JH'05), pp.~114-121, 2005

  28. Takehiro Ito, Xiao Zhou, and Takao Nishizeki
    Partitioning graphs of supply and demand
    In Proc. of ISCAS 2005, pp.160-163, 2005.

  29. Zhengbing Bian, Qianping Gu and Xiao Zhou
    Tight Bounds for Wavelength Assignment on Trees of RingsIn Proc. of the 19th International Parallel and Distributed Processing Symposium} (IPDPS'05), CD-ROM, 2005.

  30. Z. Bian, Q. Gu and Xiao Zhou
    Wavelength assignment on bounded degree trees of rings
    In Proc. of the 10th International Conference on Parallel and Distributed Systems, pp.73-80, 2004

  31. Takehiro Ito, Xiao Zhou, and Takao Nishizeki
    Partitioning a weighted graph to connected subgraphs of almost uniform size
    In Proc. of WG 2004, Lecture Notes in Computer Science, 3353, pp.365-376, 2004

  32. Xiao Zhou,Yuki Matsuo and Takao Nishizeki
    List total colorings of series-parallel graphs
    In Proc. of COCOON 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2697, pp. 172-181, 2003

  33. Xiao Zhou,Yuki Matsuo and Takao Nishizeki
    Complexity and algorithm of list total colorings of series-parallel graphs
    In Proc. of the 7th Japan-Korea workshop on Algorithms and Computation,189-202, 2003

  34. Tomoya Fujino, Xiao Zhouand Takao Nishizeki
    List edge-colorings of series-parallel graphs
    In Proc. of the 3rd Japanese-Hungarian Symposiumon Discrete Mathematics and Its Applications,154-163, 2003

  35. Takehiro Ito, Xiao Zhou and Takao Nishizeki
    Partitioning trees of supply and demand
    In Proc. of the 13th Annual International Symposium on Algorithms and Computation, ISAAC'2002Lect. Notes in Computer Science, Springer,2518, pp.612-623, 2002.

  36. Takehiro Ito, Takao Nishizeki and Xiao Zhou
    Algorithm for the multicolorings of partial k-trees
    In Proc. of the 8th Annual International Conference on Computing and Combinatorics, COCOON'2002Lect. Notes in Computer Science, Springer,2387, pp.430-439, 2002.

  37. Xiao Zhou and Takao Nishizeki
    Efficient algorithm for weighted colorings of series-parallel graphs
    In Proc. of the 12th Annual International Symposium on Algorithms and Computation, ISAAC'2001Lect. Notes in Computer Science, Springer,2223, pp.514-524, 2001.

  38. Xiao Zhou and Takao Nishizeki
    Algorithm for the cost edge-coloring of trees
    In Proc. of the 7th Annual International Conference on Computing and Combinatorics, COCOON'2001Lect. Notes in Computer Science, Springer,2108, pp.288-297, 2001.

  39. Shuji Isobe, Xiao Zhou and Takao Nishizeki
    Total colorings of degenerated graphs,
    In Proc. of the 28th International Colloquiumon Automata, Languages and Programming,Lect. Notes in Computer Science, Springer,2076,506-517, 2001

  40. Xiao Zhou and Takao Nishizeki
    Finding independent spanning trees in partial k-trees,
    In Proc. of the 11th International Symposiumon Algorithms and Computation,Lect. Notes in Computer Science, Springer,1969,168-179,2000

  41. Shuji Isobe, Xiao Zhou and Takao Nishizeki
    A linear algorithm for finding total colorings of partial k-trees,
    In Proc. of the 10th International Symposiumon Algorithms and Computation,Lect. Notes in Computer Science, Springer,1741,347-356,1999

  42. Takao Nishizeki, Jens Vygen and Xiao Zhou
    The edge-disjoint paths problem is NP-complete for series-parallel graphs
    In Proc. of the First Japanese-Hungarian Symposiumon Discrete Mathematics and Its Applications,103-110,1999

  43. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki
    Algorithms for generalized edge-rankings of partial k-trees
    In Proc. of the First International Conference on Computer and Information Technology,45-51, 1998

  44. Xiao Zhou and Takao Nishizeki
    The edge-disjoint paths problem is NP- complete for partial k-trees
    In Proc. of the Sixth Annual International Symposiumon Algorithms and Computing, ISAAC'98,Lect. Notes in Computer Science, Springer,1533,417-426, 1998

  45. Shuji Isobe, Xiao Zhou and Takao Nishizeki
    A polynomial-time algorithm for finding total colorings of partial k-trees
    In Proc. of the 24th International Workshop, Graph-Theoretic Concepts in Computer Science,WG'98, Lect. Notes in Computer Science, Springer,1517, pp.100-113,1998

  46. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki
    An NC parallel algorithm for generalized vertex-rankings of partial k-trees
    In Proc. of the International Symposium on Parallel Architectures,Algorithms and Networks (I-SPAN'97), pp.105-111, 1997.

  47. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki
    Generalized vertex- rankings of partial k-trees
    In Proc. of the Third Annual International Conference on Computing and Combinatorics, Lect. Notes in Computer Science, Springer,1276, pp.212-221, 1997.

  48. Xiao Zhou, Md. Abul Kashem and Takao Nishizeki
    Generalized edge- rankings of trees
    In Proc. of the 22nd International Workshop, Graph-Theoretic Concepts in Computer Science,WG'96,Lect. Notes in Computer Science, Springer,1197, 309-404, 1997

  49. Xiao Zhou, Syurei Tamura and Takao Nishizeki
    Finding edge-disjoint paths in partial k-trees
    In Proc. of the Sixth Annual International Symposiumon Algorithms and Computing,Lect. Notes in Computer Science, Springer,1178, 203-212, 1996

  50. Xiao Zhou and Takao Nishizeki
    Algorithms for finding f-colorings of partial k-trees
    In Proc. of the Sixth Annual International Symposiumon Algorithms and Computing,ISAAC'95Lect. Notes in Computer Science, Springer,1004, 332-341, 1995

  51. Xiao Zhou and Takao Nishizeki
    Simple reduction of f-colorings to edge-colorings
    In Proc. of the First Annual International Conference on Computing and Combinatorics, COCOON'95Lect. Notes in Computer Science, Springer,959, pp.223-228, 1995.

  52. Xiao Zhou and Takao Nishizeki
    Finding optimal edge-rankings of trees.
    In Proc. of the Sixth Annual ACM/SIAM Symposium on Discrete Algorithm,pp.122-131, 1995.

  53. Xiao Zhou and Takao Nishizeki
    Finding optimal edge-rankings of trees.
    In Proc. of JSPS-NUS Seminar on Computing, (eds) H. Imai, W.F. Wong, K.F. Loe, "Advances in Computing Techniques", World Scientific, pp. 23-35, 1994

  54. Xiao Zhou and Takao Nishizeki
    Optimal parallel algorithm for edge- coloring partial k-trees with bounded degrees.
    In Proc. of the International Symposium on Parallel Architectures,Algorithms and Networks, pp.167-174, 1994.

  55. Xiao Zhou and Takao Nishizeki
    An efficient algorithm for edge-ranking trees.
    In Proc. of the Second Europian Symposium on Algorithms,Lect. Notes in Computer Science, Springer-Verlag,855, pp.118-129, 1994.

  56. Xiao Zhou and Takao Nishizeki
    Edge-coloring and f-coloring for various classes of graphs.
    In Proc. of the Fifth International Symposium on Algorithms and Computation,Lect. Notes in Computer Science, Springer-Verlag,834, pp.199-207, 1994.

  57. Xiao Zhou, Shin-ichi Nakano and Takao Nishizeki
    A parallel algorithm for edge-coloring partial k-trees.
    In Proc. of the Fourth Scandianavian Workshop on Algorithm Theory,Lect. Notes in Computer Science, Springer-Verlag,824, pp.359-369, 1994.

  58. Xiao Zhou, Shin-ichi Nakano, Hitoshi Suzuki and Takao Nishizeki
    A linear algorithm for edge-coloring partial k-trees.
    In Proc. of the First Europian Symposium on Algorithms,Lect. Notes in Computer Science, Springer-Verlag,726, pp.409-418, 1993.
    (It received the Best Paper Award.)

  59. Xiao Zhou, Hitoshi Suzuki and Takao Nishizeki
    Sequential and parallel algorithms for edge-coloring series-parallelmultigraphs.
    In Proc. of the Third Conference on Integer Programming and CombinatorialOptimiation, pp.129-145, 1993.

  60. Xiao Zhou, Shin-ichi Nakano, Hitoshi Suzuki and Takao Nishizeki
    An efficient algorithm for edge-coloring series-parallel multigraphs.
    In Proc. of LATIN'92, I. Simon (Ed.), Lect. Notes in Computer Science,Springer-Verlag, 583, pp.516-529, 1992.

Return to the top


Other Writing:

  1. Haruka Mizuta, Takehiro Ito and Xiao Zhou,
    Reachability between Steiner Trees in a Graph,
    In Proceedings of the 9th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2016), Session B1, 2016.
    (Taipei, Taiwan, May 14-16, 2016: Our presentation was on May 15

  2. Xiao Zhou, and Takao Nishizeki
    Graph Coloring Algorithms
    IEICE Trans. on Information and Systems, E83-D(2000), pp. 407-417

  3. Shin-ichi Nakano, Xiao Zhou and T.Nishizeki
    Edge-Coloring Algorithms
    Lect. Notes in Computer Science, Springer-Verlag, Special issue,1000 (1995), pp.172-183

Return to the top