Research
I received a PhD as part of the CS Theory group at UCI. I was fortunate to be advised by David Eppstein and Michael Goodrich. Before that, I got a bachelor's degree in CS from UPC in my hometown, Barcelona.
My research spans computational geometry, greedy algorithms, graph data structures, computational biology, and recreational mathematics. My dissertation, New Applications of the Nearest-neighbor Chain Algorithm (see also: blog post, advisor's blog post, defense slides) studies how to relax the "greedy choice" in certain greedy algorithms without affecting the final solution. This idea, paired with an algorithmic technique called nearest-neighbor chain, allows us to speed up some greedy algorithms (like the Multi-fragment algorithm for Euclidean TSP from O(n2) to O(n log n) (paper)).
Publications
- Click on a publication for a brief summary.
- All papers are freely available online (PDF icon).
- Authors are in alphabetical order, per convention in CS theory, except when marked with "*".
- See also my academic CV or my Google Scholar profile.