Conferences:

73. 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), to appear.

72. 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), to appear.

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

70. 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.)

69. 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.)

68. 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.)

67. 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.)

66. 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.)

65. 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.)

64. 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.)

63. 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.)

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

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

60. 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.)

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

58. 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.)

57. 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.)

56. 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.)

55. 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.)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

3. 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.)

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

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