Constrained Graph Drawing

Constrained Graph Drawing is a type of graph drawing method that incorporates user-defined or application-specific constraints to restrict the placement or routing of vertices and edges, thereby differentiating it from unconstrained graph layout techniques by enforcing additional structural, geometric, or semantic conditions during visualization.

9

Publications

424

Citations

28

Authors

16

Institutions

Publications per year

2017–2026

2

Authors

28

  1. KR
    Kathy Ryall

    Mitsubishi Electric (United States), United States

    1 publications · 87 citations

    1

    h-index

  2. TP
    Tommaso Pastore

    University of Naples Federico II, Italy

    1 publications · 20 citations

    1

    h-index

  3. SP
    Samraat Pawar

    Imperial College London, United Kingdom

    1 publications · 71 citations

    1

    h-index

  4. MS
    Miro Spönemann

    Christian-Albrechts-Universität zu Kiel, Germany

    1 publications · 39 citations

    1

    h-index

  5. KM
    Kim Marriott

    Monash University, Australia

    1 publications · 47 citations

    1

    h-index

1–5 of 28

Venues

  1. Algorithmica

    2 publications · 49 citations

    2

    h-index

  2. BMC Bioinformatics

    1 publications · 47 citations

    1

    h-index

  3. European Journal of Operational Research

    1 publications · 20 citations

    1

    h-index

  4. Discrete Applied Mathematics

    1 publications · 36 citations

    1

    h-index

  5. Journal of Visual Languages & Computing

    JVLC · 1 publications · 39 citations

    1

    h-index

1–5