Czabarka, E., Kelk, S., Moulton, V., & Székely, L. A. (2026). Coconvex characters on collections of phylogenetic trees. Advances in Applied Mathematics, 172, Article 102952. https://doi.org/10.1016/j.aam.2025.102952
Frohn, M., Kelk, S., & Vychytilova, S. (2025). A branch-&-price approach to the unrooted maximum agreement forest problem. Operations Research Letters, 63, Article 107364. https://doi.org/10.1016/j.orl.2025.107364
Kelk, S., Linz, S., & Semple, C. (2025). Bounding the SNPR Distance Between Two Tree-Child Networks Using Generalised Agreement Forests. Electronic Journal of Combinatorics, 32(3), Article P3.46. https://doi.org/10.37236/13976
Frohn, M., Holtgrefe, N., van Iersel, L., Jones, M., & Kelk, S. (2025). Reconstructing semi-directed level-1 networks using few quarnets. Journal of Computer and System Sciences, 152, Article 103655. https://doi.org/10.1016/j.jcss.2025.103655
Frohn, M., & Kelk, S. (2025). A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks. Annals of Operations Research, 345(1), 125-145. https://doi.org/10.1007/s10479-024-06452-0
Chaplick, S., Frohn, M., Kelk, S., Lottermoser, J., & Mihalák, M. (2025). Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. Discrete Applied Mathematics, 360, 275-281. https://doi.org/10.1016/j.dam.2024.09.009
Kelk, S., Linz, S., & Meuwese, R. (2024). Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics. Journal of Computer and System Sciences, 142, Article 103519. https://doi.org/10.1016/j.jcss.2024.103519
Chaplick, S., Frohn, M., Kelk, S., Lottermoser, J., & Mihalak, M. (2024). Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. (2403.10868 ed.) Cornell University - arXiv. arXiv.org No. 2403.10868 https://doi.org/10.48550/arXiv.2403.10868