1. Argyriou, E., Bekos, M.A., Kaufmann, M., Symvonis, A.: On metro-line crossing minimization. J. Graph Algorithms Appl. 14(1), 75–96 (2010). https://doi.org/10.7155/jgaa.00199
2. Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: Proceedings 14th Computing Australasian Theory Symposium (CATS 2008), vol. 77, pp. 49–56. CRPIT (2008). https://crpit.scem.westernsydney.edu.au/confpapers/CRPITV77Asquith.pdf
3. Bast, H., Brosi, P., Storandt., S.: Efficient generation of geographically accurate transit maps. In: Proceedings 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL 2018), pp. 13–22 (2018). https://doi.org/10.1145/3274895.3274955
4. Bläsius, T., Fink, S.D., Rutter, I.: Synchronized planarity with applications to constrained planarity problems. arXiv (2020). https://arxiv.org/abs/2007.15362
5. Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs. J. Discrete Algorithms 14, 248–261 (2012). https://doi.org/10.1016/j.jda.2011.12.009