List of Papers in 2016

Refereed Papers in Journals

1. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno,
   A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares,
   Computational Geometry: Theory and Applications, Vol. 51, pp. 25-39, January 2016. DOI
2. 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
3. Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal,
   The Complexity of Dominating Set Reconfiguration,
   Theoretical Computer Science, Vol. 651, pp. 37-49, October 2016. DOI
4. Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad and Xiao Zhou,
   The Minimum Vulnerability Problem on Specific Graph Classes,
   Journal of Combinatorial Optimization, Vol. 32, Issue 4, pp. 1288-1304, November 2016. DOI
5. Akira Suzuki, Amer E. Mouawad and Naomi Nishimura,
   Reconfiguration of dominating sets,
   Journal of Combinatorial Optimization (JOCO), Vol. 32, Issue 4, pp. 1182-1195, November 2016. DOI

Refereed Papers in International Conferences

1. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
   Efficient Stabilization of Cooperative Matching Games,
   in Proceedings of the 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016),
   pp. 41-49, 2016. DOI
2. 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. DOI
3. Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano,
   Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs,
   in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016),
   Lecture Notes in Computer Science, Vol. 10043, pp. 270-284, 2016. DOI

Other Manuscripts in International Conferences

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 (AAAC2016), Session B1, 2016.
2. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,
   Regular Induced Subgraphs in Bipartite and Planar Graphs,
   in Proceedings of the 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016)，Paper Number 43, 2016.
3. Toshimitsu Anzai, Takehiro Ito, Akira Suzuki and Xiao Zhou,
   The Multi-Service Center Decision Problem is NP-Complete for Split Graphs,
   Presented in the 6th World Congress on Engineering and Technology (CET 2016)，Paper ID 80060, 2016.

Domestic Conferences, symposiums, etc.

1. 鈴木 顕，
   マイナンバーで遊んでみた,
   LAシンポジウム会誌, 第66号, pp.2-7, 2016.
2. 山中 克久，エリック ドメイン，堀山 貴史，河村 彰星，中野 眞一，岡本 吉央，斎藤 寿樹，鈴木 顕，上原 隆平，宇野 毅明,
   シーケンシャルな交換による色付きトークン整列問題の計算複雑さ,
   電子情報通信学会技術研究報告，Vol.116, No.116, COMP2016-13, pp. 115-121, 2016.
3. 鈴木 顕，
   グラフの彩色遷移問題の一般化,
   JST CREST ビッグデータ時代に向けた革新的アルゴリズム基盤，第8回全体会議, 2016.
4. 鈴木 顕，
   遷移問題に対するアルゴリズム,
   2016年度第2回報数物研究会, 2016.