Tree Layout Algorithms

Tree Layout Algorithms is a computational method that systematically arranges hierarchical tree structures in visual space by determining node positions and edge routing to optimize readability, minimize crossings, and preserve structural relationships.

104

Publications

5.9K

Citations

216

Authors

121

Institutions

Publications per year

2017–2026

7

Authors

216

  1. YC
    Yao‐Wen Chang

    National Taiwan University, Taiwan

    4 publications · 77 citations

    4

    h-index

  2. AG
    Ashim Garg

    Brown University, United States

    4 publications · 160 citations

    4

    h-index

  3. IH
    I. Hal Sudborough

    The University of Texas at Dallas, United States

    3 publications · 83 citations

    3

    h-index

  4. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    3 publications · 142 citations

    3

    h-index

  5. RT
    Roberto Tamassia

    Brown University, United States

    3 publications · 142 citations

    3

    h-index

1–5 of 216

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 7 publications · 522 citations

    7

    h-index

  2. Software Practice and Experience

    4 publications · 231 citations

    4

    h-index

  3. Information Processing Letters

    4 publications · 186 citations

    4

    h-index

  4. Discrete Applied Mathematics

    3 publications · 153 citations

    3

    h-index

  5. Computational Geometry

    3 publications · 191 citations

    3

    h-index

1–5