I am a PhD student in the theory group of the computer science department at the University of California, Irvine (UCI). I started at UCI in Fall 2018.
MS expected: Spring 2020. PhD expected: 2023.
See my CV for professional experience.
My current and recent research includes hierarchical clustering algorithms and their relationship to combinatorial optimization problems; a graph simplification problem; studying the graphs that arise from configurations in a game involving pegs and disks (Towers of Hanoi); and a problem motivated by drawing aesthetically pleasing (Lombardi) graphs.
- N. Mamano, A. Efrat, D. Eppstein, D. Frishberg, M. T. Goodrich, S.G. Kobourov, P. Matias, V. Polishchuk.
Euclidean TSP, motorcycle graphs, and other new applications of nearest-neighbor chains.
Computational Geometry: Young Researchers Forum, 2019.
Will appear: Proc. 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai, China, 2019.
Preprint available at https://arxiv.org/abs/1902.06875.
- Daniel Frishberg and William Gasarch.
Open Problems Column: Different Ways to Prove a Language is Not Regular.
SIGACT News, March 2018.
Available at https://dl.acm.org/citation.cfm?id=3197413&dl=ACM&coll=DL