水田　遥河 (みずた はるか / Haruka Mizuta)




東北大学 大学院情報科学研究科
システム情報科学専攻 知能情報科学講座
アルゴリズム論 （博士3年）

e-mail: haruka.mizuta.s4(at)dc.tohoku.ac.jp


業績一覧

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

[2] 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, to appear.
[1] Haruka Mizuta, Takehiro Ito and Xiao Zhou,
Reconfiguration of Steiner trees in an unweighted graph,
IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E100-A(7), pp. 1532-1540, 2017.

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

[5] Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Reconfiguration of minimum Steiner trees via vertex exchanges,
in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019),
Leibniz International Proceedings in Informatics (LIPIcs), Vol. 138, pp. 79:1-79:11, 2019.
[4] Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
Diameter of colorings under Kempe changes,
in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
Lecture Notes in Computer Science (LNCS), Vol. 11653, pp. 52-64, 2019.
[3] Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
Incremental optimization of independent sets under the reconfiguration framework,
in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
Lecture Notes in Computer Science (LNCS), Vol. 11653, pp. 313-324, 2019.
[2] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
in Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018),
Lecture Notes in Computer Science (LNCS), Vol. 10976, pp. 428-440, 2018.
[1] 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 (LNCS), Vol. 9843, pp. 163-175, 2016.

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

[4] 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),
Tokyo, Japan, May 2019.
[3] Haruka Mizuta, Takehiro Ito and Xiao Zhou
Reconfiguration of Steiner trees in specific graph classes,
The 3rd International Workshop on Combinatorial Reconfiguration (CoRe 2019),
Aussois, France, May 2019.
[2] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
The First Workshop on Development of Algorithmic Techniques for Combinatorial Reconfiguration (The first DATCORE workshop),
Lyon, France, July 2018.
[1] Haruka Mizuta, Takehiro Ito and Xiao Zhou,
Reachability between Steiner trees in a graph,
The 9th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2016),
Taipei, Taiwan, May 2016.

Domestic Conferences (国内会議)

[3] Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
Reconfiguring spanning and induced subgraphs,
第171回アルゴリズム研究会, 大阪府, 2019年1月.
[2] 水田　遥河,
遷移最適化問題について,
第28回列挙アルゴリズムセミナー, 群馬県, 2018年6月.
[1] Haruka Mizuta, Takehiro Ito and Xiao Zhou,
Reachability between Steiner trees in a graph,
情報処理学会・第158回アルゴリズム研究会, Vol. 2016-AL-158(16), 石川県, 2016年6月.

Experience (経験)

2019年4月 - JSPS 日本学術振興会特別研究員（DC2）
2018年4月 - 二国間交流事業DATCOREプロジェクト
2016年4月 - 2019年3月　 JST ERATO 河原林巨大グラフプロジェクト　RA