The maximum edge biclique problem is NP-complete

Untitled work

(1979) · Cited by 43,841

On the Shannon capacity of a graph

Lovász, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,658

The NP-completeness column: An ongoing guide

Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 799

Node-and edge-deletion NP-complete problems

Yannakakis, M. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804355 · Cited by 445

Approximating Clique and Biclique Problems

Hochbaum, D. S. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0964 · Cited by 113

The NP-completeness column: An ongoing guide

Johnson, D. S. (1987) · Journal of Algorithms · doi:10.1016/0196-6774(87)90021-6 · Cited by 75

Bicliques and Eigenvalues

Haemers, W. H. (2001) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.2000.2020 · Cited by 20

Bipartite sandwiches: bounding the size of a maximum bicliquePreprint

Ṗasechnik, D. V. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.math/9907109 · Cited by 3

Bipartite sandwiches: semide?nite relaxations for maximum biclique

Ṗasechnik, D. V. (1999) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(05)80046-0 · Cited by 2

Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches

Dai, Q., Li, R.-H., Ye, X., Liao, M., Zhang, W., & Wang, G. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589283 · Cited by 19

Policy-compliant path diversity and bisection bandwidth

Klöti, R., Kotronis, V., Ager, B., & Dimitropoulos, X. A. (2015) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2015.7218436 · Cited by 19

Finding Approximately Rank-One Submatrices with the Nuclear Norm and $\ell_1$-Norm

Doan, X. V., & Vavasis, S. A. (2013) · SIAM Journal on Optimization · doi:10.1137/100814251 · Cited by 19

Solving the maximum edge biclique packing problem on unbalanced bipartite graphs

Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.09.019 · Cited by 19

Finding preferred subsets of Pareto optimal solutions

Kao, G. K., & Jacobson, S. H. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-007-9070-8 · Cited by 19

Compact Representation of Sets of Binary Constraints

Rintanen, J. (2006) · ANU Open Research (Australian National University) · Cited by 18

ErasuCrypto: A Light-weight Secure Data Deletion Scheme for Solid State Drives

Liu, C., Khouzani, H. A., & Yang, C. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0009 · Cited by 18

On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs

Phillips, C. A., Wang, K., Baker, E. J., Bubier, J. A., Chesler, E. J., & Langston, M. A. (2019) · Algorithms · doi:10.3390/a12010023 · Cited by 18

LateBiclustering: Efficient Heuristic Algorithm for Time-Lagged Bicluster Identification

Gonçalves, J. P., & Madeira, S. C. (2014) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2014.2312007 · Cited by 18

Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably

Gao, L., & Malewicz, G. G. (2007) · Theory of Computing Systems · doi:10.1007/s00224-006-1296-9 · Cited by 18

Identifying similar-bicliques in bipartite graphs

Yao, K. L., Chang, L., & Yu, J. X. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3551793.3551854 · Cited by 17

Chromatic characterization of biclique covers

Cornaz, D., & Fonlupt, J. (2006) · Discrete Mathematics · doi:10.1016/j.disc.2006.01.010 · Cited by 17

The computational complexity of high-dimensional correlation search

Jermaine, C. (2002) · Proceedings · doi:10.1109/icdm.2001.989526 · Cited by 17

Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes

Xiang, Y., Payne, P., & Huang, K. (2011) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2011.58 · Cited by 16

Scale Reduction Techniques for Computing Maximum Induced Bicliques

Shahinpour, S., Shirvani, S., Ertem, Z., & Butenko, S. I. (2017) · Algorithms · doi:10.3390/a10040113 · Cited by 16

Clustering and the Biclique Partition Problem

Bein, D., Morales, L., Bein, W. W., Shields, C., Meng, Z., & Sudborough, I. H. (2008) · doi:10.1109/hicss.2008.504 · Cited by 16

Butterfly counting and bitruss decomposition on uncertain bipartite graphs

Zhou, A., Wang, Y., & Chen, L. (2023) · The VLDB Journal · doi:10.1007/s00778-023-00782-4 · Cited by 15

