Covering and coloring polygon-circle graphs
Discrete Mathematics
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Maximum weight independent sets and cliques in intersection graphs of filaments
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
A lock-and-key model for protein--protein interactions
Bioinformatics
Subtree filament graphs are subtree overlap graphs
Information Processing Letters
Discrete Applied Mathematics
Bisimplicial vertices in even-hole-free graphs
Journal of Combinatorial Theory Series B
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Towards a formal concept analysis approach to exploring communities on the world wide web
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.89 |
We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of interval-filament graphs and complements of subtree-filament graphs. Such problems are to find maximum: induced bicliques, induced balanced bicliques and induced edge bicliques. These problems have applications for biclique clustering of proteins by PPI criteria, of documents, and of web pages.