Assistant Professor
Department of Computer Science,
Graduate School of Information Science and Technology,
University of Tokyo, Tokyo 113-8656, Japan.
E-mail: khayashi(at)is.s.u-tokyo.ac.jp
CV:
Education
March 2017: Bachelor of Engineering, University of Tokyo
March 2019: Master of Information Science and Technology, University of Tokyo
March 2022: Master of Information Science and Technology, University of Tokyo
Career
April 2022 -- March 2023: Assistant Professor at Department of Information and System Engineering, Chuo University
April 2023 -- current: Assistant Professor at Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo
Research interests:
Discrete Mathematics, Graph Theory, Algorithm, Combinatorial Optimization
Preprints and Publications:
K. Hayashi and S. Iwata: Counting minimum weight arborescences. Algorithmica 80(2018), 3908–3919. [pdf]
K. Hayashi: A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes. Discrete and Computational Geometry, 65(2021), 636–654. [pdf]
K. Hayashi and K. Kawarabayashi: Rooted topological minors on four vertices. Journal of Combinatorial Theory, Series B, 158(2023), 146–185. [pdf]
K. Hayashi: Linking four vertices in graphs of large connectivity. Journal of Combinatorial Theory, Series B, 154(2022), 136–174. [pdf]
K. Hayashi and H. Hirai: Two flags in a semimodular lattice generate an antimatroid, submitted. [pdf]
K. Hayashi and H. Hirai: Finding Hall blockers by matrix scaling, submitted. [pdf]
K. Hayashi and K. Kawarabayashi: Chasing tripods to obrain a rooted subdivision, submitted.
Proceedings:
K. Hayashi: A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes. The 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, July 2018.