S. C. Madeira and A. L. Oliveira, Biclustering algorithms for biological data analysis: a survey, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.1, issue.1, pp.24-45, 2004.
DOI : 10.1109/TCBB.2004.2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.1289

A. Anagnostopoulos, A. Dasgupta, and R. Kumar, A Constant-Factor Approximation Algorithm for Co-clustering. Theory Comput, pp.597-622, 2012.

A. Banerjee, I. S. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha, A generalized maximum entropy approach to bregman co-clustering and matrix approximation, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.1919-1986, 2007.
DOI : 10.1145/1014052.1014111
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2064

A. Tanay, R. Sharan, and R. Shamir, Biclustering Algorithms, Handbook of Computational Molecular Biology, 2005.
DOI : 10.1201/9781420036275.ch26

S. H. Nguyen and A. Skowron, Quantization Of Real Value Attributes-Rough Set and Boolean Reasoning Approach, Proceedings of the Second Joint Annual Conference on Information Sciences, pp.34-37, 1995.

B. S. Chlebus and S. H. Nguyen, On Finding Optimal Discretizations for Two Attributes, Proceedings of the First International Conference on Rough Sets and Current Trends in Computing (RSCTC'98), pp.22-26, 1998.
DOI : 10.1007/3-540-69115-4_74
URL : http://alfa.mimuw.edu.pl/logic/prace/1998/E4/hoa_chlebus_RSCTC98.ps

H. S. Nguyen, Approximate Boolean Reasoning: Foundations and Applications in Data Mining, In Transactions on Rough Sets, pp.334-506, 2006.
DOI : 10.1007/11847465_16

S. Jegelka, S. Sra, and A. Banerjee, Approximation Algorithms for Tensor Clustering, Proceedings of the 20th International Conference of Algorithmic Learning Theory (ALT'09), pp.3-5, 2009.
DOI : 10.1109/TCBB.2007.70268
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.8645

J. A. Hartigan, Direct Clustering of a Data Matrix, Journal of the American Statistical Association, vol.27, issue.2, pp.123-129, 1972.
DOI : 10.1080/01621459.1963.10500845

A. Califano, G. Stolovitzky, and Y. Tu, Analysis of Gene Expression Microarrays for Phenotype Classification, Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB'00), AAAI, pp.16-23, 2000.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity Invitation to Fixed-Parameter Algorithms, p.15, 2006.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness

R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Information Processing Letters, vol.12, issue.3, pp.133-137, 1981.
DOI : 10.1016/0020-0190(81)90111-3

C. H. Lampert, H. Nickisch, and S. Harmeling, Attribute-Based Classification for Zero-Shot Visual Object Categorization, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.36, issue.3, pp.453-465, 2013.
DOI : 10.1109/TPAMI.2013.140

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4