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
115
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
Edge crossings in drawings of bipartite graphs
Peter Eades, Nicholas Wormald · Algorithmica · 1994 · 290 citations
Crisscross optimization algorithm and its application
Anbo Meng, Yucheng Chen, Hao Yin et al. · Knowledge-Based Systems · 2014 · 252 citations
1–5 of 115
204
14
h-index
11
h-index
10
h-index
6
h-index
5
h-index
1–5 of 204
129
TU Dortmund University
Dortmund, Germany
8 h-index
21 publications
517 citations
Universitat de València
Valencia, Spain
6 h-index
9 publications
241 citations
Technical University of Košice
Košice, Slovakia
5 h-index
8 publications
126 citations

TU Wien
Vienna, Austria
5 h-index
9 publications
302 citations

University of Cologne
Cologne, Germany
4 h-index
6 publications
192 citations
Courant Institute of Mathematical Sciences
New York, United States
4 h-index
4 publications
230 citations
City College of New York
New York, United States
4 h-index
4 publications
199 citations

Autonomous University of San Luis Potosí
San Luis Potosí City, Mexico
3 h-index
7 publications
180 citations
1–8 of 129
JGAA · 9 publications · 350 citations
9
h-index
5 publications · 509 citations
5
h-index
JEA · 5 publications · 126 citations
5
h-index
4 publications · 198 citations
4
h-index
3 publications · 74 citations
3
h-index
1–5