What is he best known for?
The fields of study he is best known for:
- Algorithm
- Geometry
- Artificial intelligence
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.
His most cited work include:
- A method for building self-folding machines (536 citations)
- Frequency Estimation of Internet Packet Streams with Limited Space (455 citations)
- Anchor-Free Distributed Localization in Sensor Networks (441 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (48.25%)
- Discrete mathematics (21.96%)
- Algorithm (13.31%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (48.25%)
- Time complexity (7.65%)
- Computational complexity theory (4.66%)
In recent papers he was focusing on the following fields of study:
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.
Between 2016 and 2021, his most popular works were:
- Origamizer: A Practical Algorithm for Folding Any Polyhedron (32 citations)
- Particle computation: complexity, algorithms, and logic (15 citations)
- An End-to-End Approach to Self-Folding Origami Structures (12 citations)
In his most recent research, the most cited papers focused on:
- Geometry
- Algorithm
- Operating system
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.
