Graph Drawing Algorithms
Graph Drawing Algorithms is a computational method that belongs to the class of graph visualization techniques, distinguished by its systematic procedures for positioning nodes and edges in a geometric space to optimize visual clarity, structural representation, and aesthetic criteria in attributed or unattributed graphs.
251
Publications
25.2K
Citations
358
Authors
183
Institutions
Publications per year
2017–2026
11
251
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations
P. Eades · 1984 · 1.2K citations
W. T. Tutte · Proceedings of the London Mathematical Society · 1963 · 1.1K citations
Algorithms for drawing graphs: an annotated bibliography
Giuseppe Di Battista, Peter Eades, Roberto Tamassia et al. · Computational Geometry · 1994 · 860 citations
1–5 of 251
358
18
h-index
18
h-index
17
h-index
14
h-index
12
h-index
1–5 of 358
183
University of Perugia
Perugia, Italy
12 h-index
30 publications
1.1K citations
Brown University
Providence, United States
12 h-index
19 publications
1.9K citations

The University of Sydney
Sydney, Australia
11 h-index
20 publications
870 citations

Sapienza University of Rome
Rome, Italy
10 h-index
16 publications
2.4K citations

Tohoku University
Sendai, Japan
9 h-index
16 publications
709 citations
University of Newcastle Australia
Newcastle, Australia
8 h-index
9 publications
1.4K citations

The University of Queensland
Brisbane, Australia
8 h-index
13 publications
1.3K citations
The University of Texas at Dallas
Richardson, United States
8 h-index
9 publications
1.1K citations
1–8 of 183
JGAA · 30 publications · 1.3K citations
21
h-index
18 publications · 1.6K citations
16
h-index
9 publications · 357 citations
9
h-index
IJCGA · 9 publications · 277 citations
9
h-index
8 publications · 3.1K citations
8
h-index
1–5