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 Electrical 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. 1995 - Dec. 1997,
    		• Assistant Professor, Education Center for Information Processing, Tohoku University, Japan
  • Jan. 1998 - Dec. 2000,
    		• Lecturer, 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
  • Apr. 2010 - present,
    		• Professor, Graduate School of Information Sciences, Tohoku University, Japan
  • Apr. 2011 - Mar. 2012,
    		• The head of System Information Sciences, Graduate School of Information Sciences, Tohoku University, Japan
  • Apr. 2012 - Mar. 2013,
    		• The head of Information Course, Department of Electrical, Information and Physics Engineering, Tohoku University, Japan
  • Apr. 2021 - Mar. 2025,
    		• The head of Information Course, Department of Electrical, Information and Physics Engineering, Tohoku University, Japan
  • Apr. 2022 - Mar. 2024,
    		• The head of System Information Sciences, Graduate School of Information Sciences, Tohoku University, Japan

    Return to the top

Teaching
  • 1998 - present
    		•  Introduction of Algorithms (Tohoku University)
  • 2004 - 2012,
    		• 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
  • 2025
    		• Best Paper Award (WALCOM 2025)
  • 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

Former Graduate Students (Ph.D.):

  • Yuma Tamura (Ph.D., 2021)
  • Haruka Mizuta (Ph.D., 2020)
  • Hiroki Osawa (Ph.D., 2020)
  • Tatsuhiko Hatanaka (Ph.D., 2019)
  • Akira Suzuki (Ph.D., 2013)
  • 松尾 悠生 (Ph.D., 2007)
  • 伊藤 健洋 (Ph.D., 2006)
  • 小泉 康一 (Ph.D., 2005)
  • Shuji Isobe (Ph.D., 2002)
  • 三浦 一之 (Ph.D., 2001)
  • 水木 敬明 (Ph.D., 2000)
  • Md. Saidur Rahman (Ph.D., 1999)
  • 千田 栄幸 (Ph.D., 1998)
  • 草苅 良至 (Ph.D., 1998)
  • Md. Abul Kashem (Ph.D., 1998)

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
  • International Conference on Computer and Information Technology (ICCIT 2006), Dhaka, Bangladesh, December 21-23, 2006
  • The 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17-19, 2007
  • The 14th Annual International Computing and Combinatorics Conference (COCOON 2008), Dalian, China, June 27-29, 2008
  • The 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Hsinchu, Taiwan, March 22-24, 2023
  • The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa, Japan, March 13-15, 2024

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 Conferences:

  • European 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)
  • Scandinavian Workshop on Algorithm Theory (SWAT)

Return to the top

Research Grants (KAKENHI)
  • 2019 - 2022
    		•  Grant-in-Aid for Scientific Research (C), PI
    "Graph Ridesharing Problem and Its Applications" (¥1,500,000)
  • 2016 - 2019
    		•  Grant-in-Aid for Scientific Research (C), PI
    "Design Method of Graph Algorithm based on Tree Structure" (¥1,700,000)
  • 2011 - 2013
    		•  Grant-in-Aid for Scientific Research (C), PI
    "Study on a Design Method of Graph Partition Algorithm and Its Applications" (¥1,600,000)
  • 2007 - 2009
    		•  Grant-in-Aid for Scientific Research (C), PI
    "Design Theory of Algorithms for Partial k-Trees"
  • 2004 - 2006
    		•  Grant-in-Aid for Scientific Research (C), PI
    "Finding Algorithms to Solve Combination Problems on Partial k-Trees"

Return to the top

Publications

Journals:

  1. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    On the complexity of list H-packing for sparse graph classes,
    Theoretical Computer Science, Vol. 1052, October 2025. DOI:     10.1016/j.tcs.2025.115425

  2. Tatsuhiro Suga, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Changing induced subgraph isomorphisms under extended reconfiguration rules,
    Information and Computation, Vol. 307, November 2025. DOI: 10.1016/j.ic.2025.105367

  3. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Decremental Optimization of Vertex-Coloring under the Reconfiguration Framework,
    International Journal of Computer Mathematics: Computer Systems Theory, Vol. 8, pp. 80-92, April 2023. DOI: 10.1080/23799927.2023.2185543

  4. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs,
    Theoretical Computer Science, Vol. 849, pp. 227-236, January 2021. DOI: 10.1016/j.tcs.2020.10.026

  5. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    The Coloring Reconfiguration Problem on Specific Graph Classes,
    IEICE Trans. on Information and Systems, Vol. E102-D, No. 3, pp. 423-429, March 2019. DOI: 10.1587/transinf.2018FCP0005

  6. Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa and Xiao Zhou,
    Computational power of threshold circuits of energy at most two,
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101-A, No. 9, pp. 1431-1439, September 2018. DOI: 10.1587/transfun.E101.A.1431

  7. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters,
    Theoretical Computer Science, Vol. 739, pp. 65-79, August 2018. DOI: 10.1016/j.tcs.2018.05.005

  8. Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
    The Complexity of (List) Edge-Coloring Reconfiguration Problem,
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101-A, No. 1, pp.232-238, January 2018. DOI: 10.1587/transfun.E101.A.232

  9. Haruka Mizuta, Takehiro Ito and Xiao Zhou,
    Reconfiguration of Steiner Trees in an Unweighted Graph,
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E100-A, No. 7, pp. 1532-1540, July 2017. DOI: 10.1587/transfun.E100.A.1532

  10. 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), Vol. 32, No. 4, pp. 1288-1304, November 2016. DOI: 10.1007/s10878-015-9950-2

  11. 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. DOI: 10.1587/transinf.2015FCP0010

  12. 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. DOI: 10.1587/transfun.E98.A.1179

  13. 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. DOI: 10.1587/transfun.E98.A.1168

  14. 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. DOI: 10.4036/iis.2015.25

  15. 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. DOI: 10.1016/j.tcs.2014.01.007

  16. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou
    Reconfigure on list L(2,1)-labelings in a graph
    Theoretical Computer Science (TCS), 544, pp. 84-97, August 2014. DOI: 10.1016/j.tcs.2014.04.011

  17. Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    Bandwidth consecutive multicolorings of graphs
    Theoretical Computer Science (TCS), 532, pp. 64-72, May 2014. DOI: 10.1016/j.tcs.2013.02.015

  18. 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. DOI: 10.1587/transfun.E97.A.848

  19. 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. DOI: 10.1007/s00453-012-9689-4

  20. 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. DOI: 10.1016/j.tcs.2012.11.039

  21. 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. DOI: 10.1142/S0129054113400029

  22. Kei Uchizawa and Xiao Zhou
    Energy-efficient threshold circuits for comparison functions
    Interdisciplinary Information Sciences(IIS) , 18, pp. 161-166, January 2012. DOI: 10.4036/iis.2012.161

  23. 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. DOI: 10.1007/s00453-011-9573-7

  24. 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. DOI: 10.1007/s10878-011-9381-7

  25. 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. DOI: 10.1007/s00453-010-9485-y

  26. 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. DOI: 10.1587/transinf.E95.D.737

  27. 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. DOI: 10.1587/transinf.E94.D.190

  28. 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. DOI: 10.1142/S179383091000070X

  29. Takehiro Ito, Xiao Zhou and Takao Nishizeki
    Partitioning graphs with supply and demand
    Discrete Applied Math., 157 (2009), pp. 2620-2633. DOI: 10.1016/j.dam.2008.08.012

  30. Zhengbing Bian, Qianping Gu and Xiao Zhou
    Efficient algorithms for wavelength assignment on trees of rings
    Discrete Applied Mathematics, 157 (2009), pp. 875-889. DOI: 10.1016/j.dam.2008.04.021

  31. Xiao Zhou and Takao Nishizeki
    Orthogonal drawings of series-parallel graphs with minimum bends
    SIAM J. Discrete Math., 22(2008), pp. 1570-1604. DOI: 10.1137/060667621

  32. 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. DOI: 10.1016/j.jda.2008.03.002

  33. Yuki Matsuo, Xiao Zhou and Takao Nishizeki
    Sufficient condition and algorithm for list total colorings of series-parallel graphs
    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E90-A(2007), pp. 907-916. DOI: 10.1093/ietfec/e90-a.5.907

  34. 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. DOI: 10.1016/j.jda.2006.03.020

  35. 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. DOI: 10.1093/ietisy/e90-d.2.449

  36. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Total colorings of degenerate graphs
    Combinatorica, 27(2007), pp.167-182. DOI: 10.1007/s00493-007-0050-5

  37. 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. DOI: 10.1016/j.jda.2005.01.005

  38. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
    List total colorings of series- parallel graphs
    Journal of Discrete Algorithms, 3(2005), pp.47-60 DOI: 10.1016/j.jda.2003.12.006

  39. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partition trees of supply and demand
    International Journal of Foundations of Computer Science, 16(2005), pp. 803-827 DOI: 10.1142/S0129054105003303

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

  41. Xiao Zhou, Takao Nishizeki
    Multicoloring of series-parallel graphs
    Algorithmica, 38(2004), pp. 271-297 DOI: 10.1007/s00453-003-1060-3

  42. Xiao Zhou, Takao Nishizeki
    Algorithm for the cost edge-colorings of trees
    Journal of Combinatorial Optimization, 8(2004), pp. 97-108 DOI: 10.1023/B:JOCO.0000021940.40066.0c

  43. 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 DOI: 10.1587/e86-a_5_1034

  44. 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 DOI: 10.1587/e86-d_2_191

  45. 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

  46. 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 DOI: 10.1016/S0166-218X(01)00223-2

  47. 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 DOI: 10.1016/S0304-3975(99)00240-6

  48. 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

  49. 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 DOI: 10.1007/s004530010017

  50. Xiao Zhou, Syurei Tamura and Takao Nishizeki
    Finding edge-disjoint paths in partial k-trees
    Algorithmica, 26(2000), pp. 3-30 DOI: 10.1007/s004539910002

  51. 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 DOI: 10.1142/S0129054199000137

  52. 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 DOI: 10.7155/jgaa.00012

  53. 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 DOI: 10.1006/jctb.1998.1883

  54. 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

  55. 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 DOI: 10.1006/jagm.1996.0830

  56. Xiao Zhou, Shin-ichi Nakano and Takao Nishizeki
    Edge-coloring partial k-trees
    Journal of Algorithms, 21(1996), pp. 598-617 DOI: 10.1006/jagm.1996.0061

  57. Xiao Zhou, Hitoshi Suzuki and Takao Nishizeki
    A linear algorithm for edge-coloring series-parallel multigraphs
    Journal of Algorithms, 20(1996), pp. 174-201 DOI: 10.1006/jagm.1996.0008

  58. Xiao Zhou, Nobuaki Nagai and Takao Nishizeki
    Generalized vertex- rankings of trees
    Information Processing Letters, 56(1995), pp. 321-328. DOI: 10.1016/0020-0190(95)00172-7

  59. 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.

  60. Xiao Zhou, Shin-ichi Nakano and Takao Nishizeki,
    Edge-coloring partial k-trees
    Journal of Algorithms, 21(1996), pp. 598-617. DOI: 10.1006/jagm.1996.0061

Return to the top

Conferences:

  1. Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules,
    arXiv:2510.24226, October 2025.

  2. Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules,
    in Proceedings of the 36th International Symposium on Algorithms and Computation (ISAAC 2025), Leibniz International Proceedings in Informatics, 2025. DOI: 10.4230/LIPIcs.ISAAC.2025.39

  3. Tatsuhiro Suga, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules,
    in Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2025), Lecture Notes in Computer Science (LNCS), Vol. 15411, pp. 346-360, March 2025. (Best Paper Award) DOI: 10.1007/978-981-96-2845-2_22

  4. Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura and Xiao Zhou,
    Spanning Trees with a Small Vertex Cover: the Complexity on Specific Graph Classes,
    arXiv:2511.22912, November 2025. DOI: 10.48550/arXiv.2511.22912

  5. Takahiro Suzuki, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Parameterized Complexity of Weighted Target Set Selection,
    in Proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation (TAMC 2024), Lecture Notes in Computer Science (LNCS), Vol. 14637, pp. 320-331, 2024. DOI: 10.1007/978-981-97-2340-9_27

  6. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    On the complexity of list H-packing for sparse graph classes,
    in Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Lecture Notes in Computer Science (LNCS), Vol. 14549, pp. 421-435, March 2024. DOI: 10.1007/978-981-97-0566-5_30

  7. Naoki Domon, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules,
    in Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Lecture Notes in Computer Science (LNCS), Vol. 14549, pp. 227-241, March 2024. DOI: 10.1007/978-981-97-0566-5_17

  8. Kota Kumakura, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    On the Routing Problems in Graphs with Ordered Forbidden Transitions,
    in Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023), Lecture Notes in Computer Science (LNCS), Vol. 14422, pp. 359-370, December 2023. (Hawaii, December 15-17, 2023. Our presentation was on December 16.) DOI: 10.1007/978-3-031-49190-0_26

  9. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration,
    in Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science (LNCS), Vol. 13973, pp. 279-290, March 2023. (Hsinchu, Taiwan, March 22-24, 2023: Our presentation was on March 23.) DOI: 10.1007/978-3-031-27051-2_24

  10. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
    Decremental Optimization of Vertex-Coloring under the Reconfiguration Framework,
    in Proceedings of the 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science (LNCS), Vol. 13025, pp. 355-366, October 2021. (Taiwan, October 24-26, 2021: Our presentation was on October 26.) DOI: 10.1007/978-3-030-89543-3_30

  11. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Minimization and Parameterized Variants of Vertex Partition Problems on Graphs,
    in Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), Leibniz International Proceedings in Informatics, Vol. 181, pp. 40:1-40:13, 4 December 2020. (Hong Kong, December 14-18, 2020: Our presentation was on December 16.) DOI: 10.4230/LIPIcs.ISAAC.2020.40

  12. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs,
    in Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science, Vol. 12049, pp. 286-295, 2020. (Singapore, March 31 - April 2, 2020: Our presentation was on April 2.) DOI: 10.1007/978-3-030-39881-1_24

  13. Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    Reconfiguration of Minimum Steiner Trees via Vertex Exchanges,
    in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Leibniz International Proceedings in Informatics, Vol. 138, pp. 79:1-79:11, August 2019. (Aachen, Germany, August 26-30, 2019: Our presentation was on August 30.) DOI: 10.4230/LIPIcs.MFCS.2019.79

  14. Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
    Algorithms for Coloring Reconfiguration under Recolorability Constraints,
    In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics, Vol. 123, pp. 37:1-37:13, 2018. (Jiaoxi, Taiwan, December 16-19, 2018: Our presentation was on December 18.) DOI: 10.4230/LIPIcs.ISAAC.2018.37

  15. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    The Coloring Reconfiguration Problem on Specific Graph Classes,
    In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Lecture Notes in Computer Science, Vol. 10627, pp. 152-162, 2017. (Shanghai, China, December 16-18, 2017: Our presentation was on December 17.) DOI: 10.1007/978-3-319-71150-8_15

  16. Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
    Complexity of Coloring Reconfiguration under Recolorability Constraints,
    In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), Leibniz International Proceedings in Informatics, Vol. 92, pp. 62:1-62:12, 2017. (Phuket, Thailand, December 10-12, 2017: Our presentation was on December 10.) DOI: 10.4230/LIPIcs.ISAAC.2017.62

  17. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters,
    In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Leibniz International Proceedings in Informatics, Vol. 83, pp. 51:1-51:13, 2017. (Aalborg, Denmark, August 21-25, 2017: Our presentation was on August 22.) DOI: 10.4230/LIPIcs.MFCS.2017.51

  18. Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
    The Complexity of (List) Edge-Coloring Reconfiguration Problem,
    In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science, Vol. 10167, pp. 347-358, 2017. (Hsinchu, Taiwan, March 29-31, 2017: Our presentation was on March 30.) DOI: 10.1007/978-3-319-53925-6_27

  19. 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.) DOI: 10.1007/978-3-319-44543-4_13

  20. Toshimitsu Anzai, Takehiro Ito, Akira Suzuki and Xiao Zhou,
    The multi-service center decision problem is NP-complete for split graphs,
    In Proceedings of the 2016 International Conference on Applied and Engineering Mathematics (AEM 2016), 2016.

  21. 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.) DOI: 10.1007/978-3-319-21840-3_35

  22. 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 Applications (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.) DOI: 10.1007/978-3-319-12691-3_24

  23. 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 Applications (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.) DOI: 10.1007/978-3-319-12691-3_23

  24. 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 Algorithms (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.) DOI: 10.1007/978-3-319-19315-1_31

  25. Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,
    Reconfiguration of Vertex Covers in a Graph,
    In Proceedings of the 25th International Workshop on Combinatorial Algorithms (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.) DOI: 10.1007/978-3-319-19315-1_15

  26. 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. DOI: 10.1007/978-3-642-38768-5_66

  27. Akira Suzuki, Kei Uchizawa and Xiao Zhou,
    Energy-efficient threshold circuits detecting global pattern in 1-dimensional 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. DOI: 10.1007/978-3-642-38236-9_23

  28. Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,
    Generalized Rainbow Connectivity of Graphs,
    In Proc. of the 7th International Workshop on Algorithms and Computation (WALCOM'13), Lect. Notes in Computer Science, Springer, 7748, pp. 233-244, Feb., 2013. DOI: 10.1007/978-3-642-36065-7_22

  29. 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.

  30. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,
    Reconfiguration of list L(2,1)-labelings in a graph,
    In Proc. of the 23rd Annual International Symposium on Algorithms and Computation (ISAAC'12), Lect. Notes in Computer Science, Springer, 7676, pp. 34-43, Dec., 2012. DOI: 10.1007/978-3-642-35261-4_7

  31. 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. DOI: 10.4236/ojapps.2012.24B053

  32. 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. DOI: 10.1007/978-3-642-29700-7_11

  33. 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. DOI: 10.1007/978-3-642-22685-4_8

  34. 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. DOI: 10.1007/978-3-642-20877-5_16

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

  36. Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki,
    Minimum cost partitions of trees with supply and demand,
    In Proc. of the 21st Annual International Symposium on Algorithms and Computation (ISAAC'10), Lect. Notes in Computer Science, Springer, 6507, pp. 351-362, 2010. DOI: 10.1007/978-3-642-17514-5_30

  37. 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. DOI: 10.1007/978-3-642-14553-7_26

  38. 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. DOI: 10.1007/978-3-642-11440-3_5

  39. 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. DOI: 10.1007/978-3-642-10631-6_77

  40. 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. DOI: 10.1007/978-3-540-92182-0_20

  41. 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. DOI: 10.1007/11940128_14

  42. 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. DOI: 10.1007/11809678_9

  43. 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

  44. 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 DOI: 10.1007/11602613_18

  45. 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 DOI: 10.1007/11533719_81

  46. 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

  47. Takehiro Ito, Xiao Zhou, and Takao Nishizeki
    Partitioning graphs of supply and demand
    In Proc. of ISCAS 2005, pp.160-163, 2005. DOI: 10.1109/ISCAS.2005.1464549

  48. 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. DOI: 10.1109/IPDPS.2005.433

  49. 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 DOI: 10.1109/ICPADS.2004.92

  50. 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 DOI: 10.1007/978-3-540-30559-0_31

  51. 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 DOI: 10.1007/3-540-45071-8_19

  52. 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

  53. 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

  54. 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. DOI: 10.1007/3-540-36136-7_53

  55. 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. DOI: 10.1007/3-540-45655-4_46

  56. 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. DOI: 10.1007/3-540-45678-3_44

  57. 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. DOI: 10.1007/3-540-44679-6_32

  58. 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 DOI: 10.1007/3-540-48224-5_42

  59. 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 DOI: 10.1007/3-540-40996-3_15

  60. 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 DOI: 10.1007/3-540-46632-0_35

  61. 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

  62. 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

  63. 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 DOI: 10.1007/3-540-49381-6_44

  64. 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 DOI: 10.1007/10692760_9

  65. 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. DOI: 10.1109/ISPAN.1997.645078

  66. 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. DOI: 10.1007/BFB0045088

  67. 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 DOI: 10.1007/3-540-62559-3_31

  68. 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 DOI: 10.1007/BFb0009496

  69. 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 DOI: 10.1007/BFB0015439

  70. 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. DOI: 10.1007/bfb0030836

  71. 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.

  72. 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

  73. 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. DOI: 10.1109/ISPAN.1994.367150

  74. 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. DOI: 10.1007/BFb0049402

  75. 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. DOI: 10.1007/3-540-58325-4_182

  76. 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. DOI: 10.1007/3-540-58218-5_33

  77. 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.) DOI: 10.1007/3-540-57273-2_76

  78. 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.

  79. 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. DOI: 10.1007/BFb0023853

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. DOI: 10.1587/e83-d_3_407

  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. DOI: 10.1007/BFb0015243

Return to the top

Last updated: May 9, 2026
http://www.ecei.tohoku.ac.jp/zhou/