Yasuhiko Takenaga

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 6

Top Topics

Polynomial Time Complexity

Crossword Puzzles

Symmetric Matrices

Top Venues

J. Int. Comput. Games Assoc.

IEICE Trans. Inf. Syst.

Inf. Process. Lett.

Publications

Koushi Teramoto, Masaki Kugaya, Shuhei Kudo, Yasuhiko Takenaga, Yusaku Yamamoto
Approximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing. HPC Asia (2024)
Kazushi Ito, Yasuhiko Takenaga
Solvability of Peg Solitaire on Graphs is NP-Complete. IEICE Trans. Inf. Syst. 106 (6) (2023)
Yasuhiko Takenaga, Sho Kikuchi, Hushan Quan
On the power of lookahead in single-player PuyoPuyo. J. Int. Comput. Games Assoc. 43 (2) (2021)
Yasuhiko Takenaga, Shohei Mishiba, Haruka Sugiyama
Matchstick Puzzles on a Grid. Graphs Comb. 36 (2) (2020)
Shohei Mishiba, Yasuhiko Takenaga
QUIXO is EXPTIME-complete. Inf. Process. Lett. 162 (2020)
Yasuhiko Takenaga, Yo Shimada
Strategies for Single-Player PuyoPuyo. J. Int. Comput. Games Assoc. 39 (2) (2017)
Shohei Kanehiro, Yasuhiko Takenaga
Satogaeri, Hebi, and Suraromu Are NP-Complete. ACIT-CSI (2015)
Yasuhiko Takenaga, Narutoshi Tanaka, Takahiro Habara
Number of Three-point Tilings with Triangle Tiles. J. Inf. Process. 23 (3) (2015)
Kenichiro Nakai, Yasuhiko Takenaga
NP-Completeness of Pandemic. J. Inf. Process. 20 (3) (2012)
Kenichiro Nakai, Yasuhiko Takenaga
NP-Completeness of Pandemic. Inf. Media Technol. 7 (3) (2012)
Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata
Stonehenge: Outcome of All First Moves and PSPACE-Completeness. J. Int. Comput. Games Assoc. 33 (1) (2010)
Yasuhiko Takenaga, Toby Walsh
Tetravex is NP-complete CoRR (2009)
Yasuhiko Takenaga, Nao Katougi
Tree-Shellability of Restricted DNFs. IEICE Trans. Inf. Syst. (4) (2008)
Yasuhiko Takenaga, Shigeru Arai
PSPACE-completeness of an escape problem. Inf. Process. Lett. 108 (4) (2008)
Yasuhiko Takenaga, Kenichi Higashide
e Graphs. WG (2006)
Yasuhiko Takenaga, Toby Walsh
Tetravex is NP-complete. Inf. Process. Lett. 99 (5) (2006)
Tetsuro Nishino, Yasuhiko Takenaga
Foreword. IEICE Trans. Inf. Syst. (1) (2005)
Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima
Tree-shellability of Boolean functions. Theor. Comput. Sci. 262 (1) (2001)
Yasuhiko Takenaga, Shuzo Yajima
Hardness of identifying the minimum ordered binary decision diagram. Discret. Appl. Math. 107 (1-3) (2000)
Kazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima
Size of Ordered Binary Decision Diagrams Representing Threshold Functions. Theor. Comput. Sci. 180 (1-2) (1997)
Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima
Size and Variable Ordering of OBDDs Representing Treshold Functions. COCOON (1997)
Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions. ISAAC (1994)