Are there any implementations of a graph crossing algorithm? This is much more focused version of this question:

Are there good implementations for easy subclasses of NP-hard graph problems 

Computing the graph-crossing number $cr(G)$ for a simple graph is known to be NP-complete. A quick literature review shows some suggested algorithms for computing if $cr(G)&lt;k$. Are they any active implementations available?

Already checked: SAGE, CGAL_Boost, networkx, graph_tool
A slow brute-force implementation of the graph crossing number
was added to Sage in


Sage Trac ticket 24216: Add crossing number of a graph


which was closed 2018-01-05, and merged in Sage 8.2.beta3.