Hironori Kiya

According to our database, Hironori Kiya authored at least 9 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Winner Determination Algorithms for Graph Games with Matching Structures.

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari

Algorithmica, March, 2024

Faster Winner Determination Algorithms for (Colored) Arc Kayles.

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Turning Tiles is PSPACE-complete.

Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono

CoRR, 2023

Sequentially Swapping Tokens: Further on Graph Classes.

Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality.

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono

Discret. Appl. Math., 2022

2021

Algorithmic Analyses of Card-Discarding Type Games.

Hironori Kiya

PhD thesis, 2021

Computing the Winner of 2-Player TANHINMIN.

Hironori Kiya, Katsuki Ohto, Hirotaka Ono

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium.

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Computational Complexity of Hedonic Games on Sparse Graphs.

Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono

Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019