Tatsuya MATSUOKA

>>日本語版 (Japanese)

Doctoral Course Student
Department of Mathematical Informatics
Graduate School of Information Science and Technology
The University of Tokyo

Faculty of Engineering Building 14
7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-8656, Japan
E-mail: tatsuya_matsuoka [at] mist.i.u-tokyo.ac.jp

My supervisor: Professor Satoru Iwata

C.V.
March 2014
Bachelor of Engineering from Faculty of Engineering, The University of Tokyo.
March 2016
Master of Information Science and Technology from Graduate School of Information Science and Technology, The University of Tokyo.
Since April 2016
Doctoral Cource Student at Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo.
Since April 2016
Research Fellow of Japan Society for the Promotion of Science (DC1).
June 2014 - February 2016
Research Assistant, JST, ERATO, Kawarabayashi Large Graph Project.
Since April 2016
Research Collaborator, JST, ERATO, Kawarabayashi Large Graph Project.
Winter Semester of academic year 2014
Teaching Assistant, “Exercises in Mathematical Information Engineering 1B (Algorithms in Mathematical Engineering)”, Faculty of Engineering, The University of Tokyo.
S1/S2 Term of academic year 2016
Teaching Assistant, “Advanced Core in Linear Algebra”, Graduate School of Information Science and Technology, The University of Tokyo.
S1/S2 Term of academic year 2017
Teaching Assistant, “Advanced Core in Linear Algebra”, Graduate School of Information Science and Technology, The University of Tokyo.
A1/A2 Term of academic year 2017
Teaching Assistant, “Advanced Core in Algorithm Design”, Graduate School of Information Science and Technology, The University of Tokyo.
S1/S2 Term of academic year 2018
Teaching Assistant, “Advanced Core in Linear Algebra”, Graduate School of Information Science and Technology, The University of Tokyo.
Research Interests

Graph Algorithms / Combinatorial Optimization / Matroid Theory etc.

Publications

Refereed Journal Articles
  1. Tatsuya Matsuoka, Shin-ichi Tanigawa:
    On reachability mixed arborescence packing.
    Discrete Optimization, accepted.
  2. Than Nguyen Hau, Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi, Tatsuya Matsuoka, Yu Yokoi:
    Optimal cache placement for an academic backbone network.
    Journal of the Operations Research Society of Japan, 61 (2018), pp. 197–216.
  3. Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
    The generalized terminal backup problem.
    SIAM Journal on Discrete Mathematics, 29 (2015), pp. 1764–1782.
Proceeding
  1. Tatsuya Matsuoka, Shun Sato:
    Making bidirected graphs strongly connected.
    Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2017, pp. 387–396.
Technical Reports
  1. Tatsuya Matsuoka, Shin-ichi Tanigawa:
    On reachability mixed arborescence packing.
    arXiv, arXiv:1808.07332, August 2018.
  2. Tatsuya Matsuoka, Shun Sato:
    Making bidirected graphs strongly connected.
    arXiv, arXiv:1709.00824, September 2017.
  3. Tatsuya Matsuoka, Zoltán Szigeti:
    Polymatroid-based capacitated packing of branchings.
    Mathematical Engineering Technical Reports, METR 2017-15, The University of Tokyo, July 2017.
  4. Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
    The generalized terminal backup problem.
    Technical Reports, TR-2013-07 (revised version), Egerváry Research Group, June 2014.
Theses

(Master) 根付き木詰め込み問題の一般化に関する研究. 東京大学大学院情報理工学系研究科, 2016 (Supervisor: Satoru Iwata).
(Bachelor) 一般化ターミナルバックアップ問題に対する多項式時間アルゴリズム. 東京大学工学部, 2014 (Supervisor: Kazuo Murota).

Presentations

International
  1. Tatsuya Matsuoka, Shun Sato:
    Making bidirected graphs strongly connected.
    The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, May 2017.
  2. Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
    A strongly polynomial-time algorithm for the generalized terminal backup problem (Poster).
    The Japanese-Swiss Workshop on Combinatorics and Computational Geometry, Tokyo, Japan, June 2014.
Domestic
  1. 松岡達也, 谷川眞一:
    到達可能な頂点集合を張る混合木詰め込み問題に対する多項式時間アルゴリズム.
    日本オペレーションズ・リサーチ学会 2018年秋季研究発表会, Nagoya City University, September 2018.
  2. 松岡達也, Zoltán Szigeti:
    Polymatroid-based capacitated packing of branchings.
    第14回日本応用数理学会研究部会連合発表会, Osaka University, March 2018.
  3. 松岡達也, Zoltán Szigeti:
    Polymatroid-based capacitated packing of branchings.
    日本オペレーションズ・リサーチ学会「離散アルゴリズムの応用と理論」研究部会 第10回研究会, Kyoto University, February 2018.
  4. 松岡達也, 佐藤峻:
    双向グラフの強連結化に関する研究.
    日本オペレーションズ・リサーチ学会「最適化の基盤とフロンティア」研究部会 (WOO) –未来を担う若手研究者の集い2017–, University of Tsukuba, May 2017.
  5. 松岡達也, 佐藤峻:
    双向グラフの強連結化.
    日本オペレーションズ・リサーチ学会 2016年秋季研究発表会, Yamagata University, September 2016.
  6. 松岡達也:
    ポリマトロイド制約付き有向木詰め込み問題.
    日本オペレーションズ・リサーチ学会「最適化の基盤とフロンティア」研究部会 (WOO) –未来を担う若手研究者の集い2016–, University of Tsukuba, May 2016.
  7. 横井優, Nguyen Hau Than, 松岡達也, 小林佑輔, 垣村尚徳, 河原林健一:
    学術情報ネットワークにおける最適キャッシュ配置.
    日本応用数理学会 2015年度年会, Kanazawa University, September 2015.
  8. 小林佑輔, 松岡達也:
    一般化ターミナルバックアップ問題に対する多項式時間アルゴリズム.
    日本オペレーションズ・リサーチ学会「最適化の理論と応用」研究部会 (SOTA) –未来を担う若手研究者の集い2014–, University of Tsukuba, May 2014.
  9. 小林佑輔, 松岡達也:
    一般化ターミナルバックアップ問題に対する多項式時間アルゴリズム.
    第10回日本応用数理学会研究部会連合発表会, Kyoto University, March 2014.