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
Chaplick, S., Kelk, S., Meuwese, R., Mihalák, M., & Stamoulis, G. (2023). Snakes and Ladders: A Treewidth Story. In D. Paulusma, & B. Ries (Eds.), Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers: 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
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
de Campos, C. P., Stamoulis, G., & Weyland, D. (2020). A structured view on weighted counting with relations to counting, quantum computation and applications. Information and Computation, 275, Article 104627. https://doi.org/10.1016/j.ic.2020.104627
Janssen, R., Jones, M., Kelk, S., Stamoulis, G., & Wu, T. (2019). Treewidth of display graphs: bounds, brambles and applications. Journal of Graph Algorithms and Applications, 23(4), 715-743. https://doi.org/10.7155/jgaa.00508
Van Iersel, L., Kelk, S., Stamoulis, G., Stougie, L., & Boes, O. (2018). On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. Algorithmica, 80(11), 2993-3022. https://doi.org/10.1007/s00453-017-0366-5