List of Papers (発表論文)

Refereed Papers in Journals (査読付き学術誌)

[12] 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,
to appear.
[11] Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara,
Complexity of tiling a polygon with trominoes or bars,
Discrete & Computational Geometry (DCG),
Vol. 58, Issue 3, pp. 686-704, October 2017.
[10] 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.
[9] 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.
[8] 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.
[7] 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 (TCS),
Vol. 651, Issue C, pp. 37-49, October 2016.
[6] Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa and Takeaki Uno,
Swapping labeled tokens on graphs,
Theoretical Computer Science (TCS),
Vol. 586, Issue C, pp. 81-94, June 2015.
[5] Takashi Hasegawa, Takehiro Ito, Akira Suzuki and Xiao Zhou,
Experimental evaluations of dynamic algorithm for maintaining shortest-paths trees on real-world networks,
Interdisciplinary Information Sciences (IIS),
Vol. 21, No. 1, pp. 25-36, March 2015.
[4] Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,
On the minimum caterpillar problem in digraphs,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E97.A, No. 3, pp. 848-857, March 2014.
[3] Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou,
On the rainbow connectivity of graphs: complexity and FPT algorithms,
Algorithmica,
Vol. 67, Issue 2, pp. 161-179, October 2013.
[2] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy and fan-in of logic circuits computing symmetric Boolean functions,
Theoretical Computer Science (TCS),
Vol. 505, pp. 74-80, September 2013.
[1] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy-efficient threshold circuits computing MOD functions,
International Journal of Foundations of Computer Science (IJFCS),
Vol. 24, Issue 01, pp. 15-29, January 2013.

Refereed Papers in International Conferences (査読付き国際会議)

[16] Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
Complexity of Coloring Reconfiguration under Recolorability Constraints,
Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017),
to appear.
[15] 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,
Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),
Lecture Notes in Computer Science (LNCS), Vol. 10167, pp. 435-447, 2017.
[14] Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
The complexity of (list) edge-coloring reconfiguration problem,
Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),
Lecture Notes in Computer Science (LNCS), Vol. 10167, pp. 347-358, 2017.
[13] Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou,
Competitive diffusion on weighted graphs,
Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015),
Lecture Notes in Computer Science (LNCS), Vol. 9214, pp. 422-433, 2015.
[12] Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal,
The complexity of dominating set reconfiguration,
Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015),
Lecture Notes in Computer Science (LNCS), Vol. 9214, pp. 398-409, 2015.
[11] Akira Suzuki, Amer E. Mouawad and Naomi Nishimura,
Reconfiguration of dominating sets,
Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014),
Lecture Notes in Computer Science (LNCS), Vol. 8591, pp. 405-416, 2014.
[10] Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa and Takeaki Uno,
Swapping labeled tokens on graphs,
Proceedings of the 7th International Conference on FUN with Algorithms (FUN 2014),
Lecture Notes in Computer Science (LNCS), Vol. 8496, pp. 364-375, 2014.
[9] Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka,
On the parameterized complexity for token jumping on graphs,
Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014),
Lecture Notes in Computer Science (LNCS), Vol. 8402, pp. 341-351, 2014.
[8] Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki,
On the parameterized complexity of reconfiguration problems,
Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013),
Lecture Notes in Computer Science (LNCS), Vol. 8246, pp. 281-294, 2013.
[7] Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,
On the minimum caterpillar problem in digraphs,
Proceedings of the workshop in 19th Annual International Computing and Combinatorics Conference (COCOON 2013),
Lecture Notes in Computer Science (LNCS), Vol. 7936, pp. 729-736, 2013.
[6] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy-efficient threshold circuits detecting global pattern in 1-dimensional arrays,
Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC 2013),
Lecture Notes in Computer Science (LNCS), Vol. 7876, pp. 248-259, 2013.
[5] Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara,
Packing trominoes is NP-complete, #P-hard and ASP-complete,
Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012),
pp. 219-224, 2012.
[4] Akira Suzuki, Kei Uchizawa and Takeaki Uno,
Hitori number,
Proceedings of the 6th International Conference on Fun with Algorithms (FUN 2012),
Lecture Notes in Computer Science (LNCS), Vol. 7288, pp. 334-345, 2012.
[3] Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou,
On the rainbow connectivity of graphs: complexity and FPT algorithms,
Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON 2011),
Lecture Notes in Computer Science (LNCS), Vol. 6842, pp. 86-97, 2011.
[2] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy and fan-in of threshold circuits computing Mod functions,
Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011),
Lecture Notes in Computer Science (LNCS), Vol. 6648, pp. 154-163, 2011.
[1] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy-efficient threshold circuits computing Mod functions,
Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS 2011),
Conferences in Research and Practice in Information Technology (CRPIT), Vol. 119, pp. 105-110, 2011.

