Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler. Crossing Minimization in Weighted Bipartite Graphs. In Camil Demetrescu, editor, Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings. Volume 4525 of Lecture Notes in Computer Science, pages 122-135, Springer, 2007. [doi]
@inproceedings{CakirogluEKS07,
title = {Crossing Minimization in Weighted Bipartite Graphs},
author = {Olca A. Çakiroglu and Cesim Erten and Ömer Karatas and Melih Sözdinler},
year = {2007},
doi = {10.1007/978-3-540-72845-0_10},
url = {http://dx.doi.org/10.1007/978-3-540-72845-0_10},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CakirogluEKS07},
cites = {0},
citedby = {0},
pages = {122-135},
booktitle = {Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings},
editor = {Camil Demetrescu},
volume = {4525},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-72844-3},
}