List of Papers in 2017

Refereed Papers in Journals

1. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto, Efficient Stabilization of Cooperative Matching Games,
   Theoretical Computer Science, Vol. 677, pp. 69-82, May 2017. DOI
2. Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki, On the parameterized complexity of reconfiguration problems,
   Algorithmica, Vol. 78, Issue 1, pp. 274-297, May 2017. DOI
3. 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
4. Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa and Takeaki Uno, Hitori numbers,
   Journal of Information Processing (JIP), Vol. 25, pp. 695-707, August 2017. DOI
5. Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara,
   Complexity of Tiling a Polygon with Trominoes or Bars,
   Discrete & Computational Geometry, Vol. 58, Issue 3, pp. 686-704, October 2017. DOI

Refereed Papers in International Conferences

1. Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano, Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs,
   in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),
   pp. 228-240, 2017. DOI
2. 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),
   pp. 347-358, 2017. DOI
3. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara and Takeaki Uno, Sequentially swapping colored tokens on graphs,
   in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),
   pp. 435-447, 2017. DOI
4. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto, Reconfiguration of Maximum-Weight b-Matchings in a Graph,
   in Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017),
   pp. 287-296, 2017. DOI
5. 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),
   pp. 51:1-51:13, 2017. DOI
6. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto and Taichi Shiitada, Tight Approximability of the Server Allocation Problem for Real-Time Applications,
   in Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017),
   pp. 41-55, 2017. DOI
7. 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),
   pp. 62:1-62:12, 2017. DOI
8. Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi, Complexity of the Multi-Service Center Problem,
   in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017),
   pp. 48:1-48:12, 2017. DOI
9. 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),
   pp. 152-162, 2017. DOI

Other Manuscripts in International Conferences

1. Akira Suzuki, Computational power of energy-efficient threshold circuits,
   2017 Bilateral Workshop between Tohoku University and National Tsing Hua University, 2017.
   (Joint work with Hiroki Maniwa, Kei Uchizawa and Xiao Zhou.)
2. Masanori Fukui, Koki Suetsugu and Akira Suzuki, Complexity of "Goishi Hiroi",
   in Proceedings of the 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017),
   pp. 131-132, 2017.
3. Akira Suzuki, Reduction tools on NCL,
   Banff International Research Station, Combinatorial Reconfiguration (17w5066), 2017.
   (Joint work with Hiroki Osawa, Yota Otachi, Takehiro Ito and Xiao Zhou.)

Domestic Conferences, symposiums, etc.

1. Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou, Complexity of coloring reconfiguration under recolorability constraints,
   研究報告アルゴリズム(AL), 2017-AL-165(8), pp. 1-7, 2017.
2. 間庭 宏貴，大木 貴之，鈴木 顕，内澤 啓，周 暁,
   一般化対称関数を計算するエネルギー効率の良いしきい値回路に関する研究,
   Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou, Energy-efficient threshold circuits computing generalized symmetric functions,
   2016年度冬のLAシンポジウム, 数理解析研究所講究録, No. 2040, 理論計算機科学の最先端 (Frontiers of Theoretical Computer Science) RIMS共同研究（公開型）報告集, pp. 21-26, 2017.