| Publication date | Communities | Collections | Article title | Author(s) | Journal/Conference |
|---|---|---|---|---|---|
| 5 May 2016 | SERC | Institute for Infocomm Research | On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach | Eran Shaham, Honghai Yu, Xiao-Li Li | SIAM International Conference on Data Mining |