Graph Crossing Minimization

Graph Crossing Minimization is a computational optimization problem in graph drawing that seeks to reduce the number of edge crossings in a node-link diagram by determining an optimal arrangement of vertices and edges while preserving the underlying graph structure.

79

Publications

4.4K

Citations

150

Authors

99

Institutions

Publications per year

2017–2026

9

Authors

150

  1. PM
    Petra Mutzel

    TU Dortmund University, Germany

    12 publications · 344 citations

    11

    h-index

  2. CG
    Carsten Gutwenger

    TU Dortmund University, Germany

    9 publications · 288 citations

    9

    h-index

  3. MC
    Markus Chimani

    TU Dortmund University, Germany

    8 publications · 170 citations

    8

    h-index

  4. MN
    Martin Nöllenburg

    Karlsruhe Institute of Technology, Germany

    3 publications · 53 citations

    3

    h-index

  5. CT
    Carsten Thomassen

    Technical University of Denmark, Denmark

    3 publications · 122 citations

    3

    h-index

1–5 of 150

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 6 publications · 110 citations

    6

    h-index

  2. ACM Journal of Experimental Algorithmics

    JEA · 5 publications · 126 citations

    5

    h-index

  3. Algorithmica

    3 publications · 134 citations

    3

    h-index

  4. 3

    h-index

  5. Computers & Operations Research

    2 publications · 56 citations

    2

    h-index

1–5