1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.:
$O(\sqrt{\log n})$
approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: STOC 2005, pp. 573–581. ACM, New York (2005)
2. Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: On metro-line crossing minimization. Journal of Graph Algorithms and Applications 14(1), 75–96 (2010)
3. Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: Harland, J., Manyem, P. (eds.) CATS 2008. CRPIT, vol. 77, pp. 49–56. Australian Computer Society (2008)
4. Lecture Notes in Computer Science;M.A. Bekos,2008
5. Lecture Notes in Computer Science;M. Benkert,2007