Counting Minimum Weight Arborescences. - Koyo Hayashi; Satoru Iwata 001 (Algorithmica, 2018)

Correction to: Counting Minimum Weight Arborescences. - Koyo Hayashi; Satoru Iwata 001 (Algorithmica, 2019)

A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes. - Koyo Hayashi (Discret. Comput. Geom., 2021)

Finding Hall blockers by matrix scaling. - Koyo Hayashi; Hiroshi Hirai 001 (CoRR, 2022)

Linking four vertices in graphs of large connectivity. - Koyo Hayashi (J. Comb. Theory B, 2022)

Rooted topological minors on four vertices. - Koyo Hayashi; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2023)

Finding Hall Blockers by Matrix Scaling. - Koyo Hayashi; Hiroshi Hirai 001; Keiya Sakabe (Math. Oper. Res., 2024)

Two Flags in a Semimodular Lattice Generate an Antimatroid. - Koyo Hayashi; Hiroshi Hirai 001 (Order, 2024)

Chasing Tripods to Obtain a Rooted Subdivision. - Koyo Hayashi; Ken-ichi Kawarabayashi; Youngho Yoo (SIAM J. Discret. Math., 2025)