It was written by Marcus Schaefer, a professor of computer science at DePaul University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications.

[2][3] After a third chapter relating the crossing number to graph parameters including skewness, bisection width, thickness, and (via the Albertson conjecture) the chromatic number, the final chapter of part I concerns the computational complexity of finding minimum-crossing graph drawings, including the results that the problem is both NP-complete and fixed-parameter tractable.

[1][2][3] In the second part of the book, two chapters concern the rectilinear crossing number, describing graph drawings in which the edges must be represented as straight line segments rather than arbitrary curves, and Fáry's theorem that every planar graph can be drawn without crossings in this way.

The final chapter of part II concerns thrackles and the problem of finding drawings with a maximum number of crossings.

[2] Reviewing the book, L. W. Beineke calls it a "valuable contribution" for its presentation of the many results in this area.