I am currently a postdoc at Maastricht University in the Algorithms group under the supervision of Steven Kelk. I obtained my Bachelor’s and Master’s degree in Economathematics at the University of Cologne in 2017. After that, I completed my doctoral studies at the Center for Operations Research and Econometrics (CORE) at UCLouvain under the supervision of Daniele Catanzaro. Before going to Maastricht I was a postdoc at Eindhoven University of Technology as a member of NETWORKS.
Email: martin.frohn@maastrichtuniversity.nl
Address: Maastricht University, Paul-Henri Spaaklaan 1, 6229 EN Maastricht, The Netherlands
My research interests are in combinatorial optimization, phylogenetics and algebraic statistics.
M. Frohn, N. Holtgrefe, L. Van Iersel, M. Jones, S. Kelk, Bounds on the sequence length sufficient to reconstruct level-1 phylogenetic networks, Preprint
A. Englander, M. Frohn, E. Gross, N. Holtgrefe, L. Van Iersel, M. Jones, S. Sullivant, Identifiability of phylogenetic level-2 networks under the Jukes-Cantor model, Preprint
M. Frohn, K. Manson, On properties driving diversity index selection, Preprint
M. Frohn, K. Manson, A minimal compact description of the diversity index polytope, Preprint
M. Frohn, S. Kelk, S. Vychytilova, A branch-&-price approach to the unrooted maximum agreement forest problem, Operations Research Letters, 63, 107364, 2025
M. Frohn, N. Holtgrefe, L. Van Iersel, M. Jones, S. Kelk, Invariants for level-1 phylogenetic networks under the random walk 4-state Markov model, Preprint
M. Frohn, N. Holtgrefe, L. Van Iersel, M. Jones, S. Kelk, Reconstructing semi-directed level-1 networks using few quarnets, Journal of Computer and System Sciences, 152, 103655, 2025
M. Frohn, S. Kelk, A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks, Annals of Operations Research, 345, 125-145, 2025
S. Chaplick, M. Frohn, S. Kelk, J. Lottermoser, M. Mihalák, Approximation Ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs, Discrete Applied Mathematics, 360, 275-281, 2025
D. Catanzaro, M. Frohn, O. Gascuel, R. Pesenti, A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem, Computers and Operations Research, 158, 106308, 2023
D. Catanzaro, M. Frohn, O. Gascuel, R. Pesenti, A tutorial on the balanced minimum evolution problem, Invited Review, European Journal of Operational Research, 300(1), 1-19, 2022
M. Frohn, On the approximability of the fixed-tree balanced minimum evolution problem, Optimization Letters, 15, 2321-2329, 2021
D. Catanzaro, M. Frohn, R. Pesenti, An information theory perspective on the balanced minimum evolution problem, Operations Research Letters, 48, 362-367, 2020
SIAM Confernce on Applied Algebraic Geometry, Madison, Wisconsin, United States, on July 7 - 11, 2025
Conference on Mathematical and Computational Evolutionary Biology, Granada, Spain, on May 12 - 16, 2025
ICERM semester program Theory, Methods, and Applications of Quantitative Phylogenomics, Providence, Rhode Island, United States, on September 4 - December 6, 2024
33rd European Conference on Operational Research, Copenhagen, Denmark, on June 30 - July 3, 2024
Conference on Mathematical and Computational Evolutionary Biology, Cargèse, Corsica, France, on June 12-16, 2023
26th Annual New Zealand Phylogenomics Meeting, Napier, New Zealand, February 7-10, 2023
23rd Belgian Mathematical Optimization Workshop, La-Roche-en-Ardennes, Belgium, April 25-26, 2019
International Conference on Operations Research, Brussels, Belgium, September 12-14, 2018
23rd International Symposium on Mathematical Programming, Bordeaux, France, July 1-6, 2018
I’ve been a teaching assistant (TA), course coordinator (CC) and primary supervisor of bachelor theses (SB) / master theses (SM) for the following courses and students, respectively:
2026 CC Linear Algebra (Maastricht Science Program)
2025 TA Linear Programming
TA Master Research Project
SB O. Steenstra, Implementation and evaluation of a 2-approximation algorithm for the softwired parsimony score problem on binary, tree-child phylogenetic networks
2024 TA Discrete Mathematics
SM S. Vychytilová, Branch and Price for Computing Unrooted Maximum Agreement Forests
SB V. Fajardo, An Algorithm for Folding Tessellated Planes into 3D Shapes for Origami Robotics
2023 TA Discrete Mathematics
2023 SB N. Bongaerts, A New Method to Measure Tree-basedness of Rooted Binary Phylogenetic Networks
2022 TA Statistics for Industrial Engineers
TA Mathematical Modelling
2020 TA Programming project (in French)
2019 TA Integer Programming and Combinatorial Optimization
2018 TA Integer Programming and Combinatorial Optimization
2017 TA Efficient Algorithms (in German)
2016 TA Fundamentals of computer science 1 & 2 (in German)
2015 TA Fundamentals of computer science 1 & 2 (in German)
2014 TA Programming course (in German)