畑中 達彦 (はたなか たつひこ / Tatsuhiko Hatanaka)





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



業績一覧

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

[2] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters,
Theoretical Computer Science, Vol. 739, pp. 65-79 (2018).
[1] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs,
IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E98-A, pp. 1168-1178 (2015).

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

[3] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The Coloring Reconfiguration Problem on Specific Graph Classes,
in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017),
Lecture Notes in Computer Science (LNCS), Vol. 10627, pp. 152-162, 2017.
[2] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters,
in Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017),
Leibniz International Proceedings in Informatics (LIPIcs), Vol. 83, pp. 51:1-51:13, 2017.
[1] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs,
in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014),
Lecture Notes in Computer Science (LNCS), Vol. 8881, pp. 314-328, 2014.

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

[7] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Reconfiguration of Satisfying Assignments for CSP,
第169回アルゴリズム研究会[8], 2018.
[6] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The Coloring Reconfiguration Problem on Specific Graph Classes,
第165回アルゴリズム研究会[AL-1], 2017.
[5] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters,
2017年度夏のLAシンポジウム[5], 2017.
[4] Tatsuhiko Hatanaka,
Open problem - Optimizing a Coloring via a Reconfiguration Sequence,
Combinatorial Reconfiguration (CoRe 2017), 2017.
[3] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
A Fixed-Parameter Algorithm for the List Coloring Reconfiguration Problem,
2016年電子情報通信学会総合大会講演論文集, 2016.
[2] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
The List Coloring Reconfiguration Problem for Graphs,
The First International Workshop on Combinatorial Reconfiguration (CoRe 2015), 2015.
[1] Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
Reconfiguration of List Colorings in a Graph,
電子情報通信学会技術研究報告,Vol.114, No.238, COMP2014-29, pp. 19-24, 2014.

受賞歴

2018年9月3日 情報処理学会
2018年度コンピュータサイエンス領域奨励賞
2016年3月25日 東北大学
電気・情報系優秀賞
2016年3月15日 電子情報通信学会
COMP-ELC学生シンポジウム 最優秀論文賞