Submitted​

​​
 

• Dan Hefetz and Michael Krivelevich 

  Colouring  graphs from random lists,

  Submitted.
   

• Elad Aigner-Horev, Dan Hefetz and Michael Trushkin 
  Smoothed Analysis of the Komlos Conjecture: Rademacher Noise,
  Submitted.
   

• Elad Aigner-Horev, Dan Hefetz and Michael Krivelevich 
  Minors, connectivity, and diameter in randomly perturbed sparse graphs,
  Submitted.
  
  ​

 Accepted for publication​

 

 

2024

 

• Elad Aigner-Horev, Dan Hefetz and Mathias Schacht 
  Ramsey properties of randomly perturbed hypergraphs,
  In Approximation, Randomization, and Combinatorial Optimization.
  Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International
  Proceedings in Informatics (LIPIcs) 317 (2024), 59:1–59:18.​​

 

​

2023
 

• Shoni Gilboa and Dan Hefetz 
  Semi-random process without replacement,
  Journal of Combinatorics 14(2) (2023), 167–196.
   

• Elad Aigner-Horev, Dan Hefetz and Abhiruk Lahiri
  Rainbow trees in uniformly edge-coloured graphs,
  Random Structures and Algorithms 62(2) (2023), 287–303.
   

• Elad Aigner-Horev, Dan Hefetz and Michael Krivelevich
  Cycle lengths in randomly perturbed graphs,
  Random Structures and Algorithms, 63(4) (2023), 867–884.
   

​

2022​​
 

• Elad Aigner-Horev, Oran Danon, Dan Hefetz and Shoham Letzter 
  Large rainbow cliques in randomly perturbed dense graphs,
  SIAM Journal on Discrete Mathematics 36(4) (2022), 2975–2994.
   

• Elad Aigner-Horev, Oran Danon, Dan Hefetz and Shoham Letzter 
  Small rainbow cliques in randomly perturbed dense graphs,​
  European Journal of Combinatorics 101 (2022), 103452.
   

• Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial and Avraham Morgenstern 
  On the local structure of oriented graphs - a case study in flag algebras,
  The Electronic Journal of Combinatorics 29(3) 2022, P3.39.
   

​

 2021

​

• Elad Aigner-Horev and Dan Hefetz 
  Rainbow Hamilton cycles in randomly coloured randomly perturbed dense graphs,
  SIAM Journal on Discrete Mathematics 35(3) (2021), 1569–1577.

​

​

 2020

​

• Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz and Michael Krivelevich ​
  Very fast construction of bounded-degree spanning graphs via the semi-random graph process,
  Random Structures and Algorithms 57(4) (2020), 892–919.
  An extended abstract appeared in the Proceedings of the
  31st Symposium on Discrete Algorithms (SODA'20), 728–737.
   

• Noga Alon, Dan Hefetz, Michael Krivelevich and Mykhaylo Tyomkyn 
  Edge-statistics on large graphs,
  Combinatorics, Probability and Computing 29(2) (2020), 163–189.
   

• Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman and Milos Stojakovic 
  Semi-random graph process,
  Random Structures and Algorithms 56(3) (2020), 648–675.

​​

​​

 2018

​

• Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg and Alon Naor
  Ramsey-nice families of graphs,
  European Journal of Combinatorics 72 (2018), 29–44.
   

• Dan Hefetz, Orna Kupferman, Amir Lellouche and Gal Vardi
  Spanning tree games,
  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS18).
   

• Dan Hefetz and Mykhaylo Tyomkyn 
  On the inducibility of cycles,
  Journal of Combinatorial Theory Ser. B 133 (2018), 243–258.

​

 2017

​

• Shoni Gilboa and Dan Hefetz 
  On degree anti-Ramsey numbers,
  European Journal of Combinatorics 60 (2017), 31–41.

​

• Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy, Clement Requile and Amir Sarid 
  Strong Ramsey Games: Drawing on an infinite board,
  Journal of Combinatorial Theory Ser. A 150 (2017), 248–266.

​

• Dan Hefetz, Michael Krivelevich and Wei En Tan
  Waiter-Client and Client-Waiter Hamiltonicity games on random graphs,
  European Journal of Combinatorics 63 (2017), 26–43.

​

 2016

​

• Dan Hefetz and Mykhaylo Tyomkyn 
  Universality of graphs with few triangles and anti-triangles,
  Combinatorics, Probability and Computing 25(4) (2016), 560–576.
   

• Dan Hefetz, Michael Krivelevich and Wei En Tan
  Waiter-Client and Client-Waiter planarity, colorability and minor games,
  Discrete Mathematics 339 (2016), 1525–1536.
   

• Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich and Tomasz Luczak
  Manipulative Waiters with Probabilistic Intuition,
  Combinatorics, Probability and Computing 25(6) (2016), 823–849.
   

• Dan Hefetz, Michael Krivelevich, Alon Naor and Milos Stojakovic
  On saturation games,
  European Journal of Combinatorics 41 (2016), 315–335.
   

• Malgorzata Bednarska-Bzdega, Dan Hefetz and Tomasz Luczak
  Picker-Chooser fixed graph games,
  Journal of Combinatorial Theory Ser. B 119 (2016), 122–154.
   

• Dan Hefetz, Angelika Steger and Benny Sudakov
  Random directed graphs are robustly Hamiltonian,
  Random Structures and Algorithms 49(2) (2016), 345–362.
  Extended version.
   

