2016 - ACM Fellow For contributions to geometric computing, data structures, and graph algorithms.
2013 - Fellow of John Simon Guggenheim Memorial Foundation
2006 - Fellow of Alfred P. Sloan Foundation
Erik D. Demaine focuses on Combinatorics, Algorithm, Discrete mathematics, 1-planar graph and Treewidth. His Combinatorics research is multidisciplinary, incorporating elements of Computer game and Rotation. The study incorporates disciplines such as Ideal, Sequence, Combinatorial game theory, Artificial intelligence and Upper and lower bounds in addition to Algorithm.
His study on Robotics is often connected to Graduate students as part of broader study in Artificial intelligence. Erik D. Demaine studied Upper and lower bounds and Adaptive algorithm that intersect with Theoretical computer science. His research in Binary logarithm intersects with topics in Matching, Data structure, Memory hierarchy and Cache-oblivious algorithm.
Erik D. Demaine mainly focuses on Combinatorics, Discrete mathematics, Algorithm, Geometry and Theoretical computer science. His studies in Combinatorics integrate themes in fields like Polygon, Upper and lower bounds and Regular polygon. Regular polygon connects with themes related to Plane in his study.
His work is connected to 1-planar graph, Treewidth, Pathwidth, Chordal graph and Partial k-tree, as a part of Discrete mathematics. Erik D. Demaine studies Chordal graph, focusing on Clique-sum in particular. As part of his studies on Theoretical computer science, Erik D. Demaine often connects relevant areas like Computational complexity theory.
Erik D. Demaine mainly investigates Combinatorics, Time complexity, Computational complexity theory, Discrete mathematics and Polyhedron. The concepts of his Combinatorics study are interwoven with issues in Polyomino and Regular polygon. His Time complexity research is multidisciplinary, relying on both Path, Bounded function and The Intersect.
His Computational complexity theory research incorporates themes from Theoretical computer science, Control reconfiguration and Motion planning. His study looks at the relationship between Discrete mathematics and fields such as Parameterized complexity, as well as how they intersect with chemical problems. His work deals with themes such as Polycube, Hinge, Edge and Convex polytope, which intersect with Polyhedron.
Combinatorics, Computational complexity theory, Polyhedron, Topology and Vertex are his primary areas of study. His Combinatorics research is multidisciplinary, incorporating perspectives in Discrete mathematics, Plane and Regular polygon. In general Discrete mathematics study, his work on Chordal graph, Brooks' theorem and 1-planar graph often relates to the realm of Edge coloring and Complete coloring, thereby connecting several areas of interest.
His work carried out in the field of Computational complexity theory brings together such families of science as Theoretical computer science, Motion planning, Hardness of approximation, Edge matching and Gadget. His Polyhedron research includes elements of Grid and Stack. His work in Topology addresses issues such as Robot, which are connected to fields such as Constant, Connected component, Control reconfiguration, Grippers and Actuator.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Erik D. Demaine;Joseph O'Rourke.
A method for building self-folding machines
S. Felton;M. Tolley;E. Demaine;D. Rus.
Anchor-Free Distributed Localization in Sensor Networks
Nissanka Bodhi Priyantha;Hari Balakrishnan;Erik D. Demaine;Seth J. Teller.
international conference on embedded networked sensor systems (2003)
Programmable matter by folding
E. Hawkes;B. An;N. M. Benbernou;H. Tanaka.
Proceedings of the National Academy of Sciences of the United States of America (2010)
Frequency estimation of Internet packet streams with limited space
Erik D. Demaine;Alejandro Lopez-Ortiz;J. Ian Munro.
Lecture Notes in Computer Science (2002)
An optimal decomposition algorithm for tree edit distance
Erik D. Demaine;Shay Mozes;Benjamin Rossman;Oren Weimann.
ACM Transactions on Algorithms (2009)
Michael A. Bender;Erik D. Demaine;Martin Farach-Colton.
SIAM Journal on Computing (2005)
Mobile-assisted localization in wireless sensor networks
N.B. Priyantha;H. Balakrishnan;E.D. Demaine;S. Teller.
international conference on computer communications (2005)
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos.
Journal of the ACM (2005)
Geometric Folding Algorithms by Erik D. Demaine
Erik D. Demaine;Joseph O'Rourke.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: