Researcher Profiles - KIYA HIRONORI

写真a

KIYA HIRONORI

Organization

Graduate School of Informatics Department of Core Informatics Assistant Professor
School of Engineering Department of Information Science

Affiliation

Institute of Informatics

Position

Graduate School of Informatics Department of Core Informatics

Assistant Professor 2023.04 - Now
School of Engineering Department of Information Science

Assistant Professor 2023.04 - Now

Degree

博士（情報学）（ Nagoya University ）
修士（経済学）（ Kyushu University ）
学士（経済学）（ Kyushu University ）

Professional Memberships

日本組合せゲーム理論研究集会

2018.03 - Now
Operations Research Society of Japan

2016.02 - Now Domestic
Information Processing Society of Japan

2016.02 - Now

Committee Memberships (off-campus)

一般社団法人情報処理学会関西支部幹事

2026.04 - 2028.03
一般社団法人情報処理学会ゲーム情報学研究部会幹事

2026.04 - 2028.03
日本オペレーションズ・リサーチ学会九州支部特別講演　講師

2023.10
日本オペレーションズリサーチ学会論文誌編集幹事

2022.05 - 2024.04
一般社団法人情報処理学会ゲーム情報学研究会運営委員

2021.04 - 2024.03
日本組合せゲーム理論研究集会運営委員

2019.04 - Now

▼display all

Job Career (off-campus)

九州大学経済学研究院非常勤講師

2023.04 - 2025.03

Papers

Sequentially swapping tokens: Further on graph classes ☆,☆☆

Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 155 2026.02（ ISSN:0022-0000 ）（ eISSN:1090-2724 ）

　More details

Publishing type：Research paper (scientific journal)

DOI： 10.1016/j.jcss.2025.103691
Finding a HIST: Chordality, Structural Parameters, and Diameter

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono

16448 LNCS 303 - 316 2026（ ISSN:03029743 ）（ ISBN:9783032178008 ）

　More details

DOI： 10.1007/978-3-032-17801-5_23
Hardness Results on Generalized Puyo Puyo

Eto Hiroshi, Kiya Hironori, Ono Hirotaka

Journal of Information Processing 33 ( 0 ) 1077 - 1091 2025（ eISSN:18826652 ）

　More details

<p>Puyo Puyo is a Tetris-like falling-block video game, which has been played in Japan more than 30 years. In Tetris, tetrominoes fall on the board, whereas colored and colorless “puyo”s fall in Puyo Puyo. The clearing rule in Tetris is to fill a line (row) of the board, whereas that in Puyo Puyo is to make a cluster with a size of at least 4 puyos with a single color. A colorless puyo is cleared only when a colored puyo touching it is cleared. Due to this clearing rule, a clearing chain phenomenon arises, which is a unique nature of Puyo Puyo. In this paper, we investigate the computational complexity of a generalized Puyo Puyo, where the size of the board and the number of colors are arbitrary, but the falling sequence of puyos is given in an offline manner. We focus on two algorithmic problems in the generalized Puyo Puyo. One is the problem of finding a clearing chain with the longest length for a given board and a falling sequence of puyos, and the other is the problem of deciding whether a given board and a falling sequence of puyos can clear all the puyos, or not. Both problems are already known to be NP-complete. The former problem, the longest clearing chain problem, is shown to be NP-complete even if the number of colors is 4. The latter problem, the all-clear problem, is also shown to be NP-complete even if the number of colors is 2. In this paper, we strengthen these results: (1) The longest clearing chain problem is NP-complete even if the number of colors is 2. (2) The longest clearing chain cannot be approximated within a factor better than any polynomial of the falling sequence length in polynomial time unless P = NP.</p>

DOI： 10.2197/ipsjjip.33.1077

CiNii Research
Happy Vertex Game

Eto H.

Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025 38 - 47 2025（ ISBN:9798331555375 ）

　More details

DOI： 10.1109/CANDAR68384.2025.00013
Enforce and selective operators of combinatorial games

Tomoaki Abuku, Shun-ichi Kimura, Hironori Kiya, Urban Larsson, Indrajit Saha, Koki Suetsugu, Takahiro Yamashita

INTERNATIONAL JOURNAL OF GAME THEORY 53 ( 4 ) 1249 - 1273 2024.12（ ISSN:00207276 ）（ eISSN:1432-1270 ）

　More details

Publishing type：Research paper (scientific journal)

DOI： 10.1007/s00182-024-00910-6

Other URL： https://link.springer.com/article/10.1007/s00182-024-00910-6/fulltext.html
Computational complexity of Turning Tiles

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

International Journal of Game Theory 53 ( 4 ) 1211 - 1222 2024.10（ ISSN:0020-7276 ）（ eISSN:1432-1270 ）

　More details

Publishing type：Research paper (scientific journal)

DOI： 10.1007/s00182-024-00908-0

Other URL： https://link.springer.com/article/10.1007/s00182-024-00908-0/fulltext.html
Winner Determination Algorithms for Graph Games with Matching Structures.

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono 0001, Kanae Yoshiwatari

Algorithmica 86 ( 3 ) 808 - 824 2024.03（ ISSN:01784617 ）（ eISSN:1432-0541 ）

　More details

Publishing type：Research paper (scientific journal)

DOI： 10.1007/s00453-023-01136-w
Faster Winner Determination Algorithms for (Colored) Arc Kayles.

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

SOFSEM 14519 LNCS 297 - 310 2024（ ISSN:03029743 ）（ ISBN:9783031521126 ）（ eISSN:1090-2724 ）

　More details

Publishing type：Research paper (international conference proceedings)

DOI： 10.1007/978-3-031-52113-3_21

Other URL： https://dblp.uni-trier.de/db/conf/sofsem/sofsem2024.html#HanakaKLOY24

▼display all

MISC

準完全情報ニム

安福智明, 洞龍弥, 稲津大貴, 木谷裕紀, 末續鴻輝, 吉渡叶

2026.01

　More details

Authorship：Lead author,　Corresponding author
重力を利用した物理的ゼロ知識証明:ストストーンとドッスンフワリへの適用

大江周真, 木谷裕紀, 宇野裕之

情報処理学会研究報告(Web) 2025 ( AL-202 ) 2025

　More details

J-GLOBAL
Fast Algorithms for Influence Immunization Bounding Problem in Dense Graphs

永瀬雄貴, 木谷裕紀, 宇野裕之

情報処理学会研究報告(Web) 2025 ( AL-202 ) 2025

　More details

J-GLOBAL
増殖ニム

橋本健吾, 木谷裕紀, 山下貴央

情報処理学会研究報告(Web) 2025 ( GI-55 ) 2025

　More details

J-GLOBAL
一般化二人単貧民に対する最大マッチングの適用

大渡勝己, 木谷裕紀

情報処理学会研究報告(Web) 2025 ( GI-55 ) 2025

　More details

J-GLOBAL
ごみ圧縮問題

大内翔太, 木谷裕紀, 宇野裕之

情報処理学会研究報告(Web) 2025 ( AL-202 ) 2025

　More details

J-GLOBAL
ハッピーセットゲームにおける戦略

江藤宏, 藤本晶子, 木谷裕紀, 松下瑠花, 宮野英次, 村尾優斗, 斎藤寿樹

情報処理学会研究報告(Web) 2024 ( AL-198 ) 2024

　More details

J-GLOBAL
The Optinum Question Number on YOMEN

平野巧稀, 木谷裕紀, 土中哲秀, 小野廣隆

情報処理学会研究報告(Web) 2024 ( AL-200 ) 2024

　More details

J-GLOBAL

▼display all

Grant-in-Aid for Scientific Research

構造化オラクルモデルによる不完全情報ゲームのアルゴリズム的解析

Grant-in-Aid for Early-Career Scientists 2027
構造化オラクルモデルによる不完全情報ゲームのアルゴリズム的解析

Grant-in-Aid for Early-Career Scientists 2026

Charge of on-campus class subject

基幹情報学特別研究1

2025 Intensive lecture Graduate school
基幹情報学特別研究2

2025 Intensive lecture Graduate school
基幹情報学特別演習2

2025 Weekly class Graduate school
情報工学基礎演習2

2025 Weekly class Undergraduate
情報工学実験2

2025 Weekly class Undergraduate
情報工学技術英語

2025 Intensive lecture Undergraduate
情報工学卒業研究A

2025 Intensive lecture Undergraduate
情報工学卒業研究B

2025 Intensive lecture Undergraduate
情報工学基礎演習2

2025 Intensive lecture Undergraduate
情報リテラシー

2025 Weekly class Undergraduate
基幹情報学特別研究1

2025 Intensive lecture Graduate school
基幹情報学特別研究2

2025 Intensive lecture Graduate school
情報工学実験1

2025 Weekly class Undergraduate
情報工学技術英語

2025 Weekly class Undergraduate
情報工学卒業研究A

2025 Intensive lecture Undergraduate
基幹情報学特別研究1

2024 Intensive lecture Graduate school
基幹情報学特別研究2

2024 Intensive lecture Graduate school
基幹情報学特別演習2

2024 Weekly class Graduate school
情報工学基礎演習2

2024 Weekly class Undergraduate
情報工学実験2

2024 Weekly class Undergraduate
基幹情報学特別研究1

2024 Intensive lecture Graduate school
基幹情報学特別研究2

2024 Intensive lecture Graduate school
情報工学実験1

2024 Weekly class Undergraduate
情報工学実験1

2024 Weekly class

▼display all

Charge of off-campus class subject

情報処理１

2024.09

-

2025.03

　More details

Level：Undergraduate (specialized)
情報処理2

2023.10

-

2024.03

　More details

Level：Undergraduate (liberal arts)
情報処理１

2023.04

-

2023.09

　More details

Level：Undergraduate (liberal arts)

Foreigner acceptance

2024

International Students :1