The NP-completeness column: An ongoing guide
Journal of Algorithms
Approximating clique and biclique problems
Journal of Algorithms
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A notion of cross-perfect bipartite graphs
Information Processing Letters
A New Conceptual Clustering Framework
Machine Learning
Biclustering Algorithms for Biological Data Analysis: A Survey
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Compression, Clustering, and Pattern Discovery in Very High-Dimensional Discrete-Attribute Data Sets
IEEE Transactions on Knowledge and Data Engineering
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Compressing arrays by ordering attribute values
Information Processing Letters
Discovery and regeneration of hidden emails
Proceedings of the 2005 ACM symposium on Applied computing
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
ACM Transactions on Mathematical Software (TOMS)
Graphical Models - Special issue on PG2004
Multi-objective evolutionary biclustering of gene expression data
Pattern Recognition
The role mining problem: finding a minimal descriptive set of roles
Proceedings of the 12th ACM symposium on Access control models and technologies
On the generation of bicliques of a graph
Discrete Applied Mathematics
Finding preferred subsets of Pareto optimal solutions
Computational Optimization and Applications
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast exact and heuristic methods for role minimization problems
Proceedings of the 13th ACM symposium on Access control models and technologies
Nonnegative matrix factorization via rank-one downdate
Proceedings of the 25th international conference on Machine learning
Finding Additive Biclusters with Random Background
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Quasi-bicliques: Complexity and Binding Pairs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Expert Systems with Applications: An International Journal
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Gene interaction - An evolutionary biclustering approach
Information Fusion
Biclustering Expression Data Based on Expanding Localized Substructures
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Stability and Performances in Biclustering Algorithms
Computational Intelligence Methods for Bioinformatics and Biostatistics
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Spectrum opportunity-based control channel assignment in cognitive radio networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Using underapproximations for sparse nonnegative matrix factorization
Pattern Recognition
International Journal of Computational Intelligence in Bioinformatics and Systems Biology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Inapproximability of maximum weighted edge biclique and its applications
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The role mining problem: A formal perspective
ACM Transactions on Information and System Security (TISSEC)
Algorithms and theory of computation handbook
Finding maximum edge bicliques in convex bipartite graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Cooperative games with overlapping coalitions
Journal of Artificial Intelligence Research
Algorithms for induced biclique optimization problems
Information Processing Letters
Summarizing transactional databases with overlapped hyperrectangles
Data Mining and Knowledge Discovery
Mining biological interaction networks using weighted quasi-bicliques
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
BARTMAP: A viable structure for biclustering
Neural Networks
CIBB'10 Proceedings of the 7th international conference on Computational intelligence methods for bioinformatics and biostatistics
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Approximation algorithms for bi-clustering problems
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Visual terrain analysis of high-dimensional datasets
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Possibilistic approach to biclustering: an application to oligonucleotide microarray data analysis
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Algorithmic and complexity issues of three clustering methods in microarray data analysis
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Internet computing of tasks with dependencies using unreliable workers
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A linear time biclustering algorithm for time series gene expression data
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Bicolored independent sets and bicliques
Information Processing Letters
A note on a Maximum k-Subset Intersection problem
Information Processing Letters
Applying power graph analysis to weighted graphs
ECIR'12 Proceedings of the 34th European conference on Advances in Information Retrieval
Graph-based data clustering with overlaps
Discrete Optimization
Biclique completion problems for multicast network design
Discrete Optimization
On the inapproximability of maximum intersection problems
Information Processing Letters
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
SIAM Journal on Matrix Analysis and Applications
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
A new approach for association rule mining and bi-clustering using formal concept analysis
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
High-Performance Computing for Data Analytics
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
ACM Transactions on Algorithms (TALG)
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Proceedings of the 22nd international conference on World Wide Web
Heuristic approaches for time-lagged biclustering
Proceedings of the 12th International Workshop on Data Mining in Bioinformatics
Multi-tuple deletion propagation: approximations and complexity
Proceedings of the VLDB Endowment
A new measure for gene expression biclustering based on non-parametric correlation
Computer Methods and Programs in Biomedicine
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Discrete Applied Mathematics
A convexity upper bound for the number of maximal bicliques of a bipartite graph
Discrete Applied Mathematics
A continuous characterization of the maximum-edge biclique problem
Journal of Global Optimization
| Hi-index | 0.05 |
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.