P. K. Agarwal, N. Alon, B. Aronov, and S. Suri, Can visibility graphs be represented compactly? Discrete & Computational Geometry, pp.347-365, 1994.
DOI : 10.1007/bf02574385
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5626

S. E. Ahnert, Generalised power graph compression reveals dominant relationship patterns in complex networks Scientific reports, 2014.
DOI : 10.1038/srep04385
URL : http://doi.org/10.1038/srep04385

G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. L. Hammer et al., Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics, vol.145, issue.1, pp.11-21, 2004.
DOI : 10.1016/j.dam.2003.09.004

J. Amilhastre, M. Vilarem, and P. Janssen, Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs, Discrete Applied Mathematics, vol.86, issue.2-3, pp.2-3125, 1998.
DOI : 10.1016/S0166-218X(98)00039-0

D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu et al., Topological structure analysis of the protein-protein interaction network in budding yeast, Nucleic Acids Research, vol.31, issue.9, pp.312443-2450, 2003.
DOI : 10.1093/nar/gkg340

M. Chein, Algorithme de recherche des sous-matrices premiÈres d'une matrice, Bulletin mathématique de la Société des Sciences Mathématiques de la République Socialiste de Roumanie, pp.21-25, 1969.

F. Chung, On the coverings of graphs, Discrete Mathematics, vol.30, issue.2, pp.89-93, 1980.
DOI : 10.1016/0012-365X(80)90109-0

S. Daminelli, V. J. Haupt, M. Reimann, and M. Schroeder, Drug repositioning through incomplete bi-cliques in an integrated drug???target???disease network, Integrative Biology, vol.25, issue.Suppl 4, pp.778-788, 2012.
DOI : 10.1093/bioinformatics/btp220

T. Dwyer, N. Henry-riche, K. Marriott, and C. Mears, Edge Compression Techniques for Visualization of Dense Directed Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.19, issue.12, pp.2596-2605, 2013.
DOI : 10.1109/TVCG.2013.151

T. Dwyer, C. Mears, K. Morgan, T. Niven, K. Marriott et al., Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs, 2014 IEEE Pacific Visualization Symposium, 1311.
DOI : 10.1109/PacificVis.2014.46

D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Information Processing Letters, vol.51, issue.4, pp.207-211, 1994.
DOI : 10.1016/0020-0190(94)90121-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8474

J. Gagneur, R. Krause, T. Bouwmeester, and G. Casari, Modular decomposition of protein-protein interaction networks, Genome Biology, vol.5, issue.8, p.57, 2004.
DOI : 10.1186/gb-2004-5-8-r57

M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub et al., Potassco: The Potsdam answer set solving collection, pp.107-124, 2011.
DOI : 10.1007/978-3-642-02846-5_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.1611

M. Gelfond and V. Lifschitz, Logic programs with classical negation, Proc. of the 7th International Conf. on Logic Programming (ICLP), pp.579-97, 1990.

P. Hitzler and M. Krötzsch, Querying Formal Contexts with Answer Set Programs, Proc. of the 14th Int. Conf. on Conceptual Structures: Inspiration and Application, ICCS'06, pp.260-273, 2006.
DOI : 10.1007/11787181_19
URL : http://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1037&context=cse

S. Jukna and A. Kulikov, On covering graphs by complete bipartite subgraphs, Discrete Mathematics, vol.309, issue.10, pp.3399-3403, 2009.
DOI : 10.1016/j.disc.2008.09.036
URL : http://doi.org/10.1016/j.disc.2008.09.036

A. D. King, N. Pr?ulj, and I. Jurisica, Protein complex prediction via cost-based clustering, Bioinformatics, vol.20, issue.17, pp.3013-3020, 2004.
DOI : 10.1093/bioinformatics/bth351

G. Launay, R. Salza, D. Multedo, N. Thierry-mieg, and S. Ricard-blum, MatrixDB, the extracellular matrix interaction database: updated content, a new navigator and expanded functionalities, Nucleic Acids Research, vol.43, issue.D1, pp.321-327, 2015.
DOI : 10.1093/nar/gku1091

V. Lifschitz, What is answer set programming?, Proc. of the 23rd National Conf. on Artificial Intelligence AAAI'08, pp.1594-97, 2008.

S. Navlakha, M. C. Schatz, and C. Kingsford, Revealing Biological Modules via Graph Summarization, Journal of Computational Biology, vol.16, issue.2, pp.253-264, 2009.
DOI : 10.1089/cmb.2008.11TT
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1918

H. Ogata, W. Fujibuchi, S. Goto, and M. Kanehisa, A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters, Nucleic Acids Research, vol.28, issue.20, pp.4021-4028, 2000.
DOI : 10.1093/nar/28.20.4021
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC110779/pdf

L. Royer, M. Reimann, B. Andreopoulos, and M. Schroeder, Unraveling Protein Networks with Power Graph Analysis, PLoS Computational Biology, vol.34, issue.7, p.1000108, 2008.
DOI : 10.1371/journal.pcbi.1000108.t004
URL : http://doi.org/10.1371/journal.pcbi.1000108

S. Rudolph, C. S?c?rea, and D. Troanc?, Membership constraints in formal concept analysis, Proc.of the 24th Int. Conf. on Artificial Intelligence, IJCAI'15, pp.3186-3192, 2015.

P. Shannon, A. Markiel, O. Ozier, N. S. Baliga, J. T. Wang et al., Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction Networks, Genome Research, vol.13, issue.11, pp.2498-2504, 2003.
DOI : 10.1101/gr.1239303

G. Tsatsaronis, M. Reimann, I. Varlamis, O. Gkorgkas, and K. Nørvåg, Efficient community detection using power graph analysis, Proceedings of the 9th workshop on Large-scale and distributed informational retrieval, LSDS-IR '11, pp.21-26, 2011.
DOI : 10.1145/2064730.2064738

V. Wucher, Modeling of a gene network between mRNAs and miRNAs to predict gene functions involved in phenotypic plasticity in the pea aphid. Thesis, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01135870