No. |
Title |
Author |
Year |
---|

1 |
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs |
Anastos, Michael et al. |
2019 |

2 |
The Cover Time of a Biased Random Walk on a Random Cubic Graph |
Cooper, Colin et al. |
2018 |

3 |
Traveling in Randomly Embedded Random Graphs |
Frieze, Alan et al. |
2017 |

4 |
Discordant Voting Processes on Finite Graphs |
Cooper, Colin et al. |
2016 |

5 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) |
Dyer, Martin et al. |
2011 |

6 |
A new approach to the planted clique problem |
Frieze, Alan et al. |
2008 |