S.M. Kelk

Recente publicaties

• Mestel, D., Chaplick, S., Kelk, S., & Meuwese, R. (2026). Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. Journal of Computer and System Sciences, 160, Article 103800. https://doi.org/10.1016/j.jcss.2026.103800

  Meer informatie over deze publicatie
• Fischer, M., Kelk, S., & Vazquez Alferez, S. (2026). A strengthened bound on the number of states required to characterize maximum parsimony distance. Theoretical Computer Science, 1080, Article 116057. https://doi.org/10.1016/j.tcs.2026.116057

  Meer informatie over deze publicatie
• Frohn, M., Holtgrefe, N., Iersel, L. V., Jones, M., & Kelk, S. (2026). Bounds on the Sequence Length Sufficient to Reconstruct Binary Level-1 Phylogenetic Networks Under the CFN Model. Annals of Combinatorics. https://doi.org/10.1007/s00026-026-00830-0

  Meer informatie over deze publicatie
• Martínez, V. A., Chaplick, S., Kelk, S., Meuwese, R., Mihalák, M., & Stamoulis, G. (2026). Relaxed Agreement Forests of Phylogenetic Trees. Journal of Graph Algorithms and Applications, 30(1), 25-46. https://doi.org/10.7155/jgaa.v30i1.2962

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie
• 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

  Meer informatie over deze publicatie

Ga naar alle publicaties