1. Ailon, N., Avigdor-Elgrabli, N., Liberty, E., & van Zuylen, A. (2012). Improved approximation algorithms for bipartite correlation clustering. SIAM Journal on Computing, 41(5), 1110–1121.
2. Amit, N. (2004). The bicluster graph editing problem. Master’s thesis, Tel Aviv University, Tel Aviv-Yafo.
3. Bansal, N., Blum, A., & Chawla, S. (2004). Correlation clustering. Machine Learning, 56, 89–113.
4. Barrett, T., Wilhite, S. E., Ledoux, P., Evangelista, C., Kim, I. F., Tomashevsky, M., et al. (2013). NCBI GEO: Archive for functional genomics data sets—update. Nucleic Acids Research, 41(Database–Issue), 991–995.
5. Bastos, L. O. (2012). New algorithms and theoretical results for the graph partitioning problem via edge editions (in Portuguese). Ph.D. thesis, Fluminense Federal University, Brazil.