Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Bringmann, K., Gawrychowski, P., Mozes, S., & Weimann, O. (2018). Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). In A. Czumaj (Ed.), Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1190-1206). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.77.