Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Hi-index | 0.00 |