Yasuhiko Takenaga

23 papers B 2C 1Misc 1Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximate Block Diagonalization of Symmetric Matrices Using the D-Wave Advantage Quantum Annealer.
Concurr. Comput. Pract. Exp.
Koushi Teramoto, Evgeniy Mishchenko, Keisuke Kawamura, Shuhei Kudo, Yasuhiko Takenaga, Yusaku Yamamoto
2024 C conf
Approximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing.
HPC Asia
Koushi Teramoto, Masaki Kugaya, Shuhei Kudo, Yasuhiko Takenaga, Yusaku Yamamoto
2023 J jnl
Solvability of Peg Solitaire on Graphs is NP-Complete.
IEICE Trans. Inf. Syst.
Kazushi Ito, Yasuhiko Takenaga
2021 J jnl
On the power of lookahead in single-player PuyoPuyo.
ICGA J.
Yasuhiko Takenaga, Sho Kikuchi, Hushan Quan
2020 J jnl
Matchstick Puzzles on a Grid.
Graphs Comb.
Yasuhiko Takenaga, Shohei Mishiba, Haruka Sugiyama
2020 J jnl
QUIXO is EXPTIME-complete.
Inf. Process. Lett.
Shohei Mishiba, Yasuhiko Takenaga
2017 J jnl
Strategies for Single-Player PuyoPuyo.
ICGA J.
Yasuhiko Takenaga, Yo Shimada
2015 J jnl
Number of Three-point Tilings with Triangle Tiles.
J. Inf. Process.
Yasuhiko Takenaga, Narutoshi Tanaka, Takahiro Habara
2015 — conf
Satogaeri, Hebi, and Suraromu Are NP-Complete.
ACIT-CSI
Shohei Kanehiro, Yasuhiko Takenaga
2012 J jnl
NP-Completeness of Pandemic.
Inf. Media Technol.
Kenichiro Nakai, Yasuhiko Takenaga
2012 J jnl
NP-Completeness of Pandemic.
J. Inf. Process.
Kenichiro Nakai, Yasuhiko Takenaga
2010 J jnl
Stonehenge: Outcome of All First Moves and PSPACE-Completeness.
ICGA J.
Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata
2009 J jnl
Tetravex is NP-complete
CoRR
Yasuhiko Takenaga, Toby Walsh
2008 J jnl
PSPACE-completeness of an escape problem.
Inf. Process. Lett.
Yasuhiko Takenaga, Shigeru Arai
2008 J jnl
Tree-Shellability of Restricted DNFs.
IEICE Trans. Inf. Syst.
Yasuhiko Takenaga, Nao Katougi
2006 J jnl
Tetravex is NP-complete.
Inf. Process. Lett.
Yasuhiko Takenaga, Toby Walsh
2006 B conf
Vertex Coloring of Comparability+
WG
Yasuhiko Takenaga, Kenichi Higashide
2005 J jnl
Foreword.
IEICE Trans. Inf. Syst.
Tetsuro Nishino, Yasuhiko Takenaga
2001 J jnl
Tree-shellability of Boolean functions.
Theor. Comput. Sci.
Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima
2000 J jnl
Hardness of identifying the minimum ordered binary decision diagram.
Discret. Appl. Math.
Yasuhiko Takenaga, Shuzo Yajima
1997 Misc conf
Size and Variable Ordering of OBDDs Representing Treshold Functions.
COCOON
Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima
1997 J jnl
Size of Ordered Binary Decision Diagrams Representing Threshold Functions.
Theor. Comput. Sci.
Kazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima
1994 B conf
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions.
ISAAC
Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima