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
Parents
79
A technique for drawing directed graphs
Emden R. Gansner, E. Koutsofios, Stephen C. North et al. · IEEE Transactions on Software Engineering · 1993 · 675 citations
Crossing Number is NP-Complete
M. R. Garey, David S. Johnson · SIAM Journal on Algebraic and Discrete Methods · 1983 · 669 citations
Graphs drawn with few crossings per edge
János Pach · COMBINATORICA · 1997 · 299 citations · Full text
Crossing Theory and Hierarchy Mapping
John Warfield · IEEE Transactions on Systems Man and Cybernetics · 1977 · 183 citations
1–5 of 79
150
11
h-index
9
h-index
8
h-index
3
h-index
3
h-index
1–5 of 150
99
TU Dortmund University
Dortmund, Germany
7 h-index
18 publications
406 citations
Universitat de València
Valencia, Spain
4 h-index
6 publications
182 citations

TU Wien
Vienna, Austria
4 h-index
8 publications
265 citations
Technical University of Košice
Košice, Slovakia
4 h-index
6 publications
106 citations

University of Cologne
Cologne, Germany
3 h-index
4 publications
118 citations
University of Colorado Boulder
Boulder, United States
3 h-index
3 publications
393 citations

The University of Sydney
Sydney, Australia
3 h-index
7 publications
436 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
3 h-index
6 publications
110 citations
1–8 of 99
JGAA · 6 publications · 110 citations
6
h-index
JEA · 5 publications · 126 citations
5
h-index
3 publications · 134 citations
3
h-index
3 publications · 280 citations
3
h-index
2 publications · 56 citations
2
h-index
1–5