Published papers
Number of published data : 32
No. Classification Refereed paper Title Authorship Author Journal Volume/issue/page Publication date ISSN DOI URL
1 Paper
Yes
On the Power of Lookahead in Single-Player PuyoPuyo
Joint
Y.Takenaga, S.Kikuchi and H.Quan
ICGA Journal
to appear
2021



2 Paper
Yes
QUIXO is EXPTIME-complete
Joint
Shohei Mishiba and Yasuhiko Takenaga
Information Processing Letters
162
2020/10



3 Paper
Yes
Matchstick Puzzles on a Grid
Joint
Y.Takenaga, S.Mishiba and
H.Sugiyama
Graphs and Combinatorics
36/ 2, 347-357
2020/03



4 Paper
Yes
Strategies for Single-Player PuyoPuyo
Joint
Yasuhiko Takenaga and Yo Shimada
ICGA Journal
39/ 2, 87-101
2017



5 Paper
Yes
Number of Three-point Tilings with Triangle Tiles
Joint
Y. Takenaga, N. Tanaka, T. Habara
Journal of Information Processing
23/ 3, 305-309
2015/05



6 Paper
Yes
Shikaku and Ripple Effect are NP-Complete
Joint
Y.Takenaga, S.Aoyagi, S.Iwata and T.Kasai
Congressus Numerantium
216, 119-127
2013/12



7 Paper
Yes
NP-Completeness of Pandemic

K.Nakai and Y.Takenaga
Journal of Information Processing
20/ 3, 723-726
2012/06



8 Paper
Yes
STONEHENGE:Outcome of All First Moves and PSPACE-Completeness

Y.Takenaga, H.Mori and S.Iwata
ICGA Journal
33/ 1, 34-41
2010/03



9 Paper
Yes
PSPACE-Completeness of an Escape Problem

Y.Takenaga and S.Arai
Information Processing Letters
108/ 4, 229-233
2008/10



10 Paper
Yes
Tree-Shellability of Restricted DNFs

Y.Takenaga and N.Katougi
IEICE Trans. Inf. & Syst.
E91-D/ 4, 996-1002
2008/04



11 Paper
Yes
TETRAVEX is NP-complete

Y.Takenaga and T.Walsh
Information Processing Letters
99/ 5, 171-174
2006/09



12 Paper
Yes
NP-Completeness of Maximum Chain Problem on Puyopuyo

T. Matsukane and Y. Takenaga
The IEICE Transactions on Information and Systems
J89-D/ 3, 405-413
2006/03



13 Paper
No
積項の長さに制限を付けた論理関数のOrdered Tree-Shellability

東海林貴司、武永康彦
京都大学数理解析研究所講究録
1375, 130-136
2004/05



14 Paper
Yes
Tree-Shellability of Boolean Functions

Y. Takenaga, K. Nakajima and S. Yajima
Theoret. Comput. Sci.
262/ 1-2, 633-647
2001/07



15 Paper
No
Tree-Shellable論理関数の判定の複雑さ(共著)

門野伸史,武永康彦
京都大学数理解析研究所講究録 1205
83-88
2001/05



16 Paper
Yes
Recognition of Ordered Tree-Shellable Boolean Functions Based on OBDDs

Y. Takenaga
IEICE Trans. Inf. and Syst.
E84-D/ 1, 28-33
2001/01



17 Paper
Yes
Hardness of Identifying the Minimum Ordered Binary Decision Diagram(共著)

Y. Takenaga and S. Yajima
Discrete Applied Mathematics
107, 191-201
2000/12



18 Paper
Yes
Size of ordered binary decision diagrams representing threshold functions(共著)

K.Hosaka, Y.Takenaga, T.Kaneda and S.Yajima
Theoretical Computer Science
180/ 1-2, 47-60
1997/07



19 Paper
Yes
Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses(共著)

K.Takagi, K.Nitta, H.Bouno, Y.Takenaga and S.Yajima
IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science
E80-A/ 4, 663-669
1997/04



20 Paper
Yes
Computational Complexity of Manipulating Binary Decision Diagrams(共著)

Y.Takenaga and S.Yajima
IEICE Trans. on Information and Systems
E77-D/ 6, 642-647
1994/06



21 Paper
Yes
On the Computational Power of Binary Decision Diagrams(共著)

H.Sawada, Y.Takenaga and S.Yajima
IEICE Trans. on Information and Systems
E77-D/ 6, 611-618
1994/06



22 Paper
Yes
Computational Power of a Memory-Based Parallel Computation Model with Content Addressable Memory

Y.Takenaga, N.Takagi and S.Yajima
Trans. IPSJ
33/ 4, 415-422
1992/04



23 Paper
Yes
Computational Power of Memory-Based Parallel Computation Models with Communication(共著)

Y.Takenaga and S.Yajima
IEICE Trans. on Information and Systems
75-D/ 1, 89-94
1992/01



24 Paper
Yes
A Memory-Type Parallel Computation Model and Its Computational Power

N.Takagi, Y.Takenaga and S.Yajima
Trans. IPSJ
31/ 11, 1565-1571
1990/11



25 International conference proceedings, etc.
Yes
Anti-Slide Placements of Pentominoes

Y.Takenaga, X.Yang and A.Inada
The Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3) 2019
121-122
2019/09/07



26 International conference proceedings, etc.
Yes
Matchstick Puzzles on a Grid
Joint
Yasuhiko Takenaga, Shohei Mishiba and Haruka Sugiyama
Proc. the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
137-138
2017/08



27 International conference proceedings, etc.
Yes
Satogaeri, Hebi and Suraromu are NP-Complete
Joint
S.Kanehiro and Y.Takenaga
3rd Intl. Conf. on Applied Computing & Information Technology (ACIT 2015)
47-52
2015/07



28 International conference proceedings, etc.
Yes
Precoloring Extension on Grid Graphs

Yasuhiko Takenaga
Proc. the China-Japan Joint Confernece on Computational Geometry, Graphs and Applications (CGGA 2010)
102-103
2010/10



29 International conference proceedings, etc.
Yes
Vertex Coloring of Chordal+k_1e-k_2e Graphs

Y.Takenaga and Y.Miura
IWOCA2007
to appear
2007/11



30 International conference proceedings, etc.
No
Vertex Coloring of Comparability+ke and -ke Graphs

Y.Takenaga and K.Higashide
32nd International Workshop on Graph-Theoretic Concepts in Computer Science (LNCS4271)
102-112
2006/06



31 International conference proceedings, etc.
Yes
Size and Variable Ordering of OBDDs Representing Threshold Functions(共著)

Y.Takenaga, M.Nouzoe and S.Yajima
COCOON'97
91-100
1997



32 International conference proceedings, etc.
Yes
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions(共著)

K.Hosaka, Y.Takenaga and S.Yajima
ISAAC'94
584-592
1994/08