Sofia VAZQUEZ ALFEREZ
I’m a PhD candidate in the Algorithms and Complexity and Mathematical Modeling groups at Utrecht University. I work with Artem Kaznatcheev. I am broadly interested in graph algorithms, and I have recently been working on the theory of Local Search from a Computational Complexity perspective.
I like all things graph-related, and love combinatorial arguments.
PUBLICATIONS
- A strengthened bound on the number of states required to characterize maximum parsimony distance. Mareike Fischer, Steven Kelk, Sofia Vazquez Alferez. Pre-print, November 2025.
- Greed Is Slow on Sparse Graphs of Oriented Valued Constraints. Artem Kaznatcheev, Sofia Vazquez Alferez. Proceedings of the 31st International Conference on Principles and Practice of Constraint Programming, Vol. 340, August 2025.
- When is local search both effective and efficient?. Artem Kaznatcheev, Sofia Vazquez Alferez. Preprint, June 2025.
- Destroying Densest Subgraphs is Hard. Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez. Journal of Computer and System Sciences, Vol. 151, August 2025. A short version appeared in SWAT, 2024.
- Content-Based Course Recommender System for Liberal Arts Education. Raphaël Morsomme, Sofia Vazquez Alferez. Proceedings of the 12th International Conference on Educational Data Mining, 2019
TEACHING
2024-2025
2023-2024
2022-2023
2021-2022
I was teaching full-time at University College Maastricht. Here is a small sample of the courses I was teaching:
- Datamining - Maastricht University
- Philosophy of Science - Maastricht University
- Argumentation I - Maastricht University
- Argumentation II - Maastricht University
- Research Project - Maastricht University
CONTACT
Email: s.vazquezalferez@uu.nl
Buys Ballotgebouw, Princetonplein 5, 3584 CC Utrecht, NL