His scientific interests lie mostly in Combinatorics, Discrete mathematics, Planar graph, Graph drawing and Outerplanar graph. His Combinatorics study frequently intersects with other fields, such as Theory of computation. The concepts of his Planar graph study are interwoven with issues in Class, Grid and Integer.
The various areas that Giuseppe Liotta examines in his Graph drawing study include Time complexity, Planarity testing, Graph theory and Theoretical computer science. His Outerplanar graph research includes themes of 1-planar graph and Delaunay triangulation. His Book embedding research is multidisciplinary, incorporating elements of Embedding, Graph embedding and Force-directed graph drawing.
Giuseppe Liotta spends much of his time researching Combinatorics, Discrete mathematics, Planar graph, Graph drawing and Outerplanar graph. His work is dedicated to discovering how Combinatorics, Planar are connected with Slope number and other disciplines. His research integrates issues of Embedding, Planarity testing and Regular polygon in his study of Discrete mathematics.
In his study, Upper and lower bounds is inextricably linked to Vertex, which falls within the broad field of Planar graph. Visualization is closely connected to Theoretical computer science in his research, which is encompassed under the umbrella topic of Graph drawing. His research in Outerplanar graph intersects with topics in Delaunay triangulation, Forbidden graph characterization and Block graph.
The scientist’s investigation covers issues in Combinatorics, Graph drawing, Graph, Planar graph and Planar. His work deals with themes such as Discrete mathematics and Embedding, which intersect with Combinatorics. His Graph drawing research includes elements of Visual analytics, Graph theory and Information retrieval.
His Graph research incorporates themes from Distributed computing, Quadratic equation, Right angle, Edge matching and Upper and lower bounds. His study in Planar graph is interdisciplinary in nature, drawing from both Graph embedding, Plane, Convex position, Efficient algorithm and Visibility. His biological study spans a wide range of topics, including Digraph, Upward planar drawing, Edge and Slope number.
Combinatorics, Graph drawing, Planar graph, Planarity testing and Graph are his primary areas of study. His work carried out in the field of Combinatorics brings together such families of science as Discrete mathematics, Planar and Heuristic. The study incorporates disciplines such as Decision support system and Edge in addition to Graph drawing.
Giuseppe Liotta has researched Planar graph in several fields, including Computational geometry and Visibility. His Planarity testing research incorporates elements of Theoretical computer science, Graph theory, Bounded function, Theory of computation and Graph algorithms. His Graph study integrates concerns from other disciplines, such as Time complexity and Right angle.
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.
An experimental comparison of four graph drawing algorithms
Giuseppe Di Battista;Ashim Garg;Giuseppe Liotta;Roberto Tamassia.
Computational Geometry: Theory and Applications (1997)
Upward drawings of triconnected digraphs
P. Bertolazzi;G. Di Battista;G. Liotta;C. Mannino.
Drawing Graphs with Right Angle Crossings
Walter Didimo;Peter Eades;Giuseppe Liotta.
workshop on algorithms and data structures (2009)
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
Stefan Felsner;Giuseppe Liotta;Stephen K. Wismath.
Journal of Graph Algorithms and Applications (2003)
An annotated bibliography on 1-planarity
Stephen G. Kobourov;Giuseppe Liotta;Fabrizio Montecchiani.
Computer Science Review (2017)
Graph Visualization Techniques for Web Clustering Engines
E. Di Giacomo;W. Didimo;L. Grilli;G. Liotta.
IEEE Transactions on Visualization and Computer Graphics (2007)
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Giuseppe Liotta;Franco P. Preparata;Roberto Tamassia.
SIAM Journal on Computing (1999)
Right angle crossing graphs and 1-planarity
Peter Eades;Giuseppe Liotta.
Discrete Applied Mathematics (2013)
Fáry’s Theorem for 1-Planar Graphs
Seok-Hee Hong;Peter Eades;Giuseppe Liotta;Sheung-Hung Poon.
computing and combinatorics conference (2012)
Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations
V. Batagelj;F. J. Brandenburg;W. Didimo;G. Liotta.
ieee pacific visualization symposium (2010)
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: