On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions. - Kazuhisa Hosaka; Yasuhiko Takenaga; Shuzo Yajima (ISAAC, 1994)

Size and Variable Ordering of OBDDs Representing Treshold Functions. - Yasuhiko Takenaga; Mitsushi Nouzoe; Shuzo Yajima (COCOON, 1997)

Size of Ordered Binary Decision Diagrams Representing Threshold Functions. - Kazuhisa Hosaka; Yasuhiko Takenaga; T. Kaneda; Shuzo Yajima (Theor. Comput. Sci., 1997)

Hardness of identifying the minimum ordered binary decision diagram. - Yasuhiko Takenaga; Shuzo Yajima (Discret. Appl. Math., 2000)

Tree-shellability of Boolean functions. - Yasuhiko Takenaga; Kouji Nakajima; Shuzo Yajima (Theor. Comput. Sci., 2001)

Foreword. - Tetsuro Nishino; Yasuhiko Takenaga (IEICE Trans. Inf. Syst., 2005)

Vertex Coloring of Comparability+ke and -ke Graphs. - Yasuhiko Takenaga; Kenichi Higashide (WG, 2006)

Tetravex is NP-complete. - Yasuhiko Takenaga; Toby Walsh (Inf. Process. Lett., 2006)

Tree-Shellability of Restricted DNFs. - Yasuhiko Takenaga; Nao Katougi (IEICE Trans. Inf. Syst., 2008)

PSPACE-completeness of an escape problem. - Yasuhiko Takenaga; Shigeru Arai (Inf. Process. Lett., 2008)

Stonehenge: Outcome of All First Moves and PSPACE-Completeness. - Yasuhiko Takenaga; Hikari Mori; Shigeki Iwata (ICGA J., 2010)

NP-Completeness of Pandemic. - Kenichiro Nakai; Yasuhiko Takenaga (Inf. Media Technol., 2012)

Satogaeri, Hebi, and Suraromu Are NP-Complete. - Shohei Kanehiro; Yasuhiko Takenaga (ACIT-CSI, 2015)

Number of Three-point Tilings with Triangle Tiles. - Yasuhiko Takenaga; Narutoshi Tanaka; Takahiro Habara (J. Inf. Process., 2015)

Strategies for Single-Player PuyoPuyo. - Yasuhiko Takenaga; Yo Shimada (ICGA J., 2017)

Matchstick Puzzles on a Grid. - Yasuhiko Takenaga; Shohei Mishiba; Haruka Sugiyama (Graphs Comb., 2020)

QUIXO is EXPTIME-complete. - Shohei Mishiba; Yasuhiko Takenaga (Inf. Process. Lett., 2020)

On the power of lookahead in single-player PuyoPuyo. - Yasuhiko Takenaga; Sho Kikuchi; Hushan Quan (ICGA J., 2021)

Solvability of Peg Solitaire on Graphs is NP-Complete. - Kazushi Ito; Yasuhiko Takenaga (IEICE Trans. Inf. Syst., 2023)

Approximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing. - Koushi Teramoto; Masaki Kugaya; Shuhei Kudo; Yasuhiko Takenaga; Yusaku Yamamoto (HPC Asia, 2024)