B.Sc. from Dalhousie University(1995), M.Math. from University of Waterloo(1996), Ph.D from University of Waterloo (2001）
Massachusetts Institute of Technology Assistant Professor(2001-2005), Massachusetts Institute of Technology Associate Professor(2005-2007), Massachusetts Institute of Technology Associate Professor with tenure(2007-2011), Massachusetts Institute of Technology Professor(2011-)
・ 2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs , Demaine, E.D.| Karntikoon, K.| Pitimanaaree, N. , Theory of Computing Systems
・ Tiling with Three Polygons Is Undecidable , Demaine, E.D.| Langerman, S. , Leibniz International Proceedings in Informatics, LIPIcs
・ WHO NEEDS CROSSINGS?: NONCROSSING LINKAGES ARE UNIVERSAL, AND DECIDING (GLOBAL) RIGIDITY IS HARD* , Abel, Z.| Demaine, E.D.| Demaine, M.L.| Eisenstat, S.| Lynch, J.| Schardl, T.B. , Journal of Computational Geometry
・ Simulation of programmable matter systems using active tile-based self-assembly , Alumbaugh, J.C.| Daymude, J.J.| Demaine, E.D.| Patitz, M.J.| Richa, A.W. , Natural Computing
・ Hardness of Traversing Gadget Systems with Small Bandwidth , Demaine, E.D.| Diomidova, J.| Gomez, T.| Hecher, M.| Lynch, J. , Leibniz International Proceedings in Informatics, LIPIcs