Melih Sözdinler, Can Özturan. Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming. In Florin Pop, Catalin Negru, Horacio González-Vélez, Jacek Rak, editors, 2018 IEEE International Conference on Computational Science and Engineering, CSE 2018, Bucharest, Romania, October 29-31, 2018. pages 132-137, IEEE Computer Society, 2018. [doi]
@inproceedings{SozdinlerO18,
title = {Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming},
author = {Melih Sözdinler and Can Özturan},
year = {2018},
doi = {10.1109/CSE.2018.00025},
url = {https://doi.org/10.1109/CSE.2018.00025},
researchr = {https://researchr.org/publication/SozdinlerO18},
cites = {0},
citedby = {0},
pages = {132-137},
booktitle = {2018 IEEE International Conference on Computational Science and Engineering, CSE 2018, Bucharest, Romania, October 29-31, 2018},
editor = {Florin Pop and Catalin Negru and Horacio González-Vélez and Jacek Rak},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-7649-3},
}