Computing the Rooted Triplet Distance Between Phylogenetic Networks. - Jesper Jansson 001; Konstantinos Mampentzidis; Ramesh Rajaby; Wing-Kin Sung (Algorithmica, 2021)

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. - Gerth Stølting Brodal; Konstantinos Mampentzidis (ACM J. Exp. Algorithmics, 2021)

Building a small and informative phylogenetic supertree. - Jesper Jansson 001; Konstantinos Mampentzidis; T. P. Sandhya 001 (Inf. Comput., 2023)