Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Colouring graphs when the number of colours is nearly the maximum degree
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Turán's theorem in sparse random graphs
Random Structures & Algorithms
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Combinatorics, Probability and Computing
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Combinatorics, Probability and Computing
Divide and conquer martingales and the number of triangles in a random graph
Random Structures & Algorithms
Random Structures & Algorithms
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions
Journal of Combinatorial Theory Series B
List Set Colouring: Bounds and Algorithms
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Note: Tight embeddings of partial quadrilateral packings
Journal of Combinatorial Theory Series A
On two generalizations of the Alon-Tarsi polynomial method
Journal of Combinatorial Theory Series B
Fractional decompositions of dense hypergraphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Journal of Combinatorial Theory Series B
Beautiful conjectures in graph theory
European Journal of Combinatorics
Hi-index | 0.00 |