Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Takenaga, Yasuhiko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
PSPACE-completeness of an escape problem
Yasuhiko Takenaga
,
Shigeru Arai
Information Processing Letters
108
(4), 2008, pp. 229-233
Vertex coloring of comparability+
k
e and -
k
e graphs
Yasuhiko Takenaga
,
Kenichi Higashide
Lecture Notes in Computer Science
4271
, 2006, pp. 102-112
TETRAVEX is
NP
-complete
Yasuhiko Takenaga
,
Toby Walsh
Information Processing Letters
99
(5), 2006, pp. 171-174
Tree-shellability of Boolean functions
Yasuhiko Takenaga
,
Kouji Nakajima
,
Shuzo Yajima
Theoretical Computer Science
262
(1-2), 2001, pp. 633-647
Hardness of identifying the minimum ordered binary decision diagram
Yasuhiko Takenaga
,
Shuzo Yajima
Discrete Applied Mathematics
107
(1-3), 2000, pp. 191-201
Size and variable ordering of OBDDs representing threshold functions
Yasuhiko Takenaga
,
Mitsushi Nouzoe
,
Shuzo Yajima
Lecture Notes in Computer Science
1276
, 1997, pp. 91-100
On the size of ordered binary decision diagrams representing threshold functions
Kazuhisa Hosaka
,
Yasuhiko Takenaga
,
Shuzo Yajima
Lecture Notes in Computer Science
834
, 1994, pp. 584-592