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
[1]
Hilfe
Suche: Author="Takasu, Atsuhiro"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of finding a largest common subtree of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
,
Avraham A. Melkman
,
Atsuhiro Takasu
Theoretical Computer Science
590
, 2015, pp. 2-16
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Magnús M. Halldórsson
,
Atsuhiro Takasu
,
Keisuke Tanaka
Theoretical Computer Science
470
, 2013, pp. 10-22
Efficient exponential time algorithms for edit distance between unordered trees
Tatsuya Akutsu
,
Takeyuki Tamura
,
Daiji Fukagawa
,
Atsuhiro Takasu
Lecture Notes in Computer Science
7354
, 2012, pp. 360-372
Exact algorithms for computing the tree edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
,
Takeyuki Tamura
Theoretical Computer Science
412
(4-5), 2011, pp. 352-364
Approximating tree edit distance through string edit distance
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Algorithmica
57
(2), 2010, pp. 325-348
Improved approximation of the largest common subtree of two unordered trees of bounded height
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Information Processing Letters
109
(2), 2008, pp. 165-170
Approximating tree edit distance through string edit distance
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Lecture Notes in Computer Science
4288
, 2006, pp. 90-99