Positional games D Hefetz, M Krivelevich, M Stojaković, T Szabó
Birkhäuser, 2014
130 2014 Anti‐magic graphs via the combinatorial nullstellensatz D Hefetz
Journal of Graph Theory 50 (4), 263-272, 2005
77 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
70 2009 Hamilton cycles in highly connected and expanding graphs D Hefetz, M Krivelevich, T Szabó
Combinatorica 29 (5), 547-568, 2009
52 2009 Avoider–enforcer games D Hefetz, M Krivelevich, T Szabó
Journal of Combinatorial Theory, Series A 114 (5), 840-853, 2007
49 2007 Planarity, colorability, and minor games D Hefetz, M Krivelevich, M Stojaković, T Szabó
SIAM Journal on Discrete Mathematics 22 (1), 194-212, 2008
44 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
43 2013 On antimagic directed graphs D Hefetz, T Mütze, J Schwartz
Journal of Graph Theory 64 (3), 219-232, 2010
42 2010 On two problems regarding the Hamiltonian cycle game D Hefetz, S Stich
the electronic journal of combinatorics, R28-R28, 2009
41 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
38 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
33 2010 Weak and strong A Ferber, D Hefetz
European Journal of Combinatorics 35, 169-183, 2014
32 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
30 2009 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
27 2012 Winning strong games through fast strategies for weak games A Ferber, D Hefetz
the electronic journal of combinatorics, P144-P144, 2011
27 2011 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
25 2010 On the inducibility of cycles D Hefetz, M Tyomkyn
Journal of Combinatorial Theory, Series B 133, 243-258, 2018
23 2018 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
20 2016 Random directed graphs are robustly Hamiltonian D Hefetz, A Steger, B Sudakov
Random Structures & Algorithms 49 (2), 345-362, 2016
20 2016 Semi‐random graph process O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ...
Random Structures & Algorithms 56 (3), 648-675, 2020
19 2020 
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityBestätigte E-Mail-Adresse bei post.tau.ac.il