A priori assessment of data quality in molecular phylogenetics

Misof, B. Y., Meusemann, K., von Reumont, B. M., Kück, P., Prohaska, S. J., & Stadler, P. F. (2014) · Algorithms for Molecular Biology · doi:10.1186/s13015-014-0022-4 · Cited by 15

On the inapproximability of maximum intersection problems

Shieh, M.-Z., Tsai, S., & Yang, M.-C. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.06.014 · Cited by 15

Efficient Mining of Large Maximal Bicliques from 3D Symmetric Adjacency Matrix

Selvan, S., & Nataraj, R. V. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.97 · Cited by 15

Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming

Sözdinler, M., & Özturan, C. (2018) · IEEE International Conference on Computational Science and Engineering (CSE) · doi:10.1109/cse.2018.00025 · Cited by 15

Biclique-Helly Graphs

Groshaus, M., & SZWARCFITER, J. L. (2007) · Graphs and Combinatorics · doi:10.1007/s00373-007-0756-6 · Cited by 15

Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation

Ames, B. (2015) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-015-0777-x · Cited by 14

An integer linear programming approach for bilinear integer programming

Freire, A. S., Moreno, E., & Vielma, J. P. (2011) · Operations Research Letters · doi:10.1016/j.orl.2011.12.004 · Cited by 14

Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

Alonso, R., Monroy, R., & Trejo, L. A. (2016) · Sensors · doi:10.3390/s16081311 · Cited by 14

Intelligent system for the analysis of microarray data using principal components and estimation of distribution algorithms

Cano, C., García, F., López, F. J., & Blanco, A. J. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.06.030 · Cited by 14

Internet Computing of Tasks with Dependencies Using Unreliable Workers

Gao, L., & Malewicz, G. G. (2005) · Lecture notes in computer science · doi:10.1007/11516798_32 · Cited by 14

Parameterized algorithms for Edge Biclique and related problems

Feng, Q., Li, S., Zhou, Z., & Wang, J. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.09.027 · Cited by 13

Biclique: an R package for maximal biclique enumeration in bipartite graphs

Lu, Y., Phillips, C., & Langston, M. A. (2020) · BMC Research Notes · doi:10.1186/s13104-020-04955-0 · Cited by 13

Systematic exploration of autonomous modules in noisy microRNA-target networks for testing the generality of the ceRNA hypothesis

Yip, D. K.-S., Pang, I. K., & Yip, K. Y.-L. (2014) · BMC Genomics · doi:10.1186/1471-2164-15-1178 · Cited by 12

Algorithms and Applications to Weighted Rank-one Binary Matrix Factorization

Lu, H., Chen, X., Shi, J., Vaidya, J. S., Atluri, V., Hong, Y., & Huang, W. X. (2020) · ACM Transactions on Management Information Systems · doi:10.1145/3386599 · Cited by 12

Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs

Wang, J., Yang, J., Zhang, C., & Lin, X. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3220901 · Cited by 12

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs

Konagaya, M., Otachi, Y., & Uehara, R. (2015) · Discrete Applied Mathematics · doi:10.1016/j.dam.2015.01.040 · Cited by 12

Finding maximal bicliques in bipartite networks using node similarity

Alzahrani, T., & Horadam, K. J. (2019) · Applied Network Science · doi:10.1007/s41109-019-0123-6 · Cited by 12

Efficient Maximum Signed Biclique Identification

Sun, R., Chen, C., Wang, X., Zhang, W., Zhang, Y., & Lin, X. (2023) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde55515.2023.00105 · Cited by 12

On hereditary Helly classes of graphs

Groshaus, M., & SZWARCFITER, J. L. (2008) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.440 · Cited by 12

k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks

Liu, Q., Chen, Y. P., & Li, J. (2013) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2013.09.013 · Cited by 12

Two-dimensional crosstalk avoidance codes

Wu, X., Yan, Z., & Xie, Y. (2008) · SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems · doi:10.1109/sips.2008.4671746 · Cited by 12

The Quorum Deployment Problem

Gilbert, S. L., & Malewicz, G. G. (2005) · Lecture notes in computer science · doi:10.1007/11516798_23 · Cited by 12

Summarization Techniques for Pattern Collections in Data MiningPreprint

Mielikäinen, T. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0505071 · Cited by 12

Robust convex relaxation for the planted clique and densest k-subgraph problemsPreprint

Ames, B. (2013) · arXiv (Cornell University) · Cited by 12

Exact exponential-time algorithms for finding bicliques

Binkele-Raible, D., Fernau, H., Gaspers, S., & Liedloff, M. (2010) · Information Processing Letters · doi:10.1016/j.ipl.2010.10.020 · Cited by 11

Managing product variety through configuration of pre-assembled vanilla boxes using hierarchical clustering

Daie, P., & Li, S. (2016) · International Journal of Production Research · doi:10.1080/00207543.2016.1158879 · Cited by 11

Choice Network Revenue Management Based on New Tractable Approximations

Kunnumkal, S., & Talluri, K. T. (2019) · Transportation Science · doi:10.1287/trsc.2018.0867 · Cited by 11

Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs

Zhao, Y., Chen, Z., Chen, C., Wang, X., Lin, X., & Zhang, W. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3206351 · Cited by 11

Stability and Performances in Biclustering Algorithms

Filippone, M., Masulli, F., & Stefano Rovetta, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02504-4_8 · Cited by 11

Computing Cross Associations for Attack Graphs and Other Applications

Heydari, M. H., Morales, L., Shields, C., & Sudborough, I. H. (2007) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2007.141 · Cited by 11

Editing Simple Graphs

Damaschke, P., & Mogren, O. (2014) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00337 · Cited by 10

Maximum Weighted Edge Biclique Problem on Bipartite Graphs

Pandey, A., Sharma, G., & Jain, N. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-39219-2_10 · Cited by 10

A convexity upper bound for the number of maximal bicliques of a bipartite graph

Albano, A., & do Lago, A. P. (2013) · Discrete Applied Mathematics · doi:10.1016/j.dam.2013.01.014 · Cited by 10

Computational Systems Biology

Murali, T., & Aluru, S. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c32 · Cited by 10

ORFEL: Efficient detection of defamation or illegitimate promotion in online recommendation

Gimenes, G. P., Cordeiro, R. L. F., & Junior, J. F. R. (2016) · Information Sciences · doi:10.1016/j.ins.2016.09.006 · Cited by 10

Mixed Integer Programming for Searching Maximum Quasi-Bicliques

Ignatov, D. I., Ivanova, P., & Zamaletdinova, A. (2020) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-37157-9_2 · Cited by 10

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

Nussbaum, D., Pu, S., Sack, J.-R., Uno, T., & Zarrabi-Zadeh, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14031-0_17 · Cited by 10

PARALLEL MINING OF LARGE MAXIMAL BICLIQUES USING ORDER PRESERVING GENERATORS

Nataraj, R. V., & Selvan, S. (2014) · International Journal of Computing · doi:10.47839/ijc.8.3.691 · Cited by 10

Discovery and regeneration of hidden emails

Carenini, G., Ng, R. T., Zhou, X., & Zwart, E. (2005) · ACM Symposium on Applied Computing · doi:10.1145/1066677.1066792 · Cited by 10

A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem

Casado, A., Pérez‐Peló, S., Sánchez‐Oro, J., & Duarte, A. (2022) · Journal of Heuristics · doi:10.1007/s10732-022-09490-8 · Cited by 9

Water Consumption Pattern Analysis Using Biclustering: When, Why and How

Silva, M. G., Madeira, S. C., & Henriques, R. (2022) · Water · doi:10.3390/w14121954 · Cited by 11

Towards a parameter-free and parallel itemset mining algorithm in linearithmic time

Buehrer, G., de Oliveira, R. L., Fuhry, D., & Parthasarathy, S. (2015) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2015.7113357 · Cited by 9

Specification Mining: New Formalisms, Algorithms and Applications