• Dan Hefetz, Fabian Kuhn, Yannic Maus and Angelika Steger
  Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model,
  Proceedings of the 30th International Symposium on Distributed Computing (DISC16),
  Lecture Notes in Computer Science (2016), 99–113. Best paper award.
   

​ 2015

​

• Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz and Anita Liebenau 
  Building spanning trees quickly in Maker-Breaker games,
  SIAM Journal on Discrete Mathematics 29 (3) (2015), 1683–1705.

​

 2014

​

• Dan Hefetz, Daniela Kuhn, John Lapinskas and Deryk Osthus 
  Optimal covers with Hamilton cycles in random graphs,
  Combinatorica 34 (2014), 573–596.
   

• Asaf Ferber and Dan Hefetz
  Weak and strong k-connectivity games,
  European Journal of Combinatorics 35 (2014), 169–183 (special issue of EuroComb11).
   

​ 2013

​

• Dan Hefetz and Peter Keevash 
  A hypergraph Turan theorem via lagrangians of intersecting families,
  Journal of Combinatorial Theory, Ser. A. 120 (2013), 2020–2038.

 

 2012

​

• Dan Hefetz, Michael Krivelevich and Tibor Szabo,
  Sharp threshold for the appearance of certain spanning trees in random graphs,
  Random Structures and Algorithms 41 (2012), 391–412.
   

• Dan Hefetz, Mirjana Mikalacki and Milos Stojakovic,
  Doubly biased Maker-Breaker Connectivity game,
  The Electronic Journal of Combinatorics 19 2012, P61.
   

• Asaf Ferber, Dan Hefetz and Michael Krivelevich,
  Fast embedding of spanning trees in biased Maker-Breaker games,
  European Journal of Combinatorics 33 (2012), 1086–1099.
   

• Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz and Michael Krivelevich,
  Hitting time results for Maker-Breaker games,
  Random Structures and Algorithms 41 (2012), 23–46.
  An extended abstract appeared in the Proceedings of the
  22nd ACM-SIAM Symposium on Discrete Algorithms (SODA'11), 900–912, 2011. 
   

 2011

​

• Dan Hefetz,
  On two generalizations of the Alon-Tarsi polynomial method,
  Journal of Combinatorial Theory, Ser. B. 101(6) (2011), 403–414.
   

• Asaf Ferber and Dan Hefetz,
  Winning strong games through fast strategies for weak games,
  The Electronic Journal of Combinatorics 18(1) 2011, P144.
   

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Global Maker-Breaker games on sparse graphs,
  European Journal of Combinatorics 32 (2011), 162–177.
   

 2010
 

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Avoider-Enforcer: The rules of the game,
  Journal of Combinatorial Theory, Ser. A. 117 (2010), 152–163.
   

• Dan Hefetz, Torsten Muetze and Justus Schwartz,
  On antimagic directed graphs,
  Journal of Graph Theory 64(3) (2010), 219–232.
   

• Noga Alon, Dan Hefetz and Michael Krivelevich,
  Playing to retain the advantage,
  Combinatorics, Probability and Computing 19(4) (2010), 481–491.
   

• Dan Hefetz, Huong Thi Thu Tran and Annina Saluz,
  An application of the Combinatorial Nullstellensatz to a graph labelling problem,
  Journal of Graph Theory 65(1) (2010), 70–82.
  Some relevant material can be found in the bachelor thesis of Annina
   

 2009
 

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  A sharp threshold for the Hamilton cycle Maker-Breaker game,
  Random Structures and Algorithms 34 (2009), 112–122.
   

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Fast winning strategies in Maker-Breaker games,
  Journal of Combinatorial Theory, Ser. B. 99 (2009), 39–47.
   

• Dan Hefetz and Sebastian Stich,
  On two problems regarding the Hamilton cycle game,
  The Electronic Journal of Combinatorics 16(1) 2009, R28.
   

• Dan Hefetz, Michael Krivelevich and Tibor Szabo,
  Hamilton cycles in highly connected and expanding graphs,
  Combinatorica 29(5) (2009), 547–568.
   

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Fast winning strategies in Avoider-Enforcer games,
  Graphs and Combinatorics 25 (2009), 533–544.
   

 2008

​

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Planarity, colorability and minor games,
  SIAM Journal on Discrete Mathematics 22(1) (2008), 194–212.
   

 2007

​

• Dan Hefetz, Michael Krivelevich and Tibor Szabo,
  Bart-Moe games, JumbleG and Discrepancy,
  European Journal of Combinatorics 28(4) (2007), 1131–1143.
   

• Dan Hefetz, Michael Krivelevich and Tibor Szabo,
  Avoider-Enforcer games,
  Journal of Combinatorial Theory Ser. A. 114 (2007), 840–853.
   

 2005

​

• Dan Hefetz,
  Anti-magic graphs via the Combinatorial Nullstellensatz,
  Journal of Graph Theory 50(4) (2005), 263–272.
   

 Books

​

• Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo,
  Positional Games,
  Oberwolfach Seminars 44, Birkhäuser, 2014.
   

 PhD Thesis

​

• Positional games on graphs, Tel Aviv University, 2008.
   

 MSc Thesis

​

• On the product of n linearly independent linear functions in n variables, Tel Aviv University, 2003.