 | 2009 |
|---|
| 11 |       | Yasuhiko Takenaga,
Toby Walsh:
Tetravex is NP-complete
CoRR abs/0903.1147: (2009) |
| 2008 |
|---|
| 10 | | Yasuhiko Takenaga,
Nao Katougi:
Tree-Shellability of Restricted DNFs.
IEICE Transactions 91-D(4): 996-1002 (2008) |
| 9 | | Yasuhiko Takenaga,
Shigeru Arai:
PSPACE-completeness of an escape problem.
Inf. Process. Lett. 108(4): 229-233 (2008) |
| 2006 |
|---|
| 8 | | Yasuhiko Takenaga,
Kenichi Higashide:
Vertex Coloring of Comparability+ke and -ke Graphs.
WG 2006: 102-112 |
| 7 | | Yasuhiko Takenaga,
Toby Walsh:
Tetravex is NP-complete.
Inf. Process. Lett. 99(5): 171-174 (2006) |
| 2005 |
|---|
| 6 | | Tetsuro Nishino,
Yasuhiko Takenaga:
Foreword.
IEICE Transactions 88-D(1): 10-11 (2005) |
| 2001 |
|---|
| 5 | | Yasuhiko Takenaga,
Kouji Nakajima,
Shuzo Yajima:
Tree-shellability of Boolean functions.
Theor. Comput. Sci. 262(1): 633-647 (2001) |
| 2000 |
|---|
| 4 |  | Yasuhiko Takenaga,
Shuzo Yajima:
Hardness of identifying the minimum ordered binary decision diagram.
Discrete Applied Mathematics 107(1-3): 191-201 (2000) |
| 1997 |
|---|
| 3 | | Yasuhiko Takenaga,
Mitsushi Nouzoe,
Shuzo Yajima:
Size and Variable Ordering of OBDDs Representing Treshold Functions.
COCOON 1997: 91-100 |
| 2 | | Kazuhisa Hosaka,
Yasuhiko Takenaga,
T. Kaneda,
Shuzo Yajima:
Size of Ordered Binary Decision Diagrams Representing Threshold Functions.
Theor. Comput. Sci. 180(1-2): 47-60 (1997) |
| 1994 |
|---|
| 1 | | Kazuhisa Hosaka,
Yasuhiko Takenaga,
Shuzo Yajima:
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions.
ISAAC 1994: 584-592 |
