A framework for solving VLSI graph layout problems, Journal of Computer and System Sciences, vol.28, issue.2, pp.300-343, 1984. ,
DOI : 10.1016/0022-0000(84)90071-0
On the Bisection Width and Expansion of Butterfly Networks, Theory of Computing Systems, pp.494-518, 2001. ,
Topological Properties of Some Interconnection Network Graphs, Congr. Numer, vol.121, pp.19-32, 1996. ,
Crossing Number is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.4, issue.3, pp.312-316, 1983. ,
DOI : 10.1137/0604033
Complexity Issues in VLSI, 1983. ,
An efficient representation of Benes networks and its applications, Journal of Discrete Algorithms, vol.6, issue.1, pp.11-19, 2008. ,
DOI : 10.1016/j.jda.2006.08.003
Applications of the Crossing Number, Algorithmica, pp.111-117, 1996. ,
An experimental study of the basis for graph drawing algorithms, Journal of Experimental Algorithmics, vol.2, issue.4, 1997. ,
DOI : 10.1145/264216.264222
On the Crossing Number of Butterfly Networks, Proceedings of the International Conference on Mathematics and Computer Science, pp.587-580, 2010. ,
Crossing Numbers and Hard Erd??s Problems in Discrete Geometry, Combinatorics, Probability and Computing, vol.6, issue.3, pp.353-358, 1997. ,
DOI : 10.1017/S0963548397002976
A Successful Concept for Measuring Nonplanarity of Graphs: the Crossing Number, Discrete Math, pp.331-352, 2004. ,