Hi, I'm Eli Fox-Epstein
I study graph algorithms and computation geometry at Brown University.
My code can be found on Github
. Some highlights:
All author ordering on papers follows alphabetical convention.
On Wrapping Spheres and Cubes with Rectangular Paper,
A Cole, E D Demaine, E Fox-Epstein,
Diffuse Reflections in Simple Polygons,
G Barequet, S M Cannon, E Fox-Epstein, B Hescott, D L Souvaine, C D Toth, A Winslow,
Short and Simple Cycle Separators in Planar Graphs,
E Fox-Epstein, S Mozes, P M Phothilimthana, C Sommer,
The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs,
E Fox-Epstein, D Krizanc,
LNCS: Computer Science — Theory and Applications 2012
Forbidden Pairs Make Problems Hard,
Wesleyan University senior honors thesis