Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
An application of splittable 4-frames to coloring of Kn,n
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
The shortest disjunctive normal form of a random Boolean function
Random Structures & Algorithms
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
On Systems of Small Sets with No Large Δ-Subsystems
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
A note on a conjecture by Füredi
Journal of Combinatorial Theory Series A
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory Series B
Minimum H-decompositions of graphs
Journal of Combinatorial Theory Series B
Triangle packings and 1-factors in oriented graphs
Journal of Combinatorial Theory Series B
The existence of k-radius sequences
Journal of Combinatorial Theory Series A
On the approximability of the L(h, k)-labelling problem on bipartite graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Minimum H-decompositions of graphs: Edge-critical case
Journal of Combinatorial Theory Series B
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
| Hi-index | 0.00 |