List of Papers in 2018

Refereed Papers in Journals

1. Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
   The Complexity of (List) Edge-Coloring Reconfiguration Problem,
   IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
   Vol. E101-A, No. 1, pp.232-238, January 2018. DOI
2. 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
3. Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, 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

Refereed Papers in International Conferences

1. Takehiro Ito and Yota Otachi,
   Reconfiguration of Colorable Sets in Classes of Perfect Graphs,
   in Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018),
   Leibniz International Proceedings in Informatics, Vol. 101, pp. 27:1-27:13, 2018. DOI
2. Tesshu Hanaka,Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
   Reconfiguring Spanning and Induced Subgraphs,
   in Proceedings of the 24th Annual International Computing and Combinatorics Conference (COCOON 2018),
   Lecture Notes in Computer Science, Vol. 10976, pp. 428-440, 2018. DOI
3. 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. DOI

Domestic Conferences, symposiums, etc.

1. 大澤 弘基，鈴木 顕，伊藤 健洋，周 暁,
   一般化彩色遷移問題に対する線形時間アルゴリズム,
   Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
   Linear-time algorithms for the generalized coloring reconfiguration problem,
   電子情報通信学会技術研究報告, vol. 118, no. 356, COMP2018-32, pp. 7-14, 2018.
2. 堀山 貴史，中野 眞一，齋藤 寿樹，末續 鴻輝，鈴木 顕，上原 隆平，宇野 毅明，和佐 州洋,
   Max-min dispersion問題,
   Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa,
   Max-min dispersion problems,
   電子情報通信学会技術研究報告, vol. 118, no. 356, COMP2018-31, pp. 1-6, 2018.
3. 金野 駿人，鈴木 顕，山中 克久，伊藤 健洋，周 暁,
   グラフの色付きトークン整列問題について,
   Hayato Konno, Akira Suzuki, Katsuhisa Yamanaka, Takehiro Ito and Xiao Zhou,
   Colored token swapping problem on graphs,
   2017年度冬のLAシンポジウム, 数理解析研究所講究録, no. 2088, アルゴリズムと計算理論の基礎と応用 (Foundations and Applications of Algorithms and Computation) RIMS共同研究（公開型）報告集, pp. 53-62, 2018.