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
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Computational aspects of the 2-dimension of partially ordered sets
Theoretical Computer Science
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Timing model reduction for hierarchical timing analysis
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
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
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.06 |