Here, you can find the benchmark sets used in the studies

• M. Chimani, C. Gutwenger. Algorithms for the Hypergraph and the Minor Crossing Number Problems. 18th Annual International Symposium on Algorithms and Computation 2007, Sendai (ISAAC07), LNCS 4835, pp. 184-195, Springer, 2007.

as well as in the full, extended version of this paper (submitted):

• Benchmark instances: benchmarks_mmcr.zip