Other Manuscripts in International Conferences (その他国際会議)

[7] Masanori Fukui, Koki Suetsugu and Akira Suzuki,
Complexity of "Goishi Hiroi",
The 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017),
2017.
[6] 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.)
[5] Toshimitsu Anzai, Takehiro Ito, Akira Suzuki and Xiao Zhou,
The multi-service center decision problem is NP-complete for split graphs,
The 2016 International Conference on Applied and Engineering Mathematics (AEM 2016),
2016.
[4] Akira Suzuki,
Algorithms for maintaining shortest-paths trees on real-world networks,
Data Science in Life Science and Engineering Collaboration and Symposium,
2015.
(Joint work with Takashi Hasegawa, Takehiro Ito and Xiao Zhou.)
[3] Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,
Algorithm for the minimum caterpillar problem with terminals,
Proceedings of the 6th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2013),
p. 25, 2013.
[2] Akira Suzuki, Kei Uchizawa and Xiao Zhou,
Energy-efficient threshold circuits detecting global pattern in 1-dimensional arrays,
Proceedings of the 6th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2013),
p. 17, 2013.
[1] Akira Suzuki,
Energy-efficient threshold circuits computing Mod functions,
The Joint International Conference of 5th International Symposium and 4th Student Organizing International Mini-Conference on Information Electronics Systems,
PR-41, pp. 262-263, 2012.
(Joint work with Kei Uchizawa and Xiao Zhou.)

Domestic Conferences, symposiums, etc. (学会・シンポジウム等)

