I am a 4th year Computer Science PhD candidate in the Theory group at UCI. I am advised by Professor David Eppstein and Professor Michael Goodrich.
I have a Bachelor Degree in CS from UPC. I conducted my senior thesis at UCI under the guidance of Professor Wayne Hayes.
Office: Donald Bren Hall, room 4099
E-mail: nmamano (at) uci.edu
Research interests (currently in search for a postdoc!):
Perhaps there are two ways to go about CS: one is to use algorithms as a means to solve problems; the other, to study algorithms as entities of interest in their own right. I gravitate towards the latter.
My research is currently driven by the question “When is global information necessary vs when is local information sufficient?” While this is a central question in distributed algorithms, my latest preprint examines it the context of computational geometry.
I am also interested in the interplay between graph algorithms and computation geometry (my favorite fields) and borrowing ideas between them. In a recent paper, we considered traditionally-geometric data structures in a graph-theoretical setting, a line of work I plan to continue.
- N. Mamano, A. Efrat, D. Eppstein, D. Frishberg, M. Goodrich, S. Kobourov, P. Matias, V. Polishchuk, “Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains,”
- G. Barequet, D. Eppstein, M.T. Goodrich, and N. Mamano, “Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms,” ICALP'18
- D. Eppstein, M.T. Goodrich, and N. Mamano, “Reactive Proximity Data Structures for Graphs,” LATIN'18
- D. Eppstein, M.T. Goodrich, D. Korkmaz, and N. Mamano, “Defining Equitable Geographic Districts in Road Networks via Stable Matching,” short paper in SIGSPATIAL'17
- D. Eppstein, M.T. Goodrich, and N. Mamano, “Algorithms for Stable Matching and Clustering in a Grid,” IWCIA'17
- D. Eppstein, M.T. Goodrich, J. Lam, N. Mamano, M. Mitzenmacher, and M. Torres, “Models and algorithms for Graph Watermarking,” ISC'16
I contributed to the RACSO online Judge, a great teaching tool for the subject «Theory of Computation». It contains a collection of automatically-judged exercises asking to define recognizers / generators of formal languages (regular or context-free), as well as exercises asking for reductions between problems (undecidable or NP-complete).
SANA: a tool for aligning biological networks.
A new solution to the knight's tour problem.
Here is a collection of songs I've written, and a demo of the song I wrote for my sister's wedding!