1. W. Barth, M. Jünger, P. Mutzel, Simple and efficient bilayer cross counting, in: Proceedings of the 10th International Symposium on Graph Drawing (GD'02), vol. 2528, Lecture Notes in Computer Sciences, Springer, 2002, pp. 331–360.
2. U. Brandes, B. Köpf, Fast and simple horizontal coordinate assignment, in: Proceedings of the 9th International Symposium on Graph Drawing (GD'01), vol. 2265, Lecture Notes in Computer Sciences, Springer, 2002, pp. 33–36. http://dx.doi.org/10.1007/3-540-45848-4.
3. M. Broy, Challenges in automotive software engineering, in: Proceedings of the 28th International Conference on Software Engineering (ICSE'06), pp. 33–42.
4. A fast and effective heuristic for the feedback arc set problem;Eades;Inf. Process. Lett.,1993
5. M. Eiglsperger, M. Siebenhaller, M. Kaufmann, An efficient implementation of Sugiyama's algorithm for layered graph drawing, in: J. Pach (Ed.), 12th International Symposium on Graph Drawing (GD'04), vol. 3383, Lecture Notes in Computer Sciences, Springer-Verlag, 2004, pp. 155–166.