Graph Layout Algorithms
Graph Layout Algorithms is a class of computational methods in graph visualization that determines the geometric placement of nodes and edges in a two- or three-dimensional space to optimize visual clarity and structural interpretability.
1.6K
Publications
99.2K
Citations
2.6K
Authors
958
Institutions
Publications per year
2017–2026
163
1.6K
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations
1–5 of 1.6K
2.6K
21
h-index
20
h-index
18
h-index
18
h-index
18
h-index
1–5 of 2.6K
958

University of Waterloo
Waterloo, Canada
21 h-index
47 publications
2.5K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
61 publications
2.6K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
20 h-index
41 publications
1.9K citations

Monash University
Melbourne, Australia
19 h-index
46 publications
2K citations

Sapienza University of Rome
Rome, Italy
19 h-index
46 publications
3.9K citations
University of Perugia
Perugia, Italy
19 h-index
64 publications
1.9K citations
Université de Bordeaux
Bordeaux, France
18 h-index
34 publications
1.6K citations
University of Arizona
Tucson, United States
18 h-index
34 publications
1.1K citations
1–8 of 958
103 publications · 4K citations
33
h-index
TVCG · 42 publications · 2.6K citations
31
h-index
JGAA · 62 publications · 2.3K citations
28
h-index
70 publications · 2.3K citations
27
h-index
57 publications · 3K citations
27
h-index
1–5