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. Advance online publication. https://doi.org/10.1016/j.jcss.2024.103519
Bosch-Calvo, M., & Kelk, S. (2023). An Improved Kernel for the Flip Distance Problem on Simple Convex Polygons. Information Processing Letters, 182, Article 106381. https://doi.org/10.1016/j.ipl.2023.106381
Kelk, S., Linz, S., & Meuwese, R. (2023). Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. Information Processing Letters, 180, Article 106336. https://doi.org/10.1016/j.ipl.2022.106336
Chaplick, S., Kelk, S., Meuwese, R., Mihalák, M., & Stamoulis, G. (2023). Snakes and Ladders: A Treewidth Story. In Graph-Theoretic Concepts in Computer Science: 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers (pp. 187-200). Springer, Cham. https://doi.org/10.1007/978-3-031-43380-1_14
Borst, S., van Iersel, L., Jones, M., & Kelk, S. (2022). New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. Algorithmica, 84(7), 2050-2087. https://doi.org/10.1007/s00453-022-00946-8
Kelk, S., & Meuwese, R. (2022). Sharp upper and lower bounds on a restricted class of convex characters. Electronic Journal of Combinatorics, 29(1), Article P1.50. https://doi.org/10.37236/10589
van Wersch, R., Kelk, S., Linz, S., & Stamoulis, G. (2022). Reflections on kernelizing and computing unrooted agreement forests. Annals of Operations Research, 309(1), 425-451. https://doi.org/10.1007/s10479-021-04352-1
