Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Combinatorics, Probability and Computing
Conflict-free coloring for rectangle ranges using O(n.382) colors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms (TALG)
The final size of the c4-free process
Combinatorics, Probability and Computing
Proceedings of the twenty-eighth annual symposium on Computational geometry
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
The chromatic number of random Cayley graphs
European Journal of Combinatorics
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |