Constrained Graph Layout
Constrained Graph Layout is a graph layout method that incorporates specified geometric, positional, or relational constraints to guide the placement of nodes and edges, distinguishing it from unconstrained layout algorithms by enforcing user-defined or application-driven conditions during the visualization process.
17
Publications
1.1K
Citations
45
Authors
31
Institutions
Publications per year
2017–2026
3
Parents
17
Scalable, Versatile and Simple Constrained Graph Layout
Tim Dwyer · Computer Graphics Forum · 2009 · 92 citations
Symbolic layout compaction review
D.G. Boyer · Design Automation Conference · 1988 · 82 citations
1–5 of 17
45
4
h-index
3
h-index
2
h-index
1
h-index
1
h-index
1–5 of 45
31

Monash University
Melbourne, Australia
3 h-index
6 publications
268 citations
Microsoft (United States)
Redmond, United States
3 h-index
3 publications
203 citations
Leibniz-Institut für Pflanzengenetik und Kulturpflanzenforschung (IPK)
Gatersleben, Germany
2 h-index
2 publications
111 citations
ETH Zurich
Zurich, Switzerland
2 h-index
3 publications
67 citations
Tsinghua University
Beijing, China
1 h-index
3 publications
93 citations
Core Competence
Santa Fe, United States
1 h-index
1 publications
82 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
75 citations
University of Konstanz
Konstanz, Germany
1 h-index
1 publications
23 citations
1–8 of 31
2 publications · 117 citations
2
h-index
2 publications · 23 citations
2
h-index
Conference · 1 publications · 82 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 36 citations
1
h-index
1–5