Crossing Minimization

Crossing Minimization is a graph layout optimization problem that seeks to reduce the number of edge crossings in a drawing of a graph, distinguished from other layout criteria by its focus on topological simplicity and visual clarity.

115

Publications

5.5K

Citations

204

Authors

129

Institutions

Publications per year

2017–2026

12

Variants

Edge Crossing Minimization

Authors

204

  1. PM
    Petra Mutzel

    TU Dortmund University, Germany

    16 publications · 626 citations

    14

    h-index

  2. CG
    Carsten Gutwenger

    TU Dortmund University, Germany

    11 publications · 347 citations

    11

    h-index

  3. MC
    Markus Chimani

    TU Dortmund University, Germany

    10 publications · 219 citations

    10

    h-index

  4. MJ
    Michael Jünger

    Universität Greifswald, Germany

    6 publications · 361 citations

    6

    h-index

  5. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    5 publications · 441 citations

    5

    h-index

1–5 of 204

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 9 publications · 350 citations

    9

    h-index

  2. Algorithmica

    5 publications · 509 citations

    5

    h-index

  3. ACM Journal of Experimental Algorithmics

    JEA · 5 publications · 126 citations

    5

    h-index

  4. Discrete & Computational Geometry

    4 publications · 198 citations

    4

    h-index

  5. Electronic Notes in Discrete Mathematics

    3 publications · 74 citations

    3

    h-index

1–5