Computing a minimum biclique cover is polynomial for bipartite domino-free graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
On the generation of bicliques of a graph
Discrete Applied Mathematics
Finding maximum edge bicliques in convex bipartite graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
| Hi-index | 0.89 |