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. Advance online publication. 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
Ardévol Martínez, V., Chaplick, S., Kelk, S., Meuwese, R., Mihalák, M., & Stamoulis, G. (2024). Relaxed Agreement Forests. In H. Fernau, S. Gaspers, & R. Klasing (Eds.), SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings (Vol. 14519 LNCS, pp. 40-54). Springer Science and Business Media B.V.. https://doi.org/10.1007/978-3-031-52113-3_3
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