Thesis Information
Title: Closed Quasigeodesics, Escaping from Polygons, and Conflict-Free Graph Coloring
Adviser: Erik Demaine
Institution: MIT
Graduation Date: June 2018
Contact Information
Email Candidate
Candidate Website
Candidate Bio:
Seven years of teaching undergrad- and grad-level graph theory, complexity theory, and other math and CS to high schoolers at Canada/USA Mathcamp, with a preference for inquiry-based learning over lectures. Some undergrad and grad TAing. Assorted research in computational complexity, graph theory, and computational geometry: see my CV.
Paper 1:
Abel, Z., Alvarez, V., Demaine, E.D., Fekete, S.P., Gour, A., Hesterberg, A., Keldenich, P., Scheffer, C.: Three colors suffice: Conflict-free coloring of planar graphs. In: Proc. 28th SODA. pp. 1951–1963 (2017)
Link to PDFPaper 2:
Adam Hesterberg and Justin Kopinsky. The parameterized complexity of ricochet robots. Journal of Information Processing, 25:716–723, 2017.
Link to PDFPaper 3:
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, … . Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, and Y. William Yu. Journal of Information Processing, volume 25, 2017, pages 515–527. Special issue of papers from the 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games.
Link to PDFKeywords: algorithms and data structures, computational complexity, computational geometry, algorithmic graph theory and combinatorics, approximation algorithms