An information theory perspective on the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Raffaele Pesenti (Oper. Res. Lett., 2020)

On the approximability of the fixed-tree balanced minimum evolution problem. - Martin Frohn (Optim. Lett., 2021)

Models and methods for computational phylogenetics under minimum evolution. - Martin Frohn (2021)

A tutorial on the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Olivier Gascuel; Raffaele Pesenti (Eur. J. Oper. Res., 2022)

A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Olivier Gascuel; Raffaele Pesenti (Comput. Oper. Res., 2023)

A branch-&-price approach to the unrooted maximum agreement forest problem. - Martin Frohn; Steven Kelk; Simona Vychytilova (CoRR, 2024)

Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. - Steven Chaplick; Martin Frohn; Steven Kelk; Johann Lottermoser; Matús Mihalák (Discret. Appl. Math., 2025)

Reconstructing semi-directed level-1 networks using few quarnets. - Martin Frohn; Niels Holtgrefe; Leo van Iersel; Mark Jones 001; Steven Kelk (J. Comput. Syst. Sci., 2025)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks. - Martin Frohn; Steven Kelk (Ann. Oper. Res., 2025)