List of Papers (発表論文)

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

[21] Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita,
Reconfiguring k-path vertex covers,
IEICE Transactions on Information and Systems,
to appear.
[20] Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa,
Max-min 3-dispersion problems,
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
vol. E104-A, no. 9, pp. 1101-1107, September 2021.
[19] Kei Kimura and Akira Suzuki,
Trichotomy for the reconfiguration problem of integer linear systems,
Theoretical Computer Science (TCS),
vol. 856, pp. 88-109, February 2021.
[18] Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
Diameter of colorings under Kempe changes,
Theoretical Computer Science (TCS),
vol. 838, pp. 45-57, October 2020.
[17] Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka,
Parameterized complexity of independent set reconfiguration problems,
Discrete Applied Mathematics (DAM),
vol. 283, pp. 336-345, September 2020.
[16] Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
Incremental optimization of independent sets under the reconfiguration framework,
Journal of Combinatorial Optimization (JOCO),
Published online, August 2020.
[15] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
Theoretical Computer Science (TCS),
vol. 806, pp. 553-566, February 2020.
[14] 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,
Journal of Graph Algorithms and Applications (JGAA),
vol. 23, no. 1, pp. 3-27, January 2019.
[13] Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa and 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.
[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,
vol. E101-A, no. 1, pp. 848-857, January 2018.
[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 (査読付き国際会議)

[32] Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka,
Sorting balls and water: equivalence and computational complexity,
Proceedings of the 11th International Conference on Fun with Algorithms (FUN 2022),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 226, pp. 16:1-16:17, 2022.
[31] Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima and Tsuyoshi Yagita,
Path cover problems with length cost,
Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022),
Lecture Notes in Computer Science (LNCS), vol. 13174, pp. 396-408, 2022.
[30] Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,
Happy set problem on subclasses of co-comparability graphs,
Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022),
Lecture Notes in Computer Science (LNCS), vol. 13174, pp. 149-160, 2022.
[29] Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,
Reconfiguration of spanning trees with degree constraint or diameter constraint,
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 219, pp. 15:1-15:21, 2022.
[28] Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou,
Decremental optimization of vertex-coloring under the reconfiguration framework,
Proceedings of the 27th International Computing and Combinatorics Conference (COCOON 2021),
Lecture Notes in Computer Science (LNCS), vol. 13025, pp. 355-366, 2021.
[27] Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler and Akira Suzuki,
Fixed-parameter algorithms for graph constraint logic,
Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 180, pp. 15:1-15:15, 2020.
[26] Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,
Reconfiguration of spanning trees with many or few leaves,
Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 173, pp. 24:1-24:15, 2020.
[25] Alexandre Blanché, Paul Ouvrard, Haruka Mizuta and Akira Suzuki,
Decremental optimization of dominating sets under the reconfiguration framework,
Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020),
Lecture Notes in Computer Science (LNCS), vol. 12126, pp. 69-82, 2020.
[24] Kei Kimura and Akira Suzuki,
Trichotomy for the reconfiguration problem of integer linear systems,
Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020),
Lecture Notes in Computer Science (LNCS), vol. 12049, pp. 336-341, 2020.
[23] Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita,
Reconfiguring k-path vertex covers,
Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020),
Lecture Notes in Computer Science (LNCS), vol. 12049, pp. 133-145, 2020.
[22] Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
Shortest reconfiguration of colorings under Kempe-changes,
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 154, pp. 35:1-35:14, 2020.
[21] Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
Diameter of colorings under Kempe changes,
Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
Lecture Notes in Computer Science (LNCS), vol. 11653, pp. 52-64, 2019.
[20] Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa,
Max-Min 3-dispersion Problems,
Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
Lecture Notes in Computer Science (LNCS), vol. 11653, pp. 291-300, 2019.
[19] Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
Incremental optimization of independent sets under the reconfiguration framework,
Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
Lecture Notes in Computer Science (LNCS), vol. 11653, pp. 313-324, 2019.
[18] Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
Algorithms for coloring reconfiguration under recolorability constraints,
Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 123, pp. 37:1-37:13, 2018.
[17] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018),
Lecture Notes in Computer Science (LNCS), vol. 10976, pp. 428-440, 2018.
[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),
Leibniz International Proceedings in Informatics (LIPIcs), vol. 92, pp. 62:1-62:12, 2017.
[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 (その他国際会議)

[12] Akira Suzuki,
Combinatorial reconfiguration applied to power distribution systems,
Proceedings of the Workshop on Combinatorial Reconfiguration, affiliated with the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021),
p. 13, 2021.
[11] Alexandre Blanché, Paul Ouvrard, Haruka Mizuta and Akira Suzuki,
Optimizing dominating sets under constrained transformation,
Proceedings of the fifth Bordeaux Graph Workshop (BGW 2019),
pp. 62-64, 2019.
[10] Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
Optimizing independent sets under constrained transformation,
The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019),
2019.
[9] Akira Suzuki,
On the dominating set reconfiguration problem,
The First Workshop on Development of Algorithmic Techniques for Combinatorial Reconfiguration (The first DATCORE workshop),
2018.
(Joint work with Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono and Youcef Tebbal.)
[8] 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.)
[7] Masanori Fukui, Koki Suetsugu and Akira Suzuki,
Complexity of "Goishi Hiroi",
Proceedings of the 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017),
pp. 131-132, 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. (学会・シンポジウム等)

[54] 鈴木 顕,
最適化遷移を用いた配電網の切替手順の算出,
組合せ遷移の展開に向けた計算機科学・工学・数学によるアプローチの融合, 第22回セミナー・勉強会, 2022.
(Joint work with 畠山 航, 伊藤 健洋, 周 暁, 杉村 修平, 田邊 隆之.)
[53] 小林 賢也,リン グオフイ,宮野 英次,斎藤 寿樹,鈴木 顕,歌島 侃勇,八木田 剛,
長さコスト付きパスカバー最大化問題の近似アルゴリズム,
2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), 情報社会を支える計算機科学の基礎理論, 2022.
[52] 伊藤 健洋,川原 純,宋 剛秀,鈴木 顕,照山 順一,戸田 貴久,
ZDDを用いた組合せ遷移ソルバーについての考察,
2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), 情報社会を支える計算機科学の基礎理論, 2022.
[51] 戸田 貴久,伊藤 健洋,川原 純,宋 剛秀,鈴木 顕,照山 順一,
有界モデル検査による独立集合遷移問題の解法に関する考察,
Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki and Junichi Teruyama,
On solving independent set reconfiguration problems with bounded model checking,
研究報告アルゴリズム(AL), 2022-AL-186(5), pp. 1-7, 2022.
[50] Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura,
Algorithms for happy set problem on interval graphs and permutation graphs,
研究報告アルゴリズム(AL), 2022-AL-186(7), pp. 1-5, 2022.
[49] 柳澤 佑介,鈴木 顕,田村 祐馬,周 暁,
グラフ彩色の最適化遷移問題について,
Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou,
Optimization variant of vertex-coloring reconfiguration problem,
研究報告アルゴリズム(AL), 2021-AL-185(13), pp. 1-5, 2021.
[48] 鈴木 顕,
暮らしに潜むアルゴリズム〜目には見えないすごいやつ〜,
弘前高校, 模擬講義, 2021.
[47] 佐藤 颯介,鈴木 顕,伊藤 健洋,周 暁,
区間グラフに対するハミルトン閉路遷移問題,
電子情報通信学会 2021年 総合大会 COMP 学生シンポジウム,DS-1-2, 2021.
[46] 鈴木 顕,
組合せ遷移を用いた配電網の切替手順の算出,
Akira Suzuki,
Combinatorial reconfiguration applied to the distribution network configuration,
京都大学, 2020年度通信情報システム談話会, Departmental Colloquium CCE 2020, 2021.
[45] 鈴木 顕,
アルゴリズムのチカラ 〜あなたのスマホはサクサク?もっさり?〜,
東北大学電気系公開講座, 2020年度オープンキャンパス 模擬講義, 2020.
[44] 川原 純,斎藤 寿樹,鈴木 顕,高瀬 敏行,山中 克久,
Treedepth Problemに対する厳密解アルゴリズム,
電子情報通信学会九州支部 2020年度(第28回)学生会講演会, 2020.
[43] 木村 慧,鈴木 顕,
整数計画における遷移問題の計算量,
日本応用数理学会, 2020年度 年会, 2020.
[42] 鈴木 顕,
異世界アルゴリズム,
LAシンポジウム会誌, 第75号, pp.23-26, 2020.
[41] 木村 慧,鈴木 顕,
整数計画における遷移問題の計算量,
日本応用数理学会, 第16回 研究部会連合発表会, 2020.
[40] 木村 慧,鈴木 顕,
Computational complexity of the reconfiguration problem of integer linear systems,
2019年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), アルゴリズムと計算理論の新潮流, 2020.
[39] Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita,
k-パス頂点被覆の遷移問題について,
九州地区におけるOR若手研究交流会, 日本オペレーションズ・リサーチ学会 九州支部, 2019.
[38] 鈴木 顕,
遷移最適化でより良い未来を目指そう,
第76回情報科学談話会, 東北大学, 2019.
[37] 杉村 修平,田邊 隆之,鈴木 顕,伊藤 健洋,周 暁,
放射状系統作成による配電損失最小化手法と切替手順の算出手法,
電力技術/電力系統技術合同研究会, 研究会資料, no. 2, PE-19-083, PSE-19-095, 2019.
[36] Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita,
Algorithms for k-path vertex cover reconfiguration problem,
H.A. デュック,鈴木 顕,八木田 剛,
kパス頂点被覆遷移問題に対するアルゴリズム,
電子情報通信学会技術研究報告, vol. 119, no. 191, COMP2019-17, pp. 35-42, 2019.
[35] Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka,
Shortest universal sequences of adjacent transpositions,
伊藤 健洋,川原 純,湊 真一,大舘 陽太,斎藤 寿樹,鈴木 顕,上原 隆平,宇野 毅明,山中 克久,吉仲 亮,
隣接互換による最短長ユニバーサル列,
電子情報通信学会技術研究報告, vol. 119, no. 191, COMP2019-10, pp. 1-5, 2019.
[34] 大澤 弘基,鈴木 顕,伊藤 健洋,周 暁,
点彩色の有向制約付き遷移問題について,
京都大学 数理解析研究所 共同研究 (公開型), 数理計画問題に対する理論とアルゴリズムの研究, 2019.
[33] 鈴木 顕,
組合せ遷移最適化について,
情報工学実践セミナー 特別講演, 九州工業大学, 2019.
[32] 岩本 裕二,水田 遥河,鈴木 顕,伊藤 健洋,周 暁,
グラフ上の経路固定サーバ割当問題のパラメータ複雑性,
Yuji Iwamoto, Haruka Mizuta, Akira Suzuki, Takehiro Ito, Xiao Zhou,
Parameterized complexity of the server assignment problem under a given routing table,
情報処理学会第81回全国大会, 6B-02, pp. 1-179-1-180, 2019.
[31] 菊池 正太,鈴木 顕,伊藤 健洋,周 暁,
グラフ上のパケットルーティング問題のパラメータ複雑性に関する研究,
Shota Kikuchi, Akira Suzuki, Takehiro Ito, Xiao Zhou,
Parameterized complexity of the packet routing problem on graphs,
情報処理学会第81回全国大会, 6B-01, pp. 1-177-1-178, 2019.
[30] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
研究報告アルゴリズム(AL), 2019-AL-171(4), pp. 1-6, 2019.
[29] Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou,
Linear-time algorithms for the generalized coloring reconfiguration problem,
大澤 弘基,鈴木 顕,伊藤 健洋,周 暁,
一般化彩色遷移問題に対する線形時間アルゴリズム,
電子情報通信学会技術研究報告, vol. 118, no. 356, COMP2018-32, pp. 7-14, 2018.
[28] Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa,
Max-min dispersion problems,
堀山 貴史,中野 眞一,齋藤 寿樹,末續 鴻輝,鈴木 顕,上原 隆平,宇野 毅明,和佐 州洋,
Max-min dispersion問題,
電子情報通信学会技術研究報告, vol. 118, no. 356, COMP2018-31, pp. 1-6, 2018.
[27] 小林 賢也,Guohui Lin,宮野 英次,斎藤 寿樹,鈴木 顕,八木田 剛,
パス長を限定したパスカバー問題,
若手の会セミナー2018, 情報処理学会九州支部, pp. 13-16, 2018.
[26] 鈴木 顕,
エネルギーを制限したしきい値回路の設計,
JST CREST ビッグデータ時代に向けた革新的アルゴリズム基盤,第16回全体会議, 2018.
(Joint work with Kei Uchizawa and Xiao Zhou.)
[25] 金野 駿人,鈴木 顕,山中 克久,伊藤 健洋,周 暁,
グラフの色付きトークン整列問題について,
Hayato Konno, Akira Suzuki, Katsuhisa Yamanaka, Takehiro Ito, Xiao Zhou,
Colored token swapping problem on graphs,
2017年度冬のLAシンポジウム, 数理解析研究所講究録, no. 2088, アルゴリズムと計算理論の基礎と応用 (Foundations and Applications of Algorithms and Computation) RIMS共同研究(公開型)報告集, pp. 53-62, 2018.
[24] Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou,
Complexity of coloring reconfiguration under recolorability constraints,
研究報告アルゴリズム(AL), 2017-AL-165(8), pp. 1-7, 2017.
[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: May 23, 2022