Yuma TAMURA（田村 祐馬）

Refereed Papers in Journals

1. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Decremental optimization of vertex-coloring under the reconfiguration framework,
   International Journal of Computer Mathematics: Computer Systems Theory, vol. 8(1), pp. 80-92, April 2023
2. Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,
   Happy set problem on subclasses of co-comparability graphs,
   Algorithmica, vol. 85(11), pp. 3327-3347, November 2023
3. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Approximability of the independent feedback vertex set problem for bipartite graphs,
   Theoretical Computer Science, vol. 849, pp. 227-236, January 2021
4. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Algorithms for the independent feedback vertex set problem,
   IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E98-A(6), pp. 1179-1188, June 2015

Refereed Papers in International Conferences

1. Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Parameterized complexity of weighted target set selection,
   in Proceedings of Theory and Applications of Models of Computation - 18th Annual Conference (TAMC 2024),
   Lecture Notes in Computer Science (LNCS), to appear.
2. Naoki Domon, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   The shortest path reconfiguration problem based on relaxation of reconfiguration rules,
   in Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024),
   Lecture Notes in Computer Science (LNCS), vol. 14549, pp. 227-241, February 2024
3. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   On the complexity of list $\mathcal H$-packing for sparse graph classes,
   in Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024),
   Lecture Notes in Computer Science (LNCS), vol. 14549, pp. 421-435, February 2024
4. Kota Kumakura, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   On the routing problems in graphs with ordered forbidden transitions,
   in Proceedings of the 29th International Computing and Combinatorics Conference (COCOON2023),
   Lecture Notes in Computer Science (LNCS), vol. 14422, pp. 359-370, December 2023
5. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Parameterized complexity of optimizing list vertex-coloring through reconfiguration,
   in Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM2023),
   Lecture Notes in Computer Science (LNCS), vol. 13973, pp. 279-290, March 2023
6. Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,
   Happy set problem on subclasses of co-comparability graphs,
   in Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM2022),
   Lecture Notes in Computer Science (LNCS), vol. 13174, pp. 149-160, March 2022
7. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Decremental optimization of vertex-coloring under the reconfiguration framework,
   in Proceedings of the 27th International Conference on Computing and Combinatorics (COCOON 2021),
   Lecture Notes in Computer Science (LNCS), vol. 13025, pp. 355-366, October 2021
8. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Minimization and parameterized variants of vertex partition problems on graphs,
   in Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020),
   Leibniz International Proceedings in Informatics (LIPIcs), vol. 181, pp. 40:01-40:13, December 2020
9. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Approximability of the independent feedback vertex set problem for bipartite graphs,
   in Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM2020),
   Lecture Notes in Computer Science (LNCS), vol. 12049, pp. 286-295, March 2020
10. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Deterministic algorithms for the independent feedback vertex set problem,
    in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),
    Lecture Notes in Computer Science (LNCS), vol. 8986, pp. 351-363, October 2014

Other Manuscripts in International Conferences

1. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   The independent feedback vertex set problem,
   in Proceedings of the 17th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2014), pp.11-18, July 2014

Other Manuscripts or Talks in Domestic Conferences, Symposiums, etc.

1. Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Algorithms for weighted target set selection,
   2024年電子情報通信学会総合大会 COMP-AFSA学生シンポジウム, DS-2-07
   （2024/3/5-6 広島県東広島市）
2. 菅 達皓，鈴木 顕，田村 祐馬，周 暁，
   遷移ルールの緩和に基づく独立集合遷移問題,
   2024年電子情報通信学会総合大会 COMP-AFSA学生シンポジウム, DS-2-02
   （2024/3/5-6 広島県東広島市）
3. 鈴木 隆央，鈴木 顕，田村 祐馬，周 暁，
   点重み付きグラフにおける標的集合選択問題に関する研究,
   情報処理学会 第196回アルゴリズム研究会, vol. 2024-AL-196(8), pp. 1-6, 2024年1月
   （2024/1/20-21 東京都文京区）
4. Naoki Domon, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Shortest path reconfiguration with relaxed constraints,
   情報処理学会 第196回アルゴリズム研究会, vol. 2024-AL-196(6), pp. 1-7, 2024年1月
   （2024/1/20-21 東京都文京区）
5. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   List variants of packing problems on sparse graphs,
   情報処理学会 第196回アルゴリズム研究会, vol. 2024-AL-196(5), pp. 1-7, 2024年1月
   （2024/1/20-21 東京都文京区）
6. Kota Kumakura, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   On the problems of finding paths to avoid ordered forbidden transitions based on graph structure,
   情報処理学会 第195回アルゴリズム研究会, vol. 2023-AL-195(24), pp. 1-5, 2023年11月
   （2023/11/16-17 沖縄県那覇市）
7. Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,
   Algorithms for happy set problem on interval graphs and permutation graphs,
   情報処理学会 第186回アルゴリズム研究会, vol. 2022-AL-186(7), pp. 1-5, 2022年1月
   （2022/1/27-28 オンライン開催）
8. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou,
   Optimization variant of vertex-coloring reconfiguration problem,
   情報処理学会 第185回アルゴリズム研究会, vol. 2021-AL-185(13), pp. 1-5, 2021年11月
   （2021/11/18-19 オンライン開催）
9. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Minimizing a vertex set satisfying specific graph properties,
   情報処理学会 第180回アルゴリズム研究会, vol. 2020-AL-180(4), pp. 1-7, 2020年11月
   （2020/11/25-26 オンライン開催）
10. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Approximation of the independent feedback vertex set problem,
    情報処理学会 第177回アルゴリズム研究会, vol. 2020-AL-177(10), pp. 1-5, 2020年3月
    （2020/3/16 宮城県仙台市 → 2020/5/9 オンライン振替開催）
11. 田村 祐馬，伊藤 健洋，周 暁，
    フィードバック独立点集合問題の近似困難性,
    京都大学 数理解析研究所 共同研究 （公開型）「数理計画問題に対する理論とアルゴリズムの研究」
    （2019/8/5-6 京都府京都市）
12. 田村 祐馬，伊藤 健洋，周 暁，
    フィードバック独立点集合問題の計算複雑性,
    情報処理学会 第78回全国大会講演論文集, vol. 2016(1), pp. 399-400, 2016年3月
    （2016/3/10-12 神奈川県横浜市）
13. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    The independent feedback vertex set problem,
    電子情報通信学会技術研究報告, vol. 114(80), pp. 13-18, 2014年6月
    （2014/6/13-14 愛媛県松山市）