Manuel Caceres obtained a MSc. in Computer Science under the supervision of Prof. Gonzalo Navarro in University of Chile, in 2019. Later, in 2023, he received a PhD. in Computer Science under the supervision of Prof. Alexandru I. Tomescu in University of Helsinki. During 2023 he worked as a Postdoctoral Researcher in the group Graph Algorithms of University of Helsinki. Manuel currently works as a HIIT Postdoctoral Fellow in the group of Prof.Sándor Kisfaludi‑Bakin the group Computational Geometry.
Manuel’s main research interests are on Graph and String Algorithms and Data Structures, with a focus on fast algorithms for polynomially solvable problems as well as on problems with applications to bioinformatics. Some of his research highlights are a parameterized linear time algorithm for the problem of string matching to labeled graphs, the first parameterized linear time algorithm for computing a minimum path cover, as well as the first almost linear time solution for minimum chain cover.
Sample of publications
[1] Francisco Sena, Aleksandr Politov, Corentin Moumard, Manuel Cáceres, Sebastian Schmidt, Juha Harviainen, Alexandru I. Tomescu. 2025. Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
[2] Nicola Rizzo, Manuel Cáceres & Veli Mäkinen. 2025. Practical Colinear Chaining on Sequences Revisited. In: Tang, J., Lai, X., Cai, Z., Peng, W., Wei, Y. (eds) Bioinformatics Research and Applications. ISBRA 2025. Lecture Notes in Computer Science(), vol 15757.
[3] Nicola Rizzo, Manuel Cáceres, Veli Mäkinen, Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs, Bioinformatics, Volume 41, Issue Supplement_1, July 2025, Pages i265–i274,