Crossing minimization in weighted bipartite graphs

Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler. Crossing minimization in weighted bipartite graphs. J. Discrete Algorithms, 7(4):439-452, 2009. [doi]

@article{CakirogluEKS09,
  title = {Crossing minimization in weighted bipartite graphs},
  author = {Olca A. Çakiroglu and Cesim Erten and Ömer Karatas and Melih Sözdinler},
  year = {2009},
  doi = {10.1016/j.jda.2008.08.003},
  url = {http://dx.doi.org/10.1016/j.jda.2008.08.003},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CakirogluEKS09},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {7},
  number = {4},
  pages = {439-452},
}