| Crossing minimization in weighted bipartite graphs OA Çakıroḡlu, C Erten, Ö Karataş, M Sözdinler Journal of Discrete Algorithms 7 (4), 439-452, 2009 | 19 | 2009 |
| Improving performances of suboptimal greedy iterative biclustering heuristics via localization C Erten, M Sözdinler Bioinformatics 26 (20), 2594-2600, 2010 | 11 | 2010 |
| Biclustering expression data based on expanding localized substructures C Erten, M Sözdinler International Conference on Bioinformatics and Computational Biology, 224-235, 2009 | 8 | 2009 |
| A robust biclustering method based on crossing minimization in bipartite graphs C Erten, M Sözdinler International Symposium on Graph Drawing, 439-440, 2008 | 4 | 2008 |
| Reliability-Oriented bioinformatic networks visualization AE Aladağ, C Erten, M Sözdinler Bioinformatics 27 (11), 1583-1584, 2011 | 3 | 2011 |
| Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming M Sözdinler, C Özturan 2018 IEEE International Conference on Computational Science and Engineering …, 2018 | 1 | 2018 |
| An integrated model for visualizing biclusters from gene expression data and PPI networks AE Aladağ, C Erten, M Sözdinler Proceedings of the International Symposium on Biocomputing, 1-8, 2010 | 1 | 2010 |
| Weighted bipartite crossing minimization applications on biclustering and graph unions M Sözdinler Işık Üniversitesi, 2009 | | 2009 |
