| Positional games D Hefetz, M Krivelevich, M Stojaković, T Szabó Birkhäuser, 2014 | 167 | 2014 |
| Anti‐magic graphs via the combinatorial nullstellensatz D Hefetz Journal of Graph Theory 50 (4), 263-272, 2005 | 81 | 2005 |
| Fast winning strategies in Maker–Breaker games D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series B 99 (1), 39-47, 2009 | 79 | 2009 |
| Hamilton cycles in highly connected and expanding graphs D Hefetz, M Krivelevich, T Szabó Combinatorica 29 (5), 547-568, 2009 | 57 | 2009 |
| Avoider–enforcer games D Hefetz, M Krivelevich, T Szabó Journal of Combinatorial Theory, Series A 114 (5), 840-853, 2007 | 56 | 2007 |
| On antimagic directed graphs D Hefetz, T Mütze, J Schwartz Journal of Graph Theory 64 (3), 219-232, 2010 | 50 | 2010 |
| Planarity, colorability, and minor games D Hefetz, M Krivelevich, M Stojaković, T Szabó SIAM Journal on Discrete Mathematics 22 (1), 194-212, 2008 | 49 | 2008 |
| A hypergraph Turán theorem via Lagrangians of intersecting families D Hefetz, P Keevash Journal of Combinatorial Theory, Series A 120 (8), 2020-2038, 2013 | 47 | 2013 |
| On two problems regarding the Hamiltonian cycle game D Hefetz, S Stich the electronic journal of combinatorics, R28-R28, 2009 | 44 | 2009 |
| 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 |
| Avoider–Enforcer: The rules of the game D Hefetz, M Krivelevich, M Stojaković, T Szabó Journal of Combinatorial Theory, Series A 117 (2), 152-163, 2010 | 39 | 2010 |
| Weak and strong -connectivity games A Ferber, D Hefetz European Journal of Combinatorics 35, 169-183, 2014 | 34 | 2014 |
| A sharp threshold for the Hamilton cycle Maker–Breaker game D Hefetz, M Krivelevich, M Stojaković, T Szabó Random Structures & Algorithms 34 (1), 112-122, 2009 | 34 | 2009 |
| An application of the Combinatorial Nullstellensatz to a graph labelling problem D Hefetz, A Saluz, HTT Tran Journal of Graph Theory 65 (1), 70-82, 2010 | 30 | 2010 |
| Sharp threshold for the appearance of certain spanning trees in random graphs D Hefetz, M Krivelevich, T Szabó Random Structures & Algorithms 41 (4), 391-412, 2012 | 29 | 2012 |
| Winning strong games through fast strategies for weak games A Ferber, D Hefetz the electronic journal of combinatorics, P144-P144, 2011 | 29 | 2011 |
| On the inducibility of cycles D Hefetz, M Tyomkyn Journal of Combinatorial Theory, Series B 133, 243-258, 2018 | 26 | 2018 |
| On two generalizations of the Alon–Tarsi polynomial method D Hefetz Journal of Combinatorial Theory, Series B 101 (6), 403-414, 2011 | 26 | 2011 |
| Semi‐random graph process O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ... Random Structures & Algorithms 56 (3), 648-675, 2020 | 25 | 2020 |
| Polynomial lower bound for distributed graph coloring in a weak LOCAL model D Hefetz, F Kuhn, Y Maus, A Steger International Symposium on Distributed Computing, 99-113, 2016 | 23 | 2016 |
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityVerified email at post.tau.ac.il
