Hi, I'm Eli Fox-Epstein

PhD student into graph algorithms at Brown.


Email: eli@fox-epste.in


arXiv · Google Scholar · DBLP

  1. Polynomial-Time Algorithm for Sliding Tokens on Trees, E D Demaine, M L Demaine, E Fox-Epstein, D A Hoang, T Ito, H Ono, Y Otachi, R Uehara, T Yamada, arXiv 2014, ISAAC2014
  2. The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles, E Fox-Epstein, R Uehara, CCCG 2014, WAAC 2014
  3. Diffuse Reflection Radius in a Simple Polygon, E Fox-Epstein, C D Toth, A Winslow, COCOON 2014
  4. On Wrapping Spheres and Cubes with Rectangular Paper, A Cole, E D Demaine, E Fox-Epstein, JCDCGG 2013
  5. Diffuse Reflections in Simple Polygons, G Barequet, S M Cannon, E Fox-Epstein, B Hescott, D L Souvaine, C D Toth, A Winslow, LAGOS 2013
  6. Short and Simple Cycle Separators in Planar Graphs, E Fox-Epstein, S Mozes, P M Phothilimthana, C Sommer, ALENEX 2013
  7. The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs, E Fox-Epstein, D Krizanc, LNCS: Computer Science — Theory and Applications 2012
  8. Forbidden Pairs Make Problems Hard, E Fox-Epstein, Wesleyan University senior honors thesis
All author ordering on papers follows alphabetical convention.


Some projects are on Github. Highlights: