Decycling numbers of random regular graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Permutation Pseudographs and Contiguity
Combinatorics, Probability and Computing
Hamiltonian decompositions of random bipartite regular graphs
Journal of Combinatorial Theory Series B
On packing Hamilton cycles in ε-regular graphs
Journal of Combinatorial Theory Series B
Cleaning random d-regular graphs with brushes using a degree-greedy algorithm
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Local resilience and hamiltonicity maker–breaker games in random regular graphs
Combinatorics, Probability and Computing
Packing tight Hamilton cycles in 3-uniform hypergraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Paths and cycles in breakpoint graphs of random multichromosomal genomes
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Packing tight Hamilton cycles in 3-uniform hypergraphs
Random Structures & Algorithms
Approximate Hamilton decompositions of random graphs
Random Structures & Algorithms
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hamilton decompositions of regular expanders: Applications
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |