| On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs S Ben-Shimon, M Krivelevich, B Sudakov SIAM Journal on Discrete Mathematics 25 (3), 1176-1193, 2011 | 61 | 2011 |
| Local resilience and hamiltonicity maker–breaker games in random regular graphs S Ben-Shimon, M Krivelevich, B Sudakov Combinatorics, Probability and Computing 20 (2), 173-211, 2011 | 43 | 2011 |
| Hitting time results for Maker‐Breaker games S Ben‐Shimon, A Ferber, D Hefetz, M Krivelevich Random Structures & Algorithms 41 (1), 23-46, 2012 | 40 | 2012 |
| A note on regular Ramsey graphs N Alon, S Ben‐Shimon, M Krivelevich Journal of Graph Theory 64 (3), 244-249, 2010 | 23 | 2010 |
| Random regular graphs of non-constant degree: concentration of the chromatic number S Ben-Shimon, M Krivelevich Discrete Mathematics 309 (12), 4149-4161, 2009 | 12* | 2009 |
| Vertex percolation on expander graphs S Ben-Shimon, M Krivelevich European Journal of Combinatorics 30 (2), 339-350, 2009 | 10 | 2009 |
| Message passing for the coloring problem: Gallager meets Alon and Kahale S Ben-Shimon, D Vilenchik Discrete Mathematics & Theoretical Computer Science, 2007 | 1 | 2007 |
Michael KrivelevichProfessor of Mathematics, Tel Aviv University在 post.tau.ac.il 的电子邮件经过验证
