Edge-crossing Reduction

Edge-Crossing Reduction is a computational objective in spatial network visualization that belongs to the class of layout optimization criteria, specifically distinguished by its focus on minimizing the number of edge intersections in node-link diagrams to enhance visual clarity and readability.

30

Publications

2.2K

Citations

78

Authors

38

Institutions

Publications per year

2017–2026

2

Authors

78

  1. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    2 publications · 115 citations

    2

    h-index

  2. RJ
    Radu Jianu

    Brown University, United States

    2 publications · 50 citations

    2

    h-index

  3. MN
    Masao Nagasaki

    Tohoku Medical Megabank Organization, Japan

    2 publications · 45 citations

    2

    h-index

  4. FJ
    F. J. Newbery

    Karlsruhe Institute of Technology, Germany

    2 publications · 71 citations

    2

    h-index

  5. FM
    Fabrizio Montecchiani

    University of Perugia, Italy

    2 publications · 38 citations

    2

    h-index

1–5 of 78

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 3 publications · 73 citations

    3

    h-index

  2. Discrete & Computational Geometry

    2 publications · 140 citations

    2

    h-index

  3. Computational Geometry

    1 publications · 27 citations

    1

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 1 publications · 675 citations

    1

    h-index

  5. 1

    h-index

1–5