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="Yamaguchi, Atsuko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Application of a new probabilistic model for recognizing complex patterns in glycans
Kiyoko F. Aoki
,
Nobuhisa Ueda
,
Atsuko Yamaguchi
,
Minoru Kanehisa
,
Tatsuya Akutsu
,
Hiroshi Mamitsuka
Bioinformatics
20
(S1), 2004, pp. 6-14
Finding the maximum common subgraph of a partial
k
-tree and a graph with a polynomially bounded number of spanning trees
Atsuko Yamaguchi
,
Kiyoko F. Aoki
,
Hiroshi Mamitsuka
Information Processing Letters
92
(2), 2004, pp. 57-63
Finding the maximum common subgraph of a partial
k
-tree and a graph with a polynomially bounded number of spanning trees
Atsuko Yamaguchi
,
Hiroshi Mamitsuka
Lecture Notes in Computer Science
2906
, 2003, pp. 58-67
An approximation algorithm for the two-layered graph drawing problem
Atsuko Yamaguchi
,
Akihiro Sugimoto
Lecture Notes in Computer Science
1627
, 1999, pp. 81-91