D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 34 Citations 4,886 288 World Ranking 2053 National Ranking 65
Computer Science D-index 34 Citations 5,067 321 World Ranking 8140 National Ranking 223

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Artificial intelligence
  • Algorithm

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.

His most cited work include:

  • An experimental comparison of four graph drawing algorithms (147 citations)
  • Drawing Graphs with Right Angle Crossings (141 citations)
  • Upward drawings of triconnected digraphs (119 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Combinatorics (66.40%)
  • Discrete mathematics (41.11%)
  • Planar graph (36.36%)

What were the highlights of his more recent work (between 2014-2021)?

  • Combinatorics (66.40%)
  • Graph drawing (29.25%)
  • Graph (17.39%)

In recent papers he was focusing on the following fields of study:

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.

Between 2014 and 2021, his most popular works were:

  • An annotated bibliography on 1-planarity (94 citations)
  • A Survey on Graph Drawing Beyond Planarity (55 citations)
  • Recognizing and drawing IC-planar graphs☆ (51 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Combinatorics
  • Algorithm

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.

Best Publications

An experimental comparison of four graph drawing algorithms

Giuseppe Di Battista;Ashim Garg;Giuseppe Liotta;Roberto Tamassia.
Computational Geometry: Theory and Applications (1997)

236 Citations

Upward drawings of triconnected digraphs

P. Bertolazzi;G. Di Battista;G. Liotta;C. Mannino.
Algorithmica (1994)

166 Citations

Drawing Graphs with Right Angle Crossings

Walter Didimo;Peter Eades;Giuseppe Liotta.
workshop on algorithms and data structures (2009)

150 Citations

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)

126 Citations

An annotated bibliography on 1-planarity

Stephen G. Kobourov;Giuseppe Liotta;Fabrizio Montecchiani.
Computer Science Review (2017)

112 Citations

Graph Visualization Techniques for Web Clustering Engines

E. Di Giacomo;W. Didimo;L. Grilli;G. Liotta.
IEEE Transactions on Visualization and Computer Graphics (2007)

106 Citations

Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design

Giuseppe Liotta;Franco P. Preparata;Roberto Tamassia.
SIAM Journal on Computing (1999)

106 Citations

Right angle crossing graphs and 1-planarity

Peter Eades;Giuseppe Liotta.
Discrete Applied Mathematics (2013)

96 Citations

Fáry’s Theorem for 1-Planar Graphs

Seok-Hee Hong;Peter Eades;Giuseppe Liotta;Sheung-Hung Poon.
computing and combinatorics conference (2012)

95 Citations

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)

90 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Giuseppe Liotta

Michael Kaufmann

Michael Kaufmann

University of Tübingen

Publications: 92

Giuseppe Di Battista

Giuseppe Di Battista

Roma Tre University

Publications: 60

Petra Mutzel

Petra Mutzel

University of Bonn

Publications: 47

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 42

Ioannis G. Tollis

Ioannis G. Tollis

University of Crete

Publications: 42

David R. Wood

David R. Wood

Monash University

Publications: 40

Roberto Tamassia

Roberto Tamassia

Brown University

Publications: 32

David Eppstein

David Eppstein

University of California, Irvine

Publications: 27

Peter Eades

Peter Eades

University of Sydney

Publications: 21

Sue Whitesides

Sue Whitesides

University of Victoria

Publications: 19

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 18

Michael Jünger

Michael Jünger

University of Cologne

Publications: 16

Gunnar W. Klau

Gunnar W. Klau

Heinrich Heine University Düsseldorf

Publications: 14

Jan Kratochvíl

Jan Kratochvíl

Charles University

Publications: 12

Jack Snoeyink

Jack Snoeyink

University of North Carolina at Chapel Hill

Publications: 10

Ulrik Brandes

Ulrik Brandes

ETH Zurich

Publications: 8

Trending Scientists

Schoukens Johan

Schoukens Johan

Vrije Universiteit Brussel

Lin Zhong

Lin Zhong

Yale University

Anke Spannenberg

Anke Spannenberg

Leibniz Institute for Catalysis

Albert Eschenmoser

Albert Eschenmoser

ETH Zurich

Jeffrey C. Murray

Jeffrey C. Murray

University of Iowa

Rolf Bodmer

Rolf Bodmer

Discovery Institute

Thomas P. Sakmar

Thomas P. Sakmar

Rockefeller University

Wouter H. Lamers

Wouter H. Lamers

Maastricht University

Gabriele Stiller

Gabriele Stiller

Karlsruhe Institute of Technology

Mary M. Machulda

Mary M. Machulda

Mayo Clinic

Marc Joliot

Marc Joliot

University of Bordeaux

Jeffrey D. Robinson

Jeffrey D. Robinson

Portland State University

James E. Ryan

James E. Ryan

University of Virginia

Carlo Oleari

Carlo Oleari

National Institute for Nuclear Physics

Zhongping Chen

Zhongping Chen

University of California, Irvine

Something went wrong. Please try again later.