Nurimisaki and Sashigane are NP-complete. - Chuzo Iwamoto; Tatsuya Ide (CCCG, 2019)

Computational Complexity of Nurimisaki and Sashigane. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Multi-Task Learning of Generation and Classification for Emotion-Aware Dialogue Response Generation. - Tatsuya Ide; Daisuke Kawahara (NAACL-HLT (Student Research Workshop), 2021)

Building a Dialogue Corpus Annotated with Expressed and Experienced Emotions. - Tatsuya Ide; Daisuke Kawahara (ACL (student), 2022)

Five Cells and Tilepaint are NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2022)

Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

PHALM: Building a Knowledge Graph from Scratch by Prompting Humans and a Language Model. - Tatsuya Ide; Eiki Murata; Daisuke Kawahara; Takato Yamazaki; Shengzhe Li; Kenta Shinzato; Toshinori Sato (CoRR, 2023)

Calculation Solitaire is NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2023)

Chained Block is NP-Complete. - Chuzo Iwamoto; Tatsuya Ide (IEICE Trans. Inf. Syst., 2024)