Ph. D student (Superviser: Hiroshi Hirai)

Department of Mathematical Informatics,

Graduate School of Information Science and Technology,

The University of Tokyo, Tokyo, 113-8656, Japan.

E-mail: motoki_ikeda (at) mist.i.u-tokyo.ac.jp

- Node-connectivity terminal-backup, separately-capacitated multiflow, and discrete convexity,
*The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020)*, 65:1--65:19, 2020 (with H. Hirai). [pdf] - A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem,
*The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019)*, pp.179–188, 2019 (with H. Hirai). - Cut sparsifiers for balanced digraphs,
*The 16th Workshop on Approximation and Online Algorithms (WAOA 2018)*, LNCS 11312, pp. 277–294, 2018 (with S. Tanigawa).