Yasuhiko Takenaga - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2024

Approximate Block Diagonalization of Symmetric Matrices Using Quantum AnnealingKoushi Teramoto, Masaki Kugaya, Shuhei Kudo, Yasuhiko Takenaga, Yusaku Yamamoto. hpcasia 2024: 47-54 [doi]

2023

Solvability of Peg Solitaire on Graphs is NP-CompleteKazushi Ito, Yasuhiko Takenaga. ieicetd, 106(6):1111-1116, June 2023. [doi]

2021

On the power of lookahead in single-player PuyoPuyoYasuhiko Takenaga, Sho Kikuchi, Hushan Quan. icga, 43(2):102-113, 2021. [doi]

2020

QUIXO is EXPTIME-completeShohei Mishiba, Yasuhiko Takenaga. ipl, 162:105995, 2020. [doi]

Matchstick Puzzles on a GridYasuhiko Takenaga, Shohei Mishiba, Haruka Sugiyama. gc, 36(2):347-357, 2020. [doi]

2017

Strategies for Single-Player PuyoPuyoYasuhiko Takenaga, Yo Shimada. icga, 39(2):87-101, 2017. [doi]

2015

Satogaeri, Hebi, and Suraromu Are NP-CompleteShohei Kanehiro, Yasuhiko Takenaga. acit2 2015: 46-51 [doi]

Number of Three-point Tilings with Triangle TilesYasuhiko Takenaga, Narutoshi Tanaka, Takahiro Habara. jip, 23(3):305-309, 2015. [doi]

2012

NP-Completeness of PandemicKenichiro Nakai, Yasuhiko Takenaga. jip, 20(3):723-726, 2012. [doi]

2010

Stonehenge: Outcome of All First Moves and PSPACE-CompletenessYasuhiko Takenaga, Hikari Mori, Shigeki Iwata. icga, 33(1):34-41, 2010.

2008

PSPACE-completeness of an escape problemYasuhiko Takenaga, Shigeru Arai. ipl, 108(4):229-233, 2008. [doi]

Tree-Shellability of Restricted DNFsYasuhiko Takenaga, Nao Katougi. ieicet, 91-D(4):996-1002, 2008. [doi]

2006

Vertex Coloring of Comparability+::::k::::e and -::::k::::e GraphsYasuhiko Takenaga, Kenichi Higashide. criwg 2006: 102-112 [doi]

Tetravex is NP-completeYasuhiko Takenaga, Toby Walsh. ipl, 99(5):171-174, 2006. [doi]

2005

ForewordTetsuro Nishino, Yasuhiko Takenaga. ieicet, 88-D(1):10-11, 2005. [doi]

2001

Tree-shellability of Boolean functionsYasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima. TCS, 262(1):633-647, 2001. [doi]

2000

Hardness of identifying the minimum ordered binary decision diagramYasuhiko Takenaga, Shuzo Yajima. DAM, 107(1-3):191-201, 2000.

1997

Size of Ordered Binary Decision Diagrams Representing Threshold FunctionsKazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima. TCS, 180(1-2):47-60, 1997. [doi]

Size and Variable Ordering of OBDDs Representing Treshold FunctionsYasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima. cocoon 1997: 91-100

1994

On the Size of Ordered Binary Decision Diagrams Representing Threshold FunctionsKazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima. isaac 1994: 584-592

Sign in or sign up to see more results.

runs on WebDSL