default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHironori Kiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica 86(3): 808-824 (2024)- [c5]Tesshu Hanaka
, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM 2024: 297-310 - 2023
- [c4]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM 2023: 222-235 - [i4]Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono:
Turning Tiles is PSPACE-complete. CoRR abs/2310.01983 (2023) - 2022
- [j2]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. Discret. Appl. Math. 321: 281-294 (2022) - [c3]Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono:
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA 2022: 509-522 - [i3]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. CoRR abs/2210.02835 (2022) - [i2]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR abs/2211.05307 (2022) - 2021
- [b1]Hironori Kiya:
Algorithmic Analyses of Card-Discarding Type Games. Nagoya University, Japan, 2021 - [j1]Hironori Kiya, Katsuki Ohto, Hirotaka Ono:
Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1134-1141 (2021) - 2020
- [c2]Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi:
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM 2020: 627-635
2010 – 2019
- 2019
- [c1]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: 576-584 - [i1]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR abs/1908.11554 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
