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
Talagrand's Inequality and Locality in Distributed Computing
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Combinatorics, Probability and Computing
Bounds for visual cryptography schemes
Discrete Applied Mathematics
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Distance edge-colourings and matchings
Discrete Applied Mathematics
Distance coloring and distance edge-coloring of d- dimensional lattice
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
| Hi-index | 0.00 |