Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
Combinatorics, Probability and Computing
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
Combinatorics, Probability and Computing
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
Colouring Random Regular Graphs
Combinatorics, Probability and Computing
Dismantling sparse random graphs
Combinatorics, Probability and Computing
Large independent sets in random regular graphs
Theoretical Computer Science
More spectral bounds on the clique and independence numbers
Journal of Combinatorial Theory Series B
Perfect matchings as IID factors on non-amenable groups
European Journal of Combinatorics
Survey: The cook-book approach to the differential equation method
Computer Science Review
Uncover low degree vertices and minimise the mess: independent sets in random regular graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Limits of local algorithms over sparse random graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |