Zhou Xiao

Affiliation and department：
Job title： Professor

Research field (1)： Information theory

Research theme for competitive and other funds (17)：

2019 - 2022 The Ridesharing Problem of Graphs and Its Applications
2016 - 2019 Research on Design Method of Graph Algorithm based on Tree Structure
2009 - 2014 Efficient Algorithms for Partitionings, Colorings and Drawings of Graphs and their Applications
2011 - 2013 Study on a Design Method of Graph Partition Algorithm and Its Applications
2007 - 2009 Design Theory of Algorithms for Partial k-Trees

Show all

Papers (133)：

Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. Parameterized Complexity of Weighted Target Set Selection. TAMC. 2024. 320-331
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou 0001. On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM. 2024. 421-435
Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou. On the Routing Problems in Graphs with Ordered Forbidden Transitions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2024. 14422 LNCS. 359-370
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou. Parameterized complexity of optimizing list vertex-coloring through reconfiguration. Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM2023). 2023. 13973. 279-290
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou. Decremental optimization of vertex-colouring under the reconfiguration framework. International Journal of Computer Mathematics: Computer Systems Theory. 2023. 8. 1. 80-92

ｍore...

MISC (58)：

HATANAKA TATSUHIKO, ITO TAKEHIRO, ZHOU XIAO. The Coloring Reconfiguration Problem on Specific Graph Classes (システム数理と応用). 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報. 2017. 117. 301. 23-27
Maniwa, Hiroki, Oki, Takayuki, Suzuki, Akira, Uchizawa, Kei, Zhou, Xiao. Energy-efficient Threshold Circuits Computing Generalized Symmetric Functions (Frontiers of Theoretical Computer Science). RIMS Kokyuroku. 2017. 2040. 2040. 21-26
MIZUTA HARUKA, ITO TAKEHIRO, ZHOU XIAO. Reachability between Steiner Trees in a Graph (コンピュテーション). 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報. 2016. 116. 116. 109-113
Hatanaka Tatsuhiko, Ito Takehiro, Zhou Xiao. DS-1-5 A Fixed-Parameter Algorithm for the List Coloring Reconfiguration Problem. Proceedings of the IEICE General Conference. 2016. 2016. 1. "S-8"-"S-9"
HATANAKA Tatsuhiko, ITO Takehiro, ZHOU Xiao. Reconfiguration of List Colorings in a Graph (Theoretical Foundations of Computing). IEICE technical report. Theoretical foundations of Computing. 2014. 114. 238. 19-24

ｍore...

Education (1)：

1992 - 1995 Tohoku University Graduate School of Information Sciences Department of System Information Sciences

Professional career (1)：

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page