1. Bezrukov, S.L.,: Edge Isoperimetric Problems on Graphs. In: Lovàsz, L., Gyarfàs, A., Katona, G.O.H., Recski, A., Székely, L. (eds.): Graph Theory and Combinatorial Biology. Bolyai Soc. Mathematical Studies 7. Akadémia Kiadó, Budapest (1999) 157–197
2. Bezrukov, S., Chavez, J.D., Harper, L.H., Röttger, M., Schroeder, U.-P.: The Congestion of n-Cube Layout on a Rectangular Grid. Discrete Mathematics 213 (2000) 13–19
3. Cimikowski, R.: Algorithms for the Fixed Linear Crossing Number Problem. Submitted to Discrete Applied Mathematics
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall (1999)
5. Even, G., Guha, S., Schieber, B.: Improved Approximations of Crossings in Graph Drawing and VLSILa yout Area. In: 32th Annual Symposium on Theory of Computing. ACM Press (2000) 296–305