Yasuhiko Takenaga

According to our database, Yasuhiko Takenaga authored at least 20 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Approximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing.

Koushi Teramoto, Masaki Kugaya, Shuhei Kudo, Yasuhiko Takenaga, Yusaku Yamamoto

Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, 2024

2023

Solvability of Peg Solitaire on Graphs is NP-Complete.

Kazushi Ito, Yasuhiko Takenaga

IEICE Trans. Inf. Syst., June, 2023

2021

On the power of lookahead in single-player PuyoPuyo.

Yasuhiko Takenaga, Sho Kikuchi, Hushan Quan

J. Int. Comput. Games Assoc., 2021

2020

QUIXO is EXPTIME-complete.

Shohei Mishiba, Yasuhiko Takenaga

Inf. Process. Lett., 2020

Matchstick Puzzles on a Grid.

Yasuhiko Takenaga, Shohei Mishiba, Haruka Sugiyama

Graphs Comb., 2020

2017

Strategies for Single-Player PuyoPuyo.

Yasuhiko Takenaga, Yo Shimada

J. Int. Comput. Games Assoc., 2017

2015

Number of Three-point Tilings with Triangle Tiles.

Yasuhiko Takenaga, Narutoshi Tanaka, Takahiro Habara

J. Inf. Process., 2015

Satogaeri, Hebi, and Suraromu Are NP-Complete.

Shohei Kanehiro, Yasuhiko Takenaga

Proceedings of the 3rd International Conference on Applied Computing and Information Technology, 2015

2012

NP-Completeness of Pandemic.

Kenichiro Nakai, Yasuhiko Takenaga

J. Inf. Process., 2012

2010

Stonehenge: Outcome of All First Moves and PSPACE-Completeness.

Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata

J. Int. Comput. Games Assoc., 2010

2008

PSPACE-completeness of an escape problem.

Yasuhiko Takenaga, Shigeru Arai

Inf. Process. Lett., 2008

Tree-Shellability of Restricted DNFs.

Yasuhiko Takenaga, Nao Katougi

IEICE Trans. Inf. Syst., 2008

2006

Tetravex is NP-complete.

Yasuhiko Takenaga, Toby Walsh

Inf. Process. Lett., 2006

Vertex Coloring of Comparability+<i>k</i>e and -<i>k</i>e Graphs.

Yasuhiko Takenaga, Kenichi Higashide

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

Foreword.

Tetsuro Nishino, Yasuhiko Takenaga

IEICE Trans. Inf. Syst., 2005

2001

Tree-shellability of Boolean functions.

Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima

Theor. Comput. Sci., 2001

2000

Hardness of identifying the minimum ordered binary decision diagram.

Yasuhiko Takenaga, Shuzo Yajima

Discret. Appl. Math., 2000

1997

Size of Ordered Binary Decision Diagrams Representing Threshold Functions.

Kazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima

Theor. Comput. Sci., 1997

Size and Variable Ordering of OBDDs Representing Treshold Functions.

Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1994

On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions.

Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994