Lipardi, V., Dibenedetto, M., Stamoulis, G., & Winands, M. H. M. (2026). A Study on Stabilizer Rényi Entropy Estimation using Machine Learning. In 2025 IEEE International Conference on Quantum Artificial Intelligence (QAI) (pp. 159-164). IEEE. https://doi.org/10.1109/QAI63978.2025.00032
Lipardi, V., Dibenedetto, D., Stamoulis, G., & Winands, M. H. M. (2025). Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search. Advanced Quantum Technologies, 8(10), Article e2500093. https://doi.org/10.1002/qute.202500093
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