Bounds for rectilinear crossing numbers
Journal of Graph Theory
New bounds on crossing numbers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Improved approximations of crossings in graph drawings
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the crossing number of complete graphs
Proceedings of the eighteenth annual symposium on Computational geometry
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Linear algebra approach to geometric graphs
Journal of Combinatorial Theory Series A
An algorithm for the graph crossing number problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
Crossing numbers have drawn much attention in the last couple of years and several surveys [22], [28], [33], problem collections [26], [27], and bibliographies [40] have been published. The present survey tries to give pointers to some of the most significant recent developments and identifies computational challenges.