Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari,
"Winner Determination Algorithms for Graph Games with Matching Structures,"
Algorithmica, vol. 86, no. 3, pp. 808–824, 2024.
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Koki Suetsugu, Kanae Yoshiwatari,
"Computational complexity of Turning Tiles,"
International Journal of Game Theory, vol. 53, no. 4, pp. 1211–1222, 2024.
Tomoaki Abuku, Shun-ichi Kimura, Hironori Kiya, Urban Larsson, Indrajit Saha, Koki Suetsugu, Takahiro Yamashita,
"Enforce and selective operators of combinatorial games,"
International Journal of Game Theory, vol. 53, no. 4, pp. 1249–1273, 2024
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono:
“The Existence of a Pure Nash Equilibrium in the Two-player Competitive Diffusion Game on Graphs having Chordality”,
Discrete Applied Mathematics, 321, pp. 281-294, (2022). link
Hironori Kiya, Katsuki Ohto, Hirotaka Ono
“Modeling Imperfect Information TANIHNMIN with structural Oracle''
IPSJ Transactions on Mathematical Modeling and its Applications, 2022 15.1 pp.10-17 (2022).
Hironori Kiya, Katsuki Ohto, Hirotaka Ono
“Computing the Winner of 2-Player TANHINMIN''
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 104.9 pp.1134-1141 (2021).
Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari,
"Faster Winner Determination Algorithms for (Colored) Arc Kayles,"
Proceedings of SOFSEM 2024, pp. 297–310, 2024.
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
"Sequentially swapping tokens: Further on graph classes"
The 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023). Lecture Notes in Computer Science 13878 222-235 2023.
Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono: “Winner Determination Algorithms for Graph Games with Matching Structures” In: Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), Lecture Notes in Computer Science, Vol. 13270, pp. 509--522, Springer, 2022. (Acceptance ratio: 41% [35/86]) link
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono: “Computational Complexity of Hedonic Games on Sparse Graphs” In Proceedings of the 22nd International Conference on Principles and Practice of Multi-Agent System (PRIMA) 2019. Lecture Notes in Computer Science, Vol. 11873, pp. 576--584, Springer, 2019. (Acceptance ratio: 48% [54/112]) link
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi: “Two-player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium”, In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2020), Lecture Notes in Computer Science, Vol. 12011, pp. 627--635, Springer, 2020. [link]
Erik D. Demaine, Martin L. Demaine, Timothy Gomez, Markus Hecher, and Hironori Kiya, How to Fish with Perfect Information, The 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3), 東京, 9月 2024.
Hiroshi Eto, Hironori Kiya, and Hirotaka Ono, Hardness Results on Generalized Puyo Puyo, The 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3), 東京, 9月 2024.
Takashi Horiyama, Tonan Kamata, Hironori Kiya, Hirotaka Ono, Takumi Shiota, Ryuhei Uehara, Yushi Uno, Critical Sets of 𝑛-omino Sudoku, The 25th Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (IJCDCG^3), バリ, 9月 2023.
Kouki Hirano, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono, Upper and Lower Bounds on the Optimal Questions for YOMEN, The 25th Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (IJCDCG^3), バリ, 9月 2023.
Hironori Kiya and Koki Suetsugu, Normal-play with dead-end-winning convention, Combinatorial Game Theory Colloquium IV, サンミゲル 1月 2023年.
Hiroshi Eto, Hironori Kiya, Hirotaka Ono “Hardness Results on Generalized Puyopuyo" The 12th Annual Meeting of Asian Association for Algorithms and Computation -AAAC2019- Online 10月, 2021年 Link
Hironori Kiya, Hirotaka Ono “Multi-Player Open-Hand Babanuki”, the Thailand and Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Online, 9月, 2021年
Hironori Kiya, "Two player TANHINMIN and its extension", Combinatorial Game Theory Colloquium III, リスボン, 1月, 2019年 Link
Hironori Kiya, Hirotaka Ono “Deciding the winning player of Open-hand BABANUKI”, The 12th Annual Meeting of Asian Association for Algorithms and Computation -AAAC2019-, ソウル 4月, 2019年 Link
Hironori Kiya, Hirotaka Ono“Deciding the Winner of 2-Player TANHINMIN", the Japan Conference on Discrete and Computational Geometry, Graphs, and Games, マニラ, 9月, 2018年 Link
Hironori Kiya, Hirotaka Ono“Deciding the winning player of two-player TANHINMIN and its variant”, The 11th Annual Meeting of Asian Association for Algorithms and Computation -AAAC2018-, 北京 5月, 2018年 Link
Hironori Kiya, Hirotaka Ono“The Winning Strategy of 2-player TANHINMIN”, The 10th Annual Meeting of Asian Association for Algorithms and Computation -AAAC2017-, 香港, 5月, 2017年 Link