Orthogonal Graph Drawing

Orthogonal Graph Drawing is a type of node-link diagram in which edges are routed exclusively along horizontal and vertical line segments, with vertices represented as points or boxes and edges meeting at right angles, to enhance readability and minimize edge crossings in graph layouts.

37

Publications

1.5K

Citations

56

Authors

23

Institutions

Publications per year

2017–2026

0

Variants

Orthogonal Graph Layout

Authors

56

  1. IG
    Ioannis G. Tollis

    The University of Texas at Dallas, United States

    8 publications · 259 citations

    8

    h-index

  2. AP
    Achilleas Papakostas

    The University of Texas at Dallas, United States

    6 publications · 204 citations

    6

    h-index

  3. TB
    Thérèse Biedl

    University of Waterloo, Canada

    5 publications · 246 citations

    5

    h-index

  4. RT
    Roberto Tamassia

    Brown University, United States

    4 publications · 393 citations

    4

    h-index

  5. DR
    David R. Wood

    Carleton University, Canada

    4 publications · 76 citations

    4

    h-index

1–5 of 56

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 12 publications · 362 citations

    11

    h-index

  2. Algorithmica

    4 publications · 80 citations

    4

    h-index

  3. Computational Geometry

    4 publications · 282 citations

    4

    h-index

  4. Information Processing Letters

    2 publications · 87 citations

    2

    h-index

  5. ACM Transactions on Algorithms

    TALG · 2 publications · 40 citations

    2

    h-index

1–5