What is he best known for?
The fields of study he is best known for:
- Algorithm
- Artificial intelligence
- Programming language
Ioannis G. Tollis mainly focuses on Algorithm, Graph drawing, Combinatorics, Force-directed graph drawing and Planar graph.
His work carried out in the field of Algorithm brings together such families of science as Queue and Constant.
His research investigates the link between Graph drawing and topics such as Outerplanar graph that cross with problems in Book embedding, 1-planar graph and Indifference graph.
His Combinatorics study integrates concerns from other disciplines, such as Discrete mathematics and Planar.
His Force-directed graph drawing study combines topics in areas such as Dominance drawing and Theoretical computer science.
The study incorporates disciplines such as Time complexity and Graph theory in addition to Planar graph.
His most cited work include:
- Graph Drawing: Algorithms for the Visualization of Graphs (1719 citations)
- Algorithms for drawing graphs: an annotated bibliography (759 citations)
- A unified approach to visibility representations of planar graphs (323 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Graph drawing, Combinatorics, Algorithm, Discrete mathematics and Theoretical computer science.
His Graph drawing research is multidisciplinary, incorporating elements of Computational geometry, Graph, Force-directed graph drawing and Graph theory.
His biological study spans a wide range of topics, including Planar and Embedding.
His work in Algorithm addresses subjects such as Routing, which are connected to disciplines such as Communication channel.
His research integrates issues of Computer graphics, Construct, Directed acyclic graph, Visualization and Optimization problem in his study of Theoretical computer science.
His work deals with themes such as Transitive closure and Slope number, which intersect with Dominance drawing.
He most often published in these fields:
- Graph drawing (29.83%)
- Combinatorics (27.62%)
- Algorithm (29.28%)
What were the highlights of his more recent work (between 2012-2020)?
- Directed graph (12.15%)
- Algorithm (29.28%)
- Discrete mathematics (24.86%)
In recent papers he was focusing on the following fields of study:
His main research concerns Directed graph, Algorithm, Discrete mathematics, Theoretical computer science and Time complexity.
His work investigates the relationship between Discrete mathematics and topics such as Combinatorics that intersect with problems in Planar.
His studies in Theoretical computer science integrate themes in fields like Visualization, Graph drawing, Neuroscience and Readability.
His Graph drawing research integrates issues from Planarity testing and Force-directed graph drawing.
His Force-directed graph drawing study combines topics from a wide range of disciplines, such as Graph database, Graph Layout and SPQR tree.
His studies deal with areas such as Graph and Reachability as well as Time complexity.
Between 2012 and 2020, his most popular works were:
- A vision and strategy for the virtual physiological human: 2012 update (67 citations)
- A vision and strategy for the virtual physiological human: 2012 update (67 citations)
- Fan-planarity (25 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Artificial intelligence
- Programming language
Ioannis G. Tollis mainly investigates Theoretical computer science, Graph drawing, Directed graph, Visualization and Discrete mathematics.
The concepts of his Theoretical computer science study are interwoven with issues in Synchronization, Brain network, Neuroscience and Graph theoretic.
His Graph drawing study frequently links to adjacent areas such as Force-directed graph drawing.
His biological study spans a wide range of topics, including Graph database, Graph, Graph Layout and SPQR tree.
He works mostly in the field of Visualization, limiting it down to topics relating to Time complexity and, in certain cases, Tree of life, Phylogenetic tree, Directed acyclic graph and Phylogenetic network.
His Discrete mathematics study combines topics in areas such as Embedding, Monotonic function and Combinatorics.
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.
