Theoretical Computer Science - Phase transitions in combinatorial problems
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Small maximal matchings in random graphs
Theoretical Computer Science - Latin American theoretical informatics
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
Combinatorics, Probability and Computing
On the $b$-Independence Number of Sparse Random Graphs
Combinatorics, Probability and Computing
Adding random edges to dense graphs
Random Structures & Algorithms
Finding Large Independent Sets in Polynomial Expected Time
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
An almost quadratic bound on vertex Folkman numbers
Journal of Combinatorial Theory Series B
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Independent sets in random graphs from the weighted second moment method
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On independent sets in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for implicit hitting set problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
A guided tour in random intersection graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Limits of local algorithms over sparse random graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Constructions of independent sets in random intersection graphs
Theoretical Computer Science
Hi-index | 0.05 |