[1] V. Cohen-Addad, D. Das, E. Kipouridis, N. Parotsidis, and M. Thorup, “Fitting distances by tree metrics minimizing the total error within a constant factor,” in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2022, pp. 468–479.
[2] N. Ailon and M. Charikar, “Fitting tree metrics: Hierarchical clustering and phylogeny,” in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), IEEE, 2005, pp. 73–82.
[3] M. Farach, S. Kannan, and T. Warnow, “A robust model for finding optimal evolutionary trees,” Algorithmica, vol. 13, no. 1, pp. 155–179, 1995.
[4] M. Gromov, “Hyperbolic groups,” in Essays in group theory, Springer, 1987, pp. 75–263.
[5] L. L. Cavalli-Sforza and A. W. Edwards, "Phylogenetic analysis: models and estimation procedures," American journal of human genetics, vol. 19, no. 3 Pt 1, p. 233, 1967.
[6] I. Chami, Z. Ying, C. Ré, and J. Leskovec, "Hyperbolic graph convolutional neural networks," Advances in neural information processing systems, vol. 32, 2019.
[7] R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup, "On the approximability of numerical taxonomy (fitting distances by tree metrics)," SIAM Journal on Computing, vol. 28, no. 3, pp. 1073-1085, 1998.
[8] N. Saitou and M. Nei, “The neighbor-joining method: A new method for reconstructing phylogenetic trees,” Molecular biology and evolution, vol. 4, no. 4, pp. 406–425, 1987.
[9] R. Sonthalia and A. C. Gilbert, "Tree! i am no tree! i am a low dimensional hyperbolic embedding," arXiv preprint arXiv:2005.03847, 2020.
[10] S. Chatterjee and L. Sloman, “Average gromov hyperbolicity and the parisi ansatz,” Advances in Mathematics, vol. 376, p. 107417, 2021.
[11] É. Ghys and P. De La Harpe, "Espaces métriques hyperboliques," in Sur les groupes hyperboliques d'après Mikhael Gromov, Springer, 1990, pp. 27-45.
[12] B. Harb, S. Kannan, and A. McGregor, "Approximating the best-fit tree under 1 p norms," in Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005. Proceedings, Springer, 2005, pp. 123-133.
[13] S. Chowdhury, F. Mémoli, and Z. T. Smith, "Improved error bounds for tree representations of metric spaces," Advances in Neural Information Processing Systems, vol. 29, 2016.
[14] R. A. Rossi and N. K. Ahmed, "The network data repository with interactive graph analytics and visualization," in AAAI, 2015. [Online]. Available: https://networkrepository.com.
[15] P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, "Collective classification in network data," AI magazine, vol. 29, no. 3, pp. 93-93, 2008.
[16] W. H. Day, “Computational complexity of inferring phylogenies from dissimilarity matrices,” Bulletin of mathematical biology, vol. 49, no. 4, pp. 461–467, 1987.
[17] B. H. Bowditch, “A course on geometric group theory,” 2006.
[18] H. Samet, “The quadtree and related hierarchical data structures,” ACM Computing Surveys (CSUR), vol. 16, no. 2, pp. 187–260, 1984.
[19] M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng, "Lower-stretch spanning trees," SIAM Journal on Computing, vol. 38, no. 2, pp. 608-628, 2008.
[20] N. Ailon, M. Charikar, and A. Newman, "Aggregating inconsistent information: Ranking and clustering," Journal of the ACM (JACM), vol. 55, no. 5, pp. 1-27, 2008.
[21] V. Chepoi, F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, “Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs,” in Proceedings of the twenty-fourth annual symposium on Computational geometry, 2008, pp. 59–68.
[22] W. Chen, W. Fang, G. Hu, and M. W. Mahoney, "On the hyperbolicity of small-world and treelike random graphs," *Internet Mathematics*, vol. 9, no. 4, pp. 434-491, 2013.
[23] D. Coudert, A. Nusser, and L. Viennot, "Computing graph hyperbolicity using dominating sets*," in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), SIAM, 2022, pp. 78-90.