Hironori Kiya

Orcid: 0000-0002-0742-4477

According to our database1, Hironori Kiya authored at least 11 papers between 2019 and 2024.

Collaborative distances:

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
3
1
1
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computational complexity of Turning Tiles.
Int. J. Game Theory, December, 2024

Enforce and selective operators of combinatorial games.
Int. J. Game Theory, December, 2024

Winner Determination Algorithms for Graph Games with Matching Structures.
Algorithmica, March, 2024

Faster Winner Determination Algorithms for (Colored) Arc Kayles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Turning Tiles is PSPACE-complete.
CoRR, 2023

Sequentially Swapping Tokens: Further on Graph Classes.
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.
Discret. Appl. Math., 2022

2021
Algorithmic Analyses of Card-Discarding Type Games.
PhD thesis, 2021

Computing the Winner of 2-Player TANHINMIN.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
Computational Complexity of Hedonic Games on Sparse Graphs.
Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019


  Loading...