The following publications are possibly variants of this publication:
- On the approximation of largest common subtrees and largest common point setsTatsuya Akutsu, Magnús M. Halldórsson. TCS, 233(1-2):33-50, 2000. [doi]
- Improved approximation of the largest common subtree of two unordered trees of bounded heightTatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu. ipl, 109(2):165-170, 2008. [doi]
- On the complexity of finding a largest common subtree of bounded degreeTatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu. TCS, 590:2-16, 2015. [doi]
- On the Complexity of Finding a Largest Common Subtree of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu. fct 2013: 4-15 [doi]
- Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point SetsTatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama. dcg, 20(3):307-331, 1998. [doi]
- Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point SetsTatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama. compgeom 1997: 314-323 [doi]