FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
On the generation of bicliques of a graph
Discrete Applied Mathematics
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science
Covering graphs with few complete bipartite subgraphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
Bicolored independent sets and bicliques
Information Processing Letters
An exact exponential time algorithm for counting bipartite cliques
Information Processing Letters
| Hi-index | 0.05 |