| 2022 | WALCOM | Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard. | Chuzo Iwamoto, Tatsuaki Ibusuki |
| 2020 | WALCOM | Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. | Chuzo Iwamoto, Tatsuaki Ibusuki |
| 2018 | FUN | Herugolf and Makaro are NP-complete. | Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki |
| 2009 | ISAAC | Computational Complexity of Cast Puzzles. | Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita |
| 2007 | TAMC | A Time Hierarchy Theorem for Nondeterministic Cellular Automata. | Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai |
| 2005 | FCT | Translational Lemmas for Alternating TMs and PRAMs. | Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai |
| 2004 | MCU | Hierarchies of DLOGTIME-Uniform Circuits. | Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu |
| 2002 | MFCS | Computational Complexity in the Hyperbolic Plane. | Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai |
| 2001 | MCU | Speeding-Up Cellular Automata by Alternations. | Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
| 1999 | FCT | On Time-Constructible Functions in One-Dimensional Cellular Automata. | Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai |
| 1998 | MFCS | Improved Time and Space Hierarchies of One-Tape Off-Line TMs. | Kazuo Iwama, Chuzo Iwamoto |
| 1994 | ISAAC | Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. | Chuzo Iwamoto, Kazuo Iwama |