Preprint 'Maximum Coverage k-Antichains and Chains: A Greedy Approach'; Conference Publication 'Practical Minimum Path Cover'; Journal Publication 'Width Helps and Hinders Splitting Flows'; Conference Publication 'Sorting Finite Automata via Partition Refinement'; Conference Publication 'Minimum Chain Cover in Almost Linear Time'.
Research Experience
Currently a HIIT Postdoctoral Fellow at Aalto University, working with Professor Sándor Kisfaludi-Bak. Previously worked as a Postdoctoral Researcher in the group Combinatorics of Efficient Computations led by Parinya Chalermsook. Before that, was a Postdoctoral Researcher at the University of Helsinki in the Graph Algorithms team led by Alexandru I. Tomescu.
Education
PhD in Computer Science, 2023, University of Helsinki; MSc in Computer Science, 2019, University of Chile; BSc in Computer Science, 2016, University of Chile. Advisor: Gonzalo Navarro (during Master's).
Background
Interests: Graph Algorithms, String Algorithms, Paramaterized Algorithms, Algorithmic Bioinformatics, Compressed Data Structures, Approximation Algorithms. Previously a Doctoral Student at the University of Helsinki, focusing on graph algorithms and bioinformatics.