Li, W. (2013) · Cited by 9

Bi-objective optimization of biclustering with binary data

Hanafi, S., Palubeckis, G., & Glover, F. (2020) · Information Sciences · doi:10.1016/j.ins.2020.05.078 · Cited by 9

Graph-Based Data Clustering with Overlaps

Fellows, M. R., Guo, J., Komusiewicz, C., Niedermeier, R., & Uhlmann, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02882-3_51 · Cited by 9

Biclustering Expression Data Based on Expanding Localized Substructures

Erten, C., & Sözdinler, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00727-9_22 · Cited by 9

Graph Based Induction of unresponsive routers in Internet topologies

Kardes, H., Güneş, M. H., & Saraç, K. (2015) · Computer Networks · doi:10.1016/j.comnet.2015.02.012 · Cited by 9

Enumerating Maximal Bicliques from a Large Graph Using MapReduce

Mukherjee, A. P., & Tirthapura, S. (2014) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdata.congress.2014.105 · Cited by 9

Mining Maximal Induced Bicliques using Odd Cycle Transversals

Kloster, K., Sullivan, B. D., & van der Poel, A. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975673.37 · Cited by 9

Coherent network partitions

Angeleska, A., & Nikoloski, Z. (2019) · Discrete Applied Mathematics · doi:10.1016/j.dam.2019.02.048 · Cited by 8

On Biclique Connectivity in Bipartite Graphs and Recommendation Systems

Maier, C., & Simovici, D. A. (2021) · International Conference on Information System and Data Mining (ICISDM) · doi:10.1145/3471287.3471302 · Cited by 8

Sparse Coding for Specification Mining and Error Localization

Li, W., & Seshia, S. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35632-2_9 · Cited by 8

Efficient multicast on a terabit router

Bhargava, P., Krishnan, S., & Panigrahy‎, R. (2005) · IEEE Symposium on High-Performance Interconnects (HOTI) · doi:10.1109/conect.2004.1375203 · Cited by 8

Complexity of modification problems for reciprocal best match graphs

Hellmuth, M., Geiß, M., & Stadler, P. F. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2019.12.033 · Cited by 11

Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis

Tan, J., Chua, K. S., Zhang, L., & Zhu, S. (2007) · Algorithmica · doi:10.1007/s00453-007-0040-4 · Cited by 8

Efficient Index for Temporal Core Queries over Bipartite Graphs

Tian, A., Zhou, A., Wang, Y., Jian, X., & Chen, L. (2024) · Proceedings of the VLDB Endowment · doi:10.14778/3681954.3681965 · Cited by 7

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Koana, T., Komusiewicz, C., & Sommer, F. O. (2023) · Algorithmica · doi:10.1007/s00453-022-01090-z · Cited by 7

Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support

Le, Q.-T., Riccietti, E., & Gribonval, R. (2023) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/22m1496657 · Cited by 7

Algorithms for induced biclique optimization problems

Gavril, F. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.02.005 · Cited by 7

A loop-counting method for covariate-corrected low-rank biclustering of gene-expression and genome-wide association study data

Rangan, A. V., McGrouther, C. C., Kelsoe, J. R., Schork, N. J., Stahl, E. A., Zhu, Q., Krishnan, A., Yao, V., Troyanskaya, O. G., Bilaloglu, S., et al. (2018) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1006105 · Cited by 7

Binary Matrix Factorisation via Column Generation

Kovács, R. Á., Günlük, O., & Hauser, R. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16500 · Cited by 7

Editing the Simplest Graphs

Damaschke, P., & Mogren, O. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-04657-0_24 · Cited by 7

Machine Learning, ESG Indicators, and Sustainable Investment

Lanza, A., Bernardini, E., & Faiella, I. (2023) · Contributions to finance and accounting · doi:10.1007/978-3-031-33882-3_10 · Cited by 6

A Novel Enumeration Strategy of Maximal Bicliques from 3-Dimensional Symmetric Adjacency Matrix

Savio, M. R. D., Sankar, A., & Vijayarajan, N. R. (2014) · Cited by 6

