{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:42Z","timestamp":1725583962385},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215148"},{"type":"electronic","value":"9783642215155"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21515-5_63","type":"book-chapter","created":{"date-parts":[[2011,5,30]],"date-time":"2011-05-30T15:33:45Z","timestamp":1306769625000},"page":"530-538","source":"Crossref","is-referenced-by-count":3,"title":["A Solution to Bipartite Drawing Problem Using Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Salabat","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Mohsin","family":"Bilal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Muhammad","family":"Sharif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Farrukh Aslam","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"issue":"3&4","key":"63_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207169408804322","volume":"53","author":"E. M\u00e4kinen","year":"1994","unstructured":"M\u00e4kinen, E., Sieranta, M.: Genetic Algorithms for Drawing Bipartite Graphs. International Journal of Computer Mathematics\u00a053(3&4), 157\u2013166 (1994)","journal-title":"International Journal of Computer Mathematics"},{"key":"63_CR2","doi-asserted-by":"crossref","unstructured":"Bienstock, D.: Some provably hard crossing number problems. In: Proc. 8th Annual ACM Symposium on Computational Geometry, pp. 253\u2013260 (1990)","DOI":"10.1145\/98524.98581"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"63_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"W.T. Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a Theory of Crossing Numbers. J. Comb. Theory\u00a08(1), 45\u201353 (1970)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"63_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00088","volume":"8","author":"W. Barth","year":"2004","unstructured":"Barth, W., Mutzel, P., Junger, M.: Simple and Efficient Bilayer Cross Counting. Journal of Graph Algorithms and Applications (JGAA)\u00a08(2), 179\u2013194 (2004)","journal-title":"Journal of Graph Algorithms and Applications (JGAA)"},{"key":"63_CR6","unstructured":"Whitley D.: A Genetic Algorithm Tutorial, http:\/\/www.cs.uga.edu\/~potter\/CompIntell\/ga_tutorial.pdf"},{"key":"63_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470512517","volume-title":"Computational Intelligence: An Introduction","author":"A.P. Engelbrecht","year":"2007","unstructured":"Engelbrecht, A.P.: Computational Intelligence: An Introduction. J. Wiley & Sons, Chichester (2007)"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1111\/j.1749-6632.1970.tb56499.x","volume":"175","author":"M.E. Watkins","year":"1970","unstructured":"Watkins, M.E.: A special crossing number for bipartite graphs: a research problem. Ann. New York Acad. Sci.\u00a0175, 405\u2013410 (1970)","journal-title":"Ann. New York Acad. Sci."},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G.D. Battista","year":"1994","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.: Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications\u00a04, 235\u2013282 (1994)","journal-title":"Comp. Geometry: Theory and Applications"},{"key":"63_CR10","first-page":"377","volume":"26","author":"M. Koebe","year":"1990","unstructured":"Koebe, M., Kn\u00f6chel, J.: On the block alignment problem. J. Inf. Process. Cybern. EIK\u00a026, 377\u2013387 (1990)","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern.\u00a0SMC-11, 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"63_CR12","unstructured":"Abdullah, A.: \u201cData Mining Using the Crossing Minimization Paradigm,\u201d \u2013Ph.D. Thesis, University of Stirling (2007)"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/21.364865","volume":"21","author":"T. Catarci","year":"1995","unstructured":"Catarci, T.: The Assignment Heuristic for Crossing Reduction. IEEE Transactions on Systems, Man and Cybernetics\u00a021, 515\u2013521 (1995)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"63_CR14","doi-asserted-by":"crossref","unstructured":"Camel, D., Irene, F.: Breaking Cycles for Minimizing Crossings. Journal of Experimental Algorithmics (JEA)\u00a06 (2001)","DOI":"10.1145\/945394.945396"},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"Stallmann, M., Brglez, F., Ghosh, D.: Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. J. Exp. Algorithmics 6 (2001)","DOI":"10.1145\/945394.945402"},{"key":"63_CR16","unstructured":"Zheng, L., Song, L., Eades, P.: Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. In: ACM Asia-Pacific Symposium on Information Visualization, vol.\u00a0109, pp. 33\u201337 (2005)"},{"issue":"9","key":"63_CR17","doi-asserted-by":"publisher","first-page":"717","DOI":"10.3844\/jcssp.2007.717.722","volume":"3","author":"Z. Ezziane","year":"2007","unstructured":"Ezziane, Z.: Experimental Comparison between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing Problem. J. Computer Science\u00a03(9), 717\u2013722 (2007)","journal-title":"J. Computer Science"},{"issue":"12","key":"63_CR18","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/S0305-0548(96)00083-4","volume":"24","author":"M. Laguna","year":"1997","unstructured":"Laguna, M., Marti, R., Vails, V.: Arc Crossing Minimization in Hierarchical Digraphs with Tabu Search. Computers and Op. Research\u00a024(12), 1175\u20131186 (1997)","journal-title":"Computers and Op. Research"},{"key":"63_CR19","first-page":"913","volume":"33","author":"R. Mart\u00ed","year":"2004","unstructured":"Mart\u00ed, R.: Arc Crossing Minimization in Graphs with GRASP. IIE Transactions\u00a033, 913\u2013919 (2004)","journal-title":"IIE Transactions"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21515-5_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:09:44Z","timestamp":1560244184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21515-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215148","9783642215155"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21515-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}