What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Geometry
David Eppstein focuses on Combinatorics, Discrete mathematics, Algorithm, Planar graph and Time complexity.
His study in Minimum spanning tree, Spanning tree, Binary logarithm, Forbidden graph characterization and 1-planar graph falls within the category of Combinatorics.
His studies in Algorithm integrate themes in fields like Mathematical optimization and Set.
His work in Planar graph tackles topics such as Slope number which are related to areas like Polyhedral graph.
His research in Time complexity intersects with topics in Shortest path problem, Graph theory, Knapsack problem, Efficient algorithm and Floyd–Warshall algorithm.
His study on Graph theory also encompasses disciplines like
- Speedup which connect with Binary tree and Connectivity,
- Combinatorial optimization which connect with Digraph and Vertex.
His most cited work include:
- Finding the k Shortest Paths (1151 citations)
- MESH GENERATION AND OPTIMAL TRIANGULATION (516 citations)
- The crust and the B-Skeleton: combinatorial curve reconstruction (369 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Discrete mathematics, Planar graph, Time complexity and Graph.
His research in Combinatorics is mostly concerned with Spanning tree.
His Planar graph study integrates concerns from other disciplines, such as Planar straight-line graph, Outerplanar graph and Book embedding.
His work in Time complexity is not limited to one particular discipline; it also encompasses Graph.
David Eppstein has researched Bounded function in several fields, including Planarity testing and Treewidth.
The study incorporates disciplines such as Algorithm and Data structure in addition to Set.
He most often published in these fields:
- Combinatorics (67.25%)
- Discrete mathematics (28.38%)
- Planar graph (16.16%)
What were the highlights of his more recent work (between 2015-2021)?
- Combinatorics (67.25%)
- Bounded function (8.44%)
- Planar graph (16.16%)
In recent papers he was focusing on the following fields of study:
David Eppstein mostly deals with Combinatorics, Bounded function, Planar graph, Graph and Discrete mathematics.
David Eppstein works mostly in the field of Combinatorics, limiting it down to topics relating to Plane and, in certain cases, Binary logarithm.
His Bounded function research incorporates themes from Minor, Planarity testing, Simple, Vertex and Algorithm.
His Planar graph study incorporates themes from Matching and Data structure.
David Eppstein has included themes like Planar and Theoretical computer science in his Graph study.
A large part of his Discrete mathematics studies is devoted to 1-planar graph.
Between 2015 and 2021, his most popular works were:
- Structure of Graphs with Locally Restricted Crossings (39 citations)
- Rigid origami vertices: conditions and forcing sets (27 citations)
- Track Layouts, Layered Path Decompositions, and Leveled Planarity (25 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Geometry
- Combinatorics
His main research concerns Combinatorics, Bounded function, Planar graph, Graph and Algorithm.
His studies deal with areas such as Discrete mathematics and Planar as well as Combinatorics.
He interconnects Minor, Planarity testing and Vertex in the investigation of issues within Bounded function.
He has included themes like Set, Maximal set, Matching, Path and Vertex in his Planar graph study.
His biological study spans a wide range of topics, including Spanning tree, Infinitesimal and Conjecture.
His Algorithm study incorporates themes from Hash function and Set operations.
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.
