What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Graph theory
- Algorithm
Peter Eades focuses on Graph drawing, Theoretical computer science, Combinatorics, Discrete mathematics and Visualization.
His biological study spans a wide range of topics, including Algorithm and Force-directed graph drawing.
He has included themes like Dominance drawing and Crossing number in his Force-directed graph drawing study.
Peter Eades combines subjects such as Plane, Reverse engineering and Directed graph with his study of Theoretical computer science.
His studies deal with areas such as Cardinality and Three-dimensional graph as well as Discrete mathematics.
His Visualization research includes themes of Graph, Computer graphics and Response time.
His most cited work include:
- Graph Drawing: Algorithms for the Visualization of Graphs (1719 citations)
- A Heuristic for Graph Drawing (1054 citations)
- Algorithms for drawing graphs: an annotated bibliography (759 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Graph drawing, Combinatorics, Discrete mathematics, Visualization and Graph.
His research integrates issues of Graph, Graph theory, Theoretical computer science and Force-directed graph drawing in his study of Graph drawing.
His work deals with themes such as Graph Layout, Data visualization and Readability, which intersect with Theoretical computer science.
In his work, Slope number is strongly intertwined with Dominance drawing, which is a subfield of Force-directed graph drawing.
His Combinatorics research integrates issues from Algorithm and Planar.
His studies deal with areas such as Computer graphics, Human–computer interaction and Complex network as well as Visualization.
He most often published in these fields:
- Graph drawing (36.49%)
- Combinatorics (34.68%)
- Discrete mathematics (27.48%)
What were the highlights of his more recent work (between 2016-2021)?
- Graph (21.62%)
- Visualization (24.77%)
- Graph drawing (36.49%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Graph, Visualization, Graph drawing, Theoretical computer science and Combinatorics.
The various areas that Peter Eades examines in his Graph study include Algorithm and Spatial network.
His work on Tree structure as part of general Algorithm research is frequently linked to Dominance relation, thereby connecting diverse disciplines of science.
Peter Eades has researched Visualization in several fields, including Mental mapping, Human–computer interaction and Complex network.
Peter Eades undertakes multidisciplinary investigations into Graph drawing and Quality in his work.
His Theoretical computer science research incorporates elements of Neighbourhood graph, Power graph analysis, Graph Layout, Readability and Neighbourhood.
Between 2016 and 2021, his most popular works were:
- Shape-Based Quality Metrics for Large Graph Visualization (25 citations)
- Proxy Graph: Visual Quality Metrics of Big Graph Sampling (20 citations)
- Gap-planar graphs (18 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Graph theory
- Algorithm
Peter Eades mostly deals with Visualization, Graph, Graph drawing, Theoretical computer science and Discrete mathematics.
His Visualization study incorporates themes from Group theory and Ground truth.
His Graph study integrates concerns from other disciplines, such as Time complexity, Planar and Planarity testing.
His Graph drawing study results in a more complete grasp of Data mining.
His studies in Theoretical computer science integrate themes in fields like Power graph analysis, Visual comparison, Graph Layout, Readability and Complex network.
His Discrete mathematics research is multidisciplinary, incorporating perspectives in Neighbourhood and Spatial network.
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.
