Tamura Yuma

タムラユウマ | Tamura Yuma

Affiliation and department：
Homepage URL (1)： http://www.ecei.tohoku.ac.jp/alg/tamura

Research field (1)： Information theory

Research keywords (3)：グラフアルゴリズム , Parameterized Complexity , Combinatorial Reconfiguration

Research theme for competitive and other funds (2)：

Papers (17)：

Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou. Changing induced subgraph isomorphisms under extended reconfiguration rules. Proceedings of the 19th International Conference and Workshops on Algorithms and Computation (WALCOM 2025). 2025. To appear
Yuma Tamura, Akira Suzuki, Takaaki Mizuki. Card-based zero-knowledge proof protocols for the 15-Puzzle and the token swapping problem. Proceedings of the 11th ACM ASIA Public-Key Cryptography Workshop (APKC 2024). 2024. 11-22
Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou. Parameterized complexity of weighted target set selection. Proceedings of Theory and Applications of Models of Computation - 18th Annual Conference (TAMC 2024). 2024. 14637. 320-331
Yota Otachi, Akira Suzuki, Yuma Tamura. Finding induced subgraphs from graphs with small mim-width. Proceedings of the 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024). 2024. 294. 38:1-38:16
Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou. The shortest path reconfiguration problem based on relaxation of reconfiguration rules. Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024). 2024. 14549. 227-241

ｍore...

MISC (11)：

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou. List variants of packing problems on sparse graphs. 2024. 2024-AL-196. 5. 1-7
Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou. Shortest path reconfiguration with relaxed constraints. 2024. 2024-AL-196. 6. 1-7
鈴木隆央, 鈴木顕, 田村祐馬, 周暁. 点重み付きグラフにおける標的集合選択問題に関する研究. 情報処理学会第196回アルゴリズム研究会. 2024. 2024-AL-196. 8. 1-6
Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou. On the problems of finding paths to avoid ordered forbidden transitions based on graph structure. 2023. 2023-AL-195. 24. 1-5
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura. Algorithms for happy set problem on interval graphs and permutation graphs. 2022. 2022-AL-186. 7. 1-5

ｍore...

Lectures and oral presentations (5)：

Independent set reconfiguration under extended reconfiguration rules
(Combinatorial Reconfiguration Workshop 2024 2024)
Feedback vertex set discovery via reconfiguration
(夏のLAシンポジウム2024 2024)
Algorithms for weighted target set selection
(2024)
遷移ルールの緩和に基づく独立集合遷移問題
(2024年電子情報通信学会総合大会 COMP-AFSA学生シンポジウム 2024)
フィードバック独立点集合問題の近似困難性
(京都大学数理解析研究所共同研究 (公開型)「数理計画問題に対する理論とアルゴリズムの研究」 2019)

Professional career (1)：

Work history (2)：

Awards (3)：

2022/06 - Tohoku branch of Information Processing Society of Japan Noguchi Incentive Award
2021/06 - Information Processing Society of Japan IPSJ Computer Science Research Award for Young Scientists
2020/04 - The 14th International Conference and Workshop on Algorithms and Computation (WALCOM2020) The Best Student Paper Award

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page