I am a computer scientist specialized in algorithm design.
I received a PhD as part of the CS Theory group at UCI. I was fortunate to be advised by Professors David Eppstein and Michael Goodrich. Before that, I got a bachelor's degree in CS from UPC in my hometown of Barcelona. I am currently a software engineer at Google.
My research spans graph algorithms, computational geometry, greedy algorithms, and data structures. My dissertation,
New Applications of the Nearest-neighbor
Chain Algorithm (blog article, defense slides)
studies how to
weaken the selection rule of greedy algorithms without affecting the final
solution. This idea, paired with an algorithmic technique called
nearest-neighbor chain, allows
us to speed up greedy algorithms for several problems such as TSP.
See Research for more.