FPGN: follower prediction framework for infectious disease prevention

Yu, J., Zhang, X., Wang, H., Wang, X., Zhang, W., & Zhang, Y. (2023) · World Wide Web · doi:10.1007/s11280-023-01205-8 · Cited by 6

A simple filter for detecting low-rank submatrices

Rangan, A. V. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.12.032 · Cited by 6

High Functional Coherence in k-Partite Protein Cliques of Protein Interaction Networks

Liu, Q., Chen, Y. P., & Li, J. (2009) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2009.46 · Cited by 6

Structural Graph Indexing for Mining Complex Networks

Kardes, H., & Güneş, M. H. (2010) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2010.42 · Cited by 6

Multipartite Graph Algorithms for the Analysis of Heterogeneous Data

Phillips, C. (2015) · Cited by 6

A Constant-Factor Approximation Algorithm for Co-clustering

Anagnostopoulos, A., Dasgupta, A., & Kumar, R. (2012) · Theory of Computing · doi:10.4086/toc.2012.v008a026 · Cited by 6

Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Chen, H., & Liu, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59605-1_5 · Cited by 6

A new compact linear programming formulation for choice network revenue managementPreprint

Kunnumkal, S., & Talluri, K. T. (2012) · RePEc: Research Papers in Economics · Cited by 6

Coherent network partitions: Characterizations with cographs and prime graphs

Angeleska, A., Omranian, S., & Nikoloski, Z. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.10.002 · Cited by 5

Binary Matrix Factorization and Consensus Algorithms

Fu, Y., Jiang, N., & Sun, H. (2010) · International Conference on Electrical and Control Engineering · doi:10.1109/icece.2010.1455 · Cited by 5

Reducing rank of the adjacency matrix by graph modification

Meesum, S. M., Misra, P., & Saurabh, S. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.02.020 · Cited by 5

Detection of network scan attacks using flow data

Kinable, J. (2008) · Cited by 5

CSS Minification via Constraint Solving

Hague, M., Lin, A. W., & Hong, C.-D. (2019) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3310337 · Cited by 5

Analysis of biclusters with applications to gene expression data

Park, G., & Wojciech Szpankowski, A. (2005) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3385 · Cited by 5

Management and analysis of DNA microarray data by using weighted trees

Tran, T., Nguyen, C. C., & Hoang, N. M. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9158-9 · Cited by 5

An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background

Xiao, J., Wang, L., Liu, X., & Jiang, T. (2008) · Journal of Computational Biology · doi:10.1089/cmb.2007.0219 · Cited by 5

Vertex–transformation streams

Kim, Y., Lee, C. H., & Varshney, A. (2006) · Graphical Models · doi:10.1016/j.gmod.2006.03.005 · Cited by 5

Visual Terrain Analysis of High-Dimensional Datasets

Li, W., Ong, K., & Ng, W. K. (2005) · Lecture notes in computer science · doi:10.1007/11564126_62 · Cited by 5

Efficient maximum signed biclique and biplex identification in signed bipartite graphs

Sun, R., Chen, C., Wang, X., Wu, Y., Zhang, W., Zhang, Y., & Lin, X. (2025) · The VLDB Journal · doi:10.1007/s00778-025-00939-3 · Cited by 4

Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming

Sözdinler, M., & Özturan, C. (2018) · IEEE International Conference on Computational Science and Engineering (CSE) · doi:10.1109/cse.2018.00025 · Cited by 15

Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Chen, H., & Liu, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59605-1_5 · Cited by 6

On bipartite and multipartite . . .

Dawande, M., Keskinocak, P., Swaminathan, J. M., & Tayur, S. (2000)

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

NussbaumDoron, PuShuye, SackJörg-Rüdiger, UnoTakeaki, & Zarrabi-ZadehHamid (2012) · Algorithmica · doi:10.5555/3118237.3118545 · Cited by 1

Maximizing edge-ratio is NP-complete

Noble, S. D., Hansen, P., & Mladenović, N. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.07.016 · Cited by 2