Computational Complexity of Hedonic Games on Sparse Graphs. - Tesshu Hanaka; Hironori Kiya; Yasuhide Maei; Hirotaka Ono 001 (PRIMA, 2019)

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. - Naoka Fukuzono; Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Ryogo Yamaguchi (SOFSEM, 2020)

Computing the Winner of 2-Player TANHINMIN. - Hironori Kiya; Katsuki Ohto; Hirotaka Ono 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Algorithmic Analyses of Card-Discarding Type Games. - Hironori Kiya (2021)

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 001 (Discret. Appl. Math., 2022)

Turning Tiles is PSPACE-complete. - Kanae Yoshiwatari; Hironori Kiya; Koki Suetsugu; Tesshu Hanaka; Hirotaka Ono 001 (CoRR, 2023)

Faster Winner Determination Algorithms for (Colored) Arc Kayles. - Tesshu Hanaka; Hironori Kiya; Michael Lampis; Hirotaka Ono 001; Kanae Yoshiwatari (SOFSEM, 2024)

Winner Determination Algorithms for Graph Games with Matching Structures. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Kanae Yoshiwatari (Algorithmica, 2024)

Enforce and selective operators of combinatorial games. - Tomoaki Abuku; Shun-ichi Kimura; Hironori Kiya; Urban Larsson; Indrajit Saha; Koki Suetsugu; Takahiro Yamashita (Int. J. Game Theory, 2024)

Computational complexity of Turning Tiles. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Koki Suetsugu; Kanae Yoshiwatari (Int. J. Game Theory, 2024)

Sequentially swapping tokens: Further on graph classes. - Hironori Kiya; Yuto Okada; Hirotaka Ono 001; Yota Otachi (J. Comput. Syst. Sci., 2026)