[23] 間庭 宏貴,大木 貴之,鈴木 顕,内澤 啓,周 暁,
一般化対称関数を計算するエネルギー効率の良いしきい値回路に関する研究,
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.
[22] 鈴木 顕,
遷移問題に対するアルゴリズム,
2016年度第2回報数物研究会, 2016.
[21] 鈴木 顕,
グラフの彩色遷移問題の一般化,
JST CREST ビッグデータ時代に向けた革新的アルゴリズム基盤,第8回全体会議, 2016.
(Joint work with Hiroki Osawa, Takehiro Ito and Xiao Zhou.)
[20] Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno,
Computational complexity of sequential token swapping problem,
山中 克久,エリック ドメイン,堀山 貴史,河村 彰星,中野 眞一,岡本 吉央,斎藤 寿樹,鈴木 顕,上原 隆平,宇野 毅明,
シーケンシャルな交換による色付きトークン整列問題の計算複雑さ,
電子情報通信学会技術研究報告,Vol.116, No.116, COMP2016-13, pp. 115-121, 2016.
[19] 鈴木 顕,
マイナンバーで遊んでみた,
LAシンポジウム会誌, 第66号, pp.2-7, 2016.
[18] Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou,
Algorithm for the generalized coloring reconfiguration problem,
研究報告アルゴリズム(AL), 2016-AL-156(1), pp. 1-7, 2016.
[17] Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou,
Computational complexity of competitive diffusion on (un)weighted graphs,
研究報告アルゴリズム(AL), 2015-AL-154(8), pp. 1-6, 2015.
[16] Arash Haddadan,伊藤 健洋,Amer E. Mouawad,Naomi Nishimura,小野 廣隆,鈴木 顕,Youcef Tebbal,
支配集合遷移問題に対するアルゴリズム,
電子情報通信学会技術研究報告,Vol.115, No.15, COMP2015-1, pp. 1-7, 2015.
[15] 伊藤 健洋,Marcin Kamiński,小野 廣隆,鈴木 顕,上原 隆平,山中 克久,
FPT algorithms for token jumping on graphs,
研究報告アルゴリズム(AL), 2014-AL-148(2), pp. 1-4, 2014.
[14] Akira Suzuki,Amer E. Mouawad,Naomi Nishimura,
Reconfiguration of dominating sets,
鈴木 顕,Amer E. Mouawad,Naomi Nishimura,
支配集合の遷移可能性,
電子情報通信学会技術研究報告,Vol.114, No.19, COMP2014-5, pp. 29-35, 2014.
[13] Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno,
Swapping labeled tokens on graphs,
山中 克久,エリック ドメイン,伊藤 健洋,川原 純,清見 礼,岡本 吉央,斎藤 寿樹,鈴木 顕,内澤 啓,宇野 毅明,
グラフ上のラベル付きトークン整列問題,
電子情報通信学会技術研究報告,Vol.114, No.19, COMP2014-2, pp. 5-12, 2014.
[12] 大日野 肇,伊藤 健洋,鈴木 顕,内澤 啓,周 暁,
グラフの経路固定サーバ割当問題に関する研究,
Hajime Oohino, Takehiro Ito, Akira Suzuki, Kei Uchizawa, Xiao Zhou,
The server supply-assignment problem on graphs under a given routing table,
2013年度冬のLAシンポジウム, 数理解析研究所講究録, No. 1894, 計算理論とアルゴリズムの新潮流 (New Streams of Computation Theory and Algorithms) RIMS研究集会報告集, pp. 41-44, 2014.
[11] 岡田 卓,鈴木 顕,伊藤 健洋,周 暁,
Algorithm for the minimum caterpillar problem with terminals,
研究報告アルゴリズム(AL), 2012-AL-143(1), pp. 1-7, 2013.
[10] Akira Suzuki, Kei Uchizawa, Xiao Zhou,
Energy-efficient threshold circuits detecting global pattern in 1-dimensional arrays,
2012年度冬のLAシンポジウム, 数理解析研究所講究録, No. 1849, 理論計算機科学の新展開 (New Trends in Theoretical Computer Science) RIMS研究集会報告集, pp. 133-134, 2013.
[9] Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara,
On the complexity of packing trominoes,
堀山 貴史,伊藤 健洋,中束 渓太,鈴木 顕,上原 隆平,
トロミノ詰込問題の計算複雑さについて,
電子情報通信学会技術研究報告,Vol.112, No.272, COMP2012-40, pp. 37-43, 2012.
[8] Akira Suzuki,Kei Uchizawa,Takeaki Uno,
Hitori number,
鈴木 顕,内澤 啓,宇野 毅明,
ひとりにしてくれ数,
電子情報通信学会 2012年 総合大会 COMP 学生シンポジウム,DS-1-5, 2012.
[7] 鈴木 顕,内澤 啓,宇野 毅明,
ひとりにしてくれ数,
組合せゲーム・パズル ミニプロジェクト 第7回ミニ研究集会, 7-7, 2012.
[6] 鈴木 顕,
回路計算量理論に基づいた脳の計算原理の解明,
列挙学校, ポスターセッション, 2011.
[5] 鈴木 顕,
パズル「ひとりにしてくれ」について,
第14回列挙アルゴリズムセミナー, 14-2, 2011.
[4] Akira Suzuki, Kei Uchizawa, Xiao Zhou,
Energy and fan-in of threshold circuits computing Mod functions,
情報流通基盤分科会ワークショップ,ITRC Technical Report, No.52, pp. 42-49, 2011.
[3] Akira Suzuki, Kei Uchizawa, Xiao Zhou,
Energy and fan-in of threshold circuits computing Mod functions,
鈴木 顕,内澤 啓,周 暁,
剰余関数を計算するしきい値回路のエネルギー複雑度とファンイン,
電子情報通信学会 2011年 総合大会 COMP 学生シンポジウム,DS-1-4, 2011.
[2] Takanori Aoki, Takehiro Ito, Akira Suzuki, Kei Uchizawa, Xiao Zhou,
Hardness and FPT algorithm for the rainbow connectivity of graphs,
研究報告アルゴリズム(AL), 2011-AL-134(4), pp. 1-8, 2011.
[1] Akira Suzuki, Kei Uchizawa, Xiao Zhou,
Energy-efficient threshold circuits computing Mod functions,
鈴木 顕,内澤 啓,周 暁,
剰余関数を計算するエネルギー複雑度の小さいしきい値回路,
電子情報通信学会技術研究報告,Vol.110, No.325, COMP2010-40, pp. 7-13, 2010.


Back to main page.
Last Updated: September 15, 2017