Dan Hefetz

According to our database1, Dan Hefetz authored at least 41 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Semi-random graph process.
Random Struct. Algorithms, 2020

Edge-statistics on large graphs.
Comb. Probab. Comput., 2020

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Ramsey-nice families of graphs.
Eur. J. Comb., 2018

Spanning-Tree Games.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Strong Ramsey games: Drawing on an infinite board.
J. Comb. Theory, Ser. A, 2017

On the inducibility of cycles.
Electron. Notes Discret. Math., 2017

Waiter-Client and Client-Waiter Hamiltonicity games on random graphs.
Eur. J. Comb., 2017

On degree anti-Ramsey numbers.
Eur. J. Comb., 2017

Random directed graphs are robustly Hamiltonian.
Random Struct. Algorithms, 2016

Picker-Chooser fixed graph games.
J. Comb. Theory, Ser. B, 2016

On saturation games.
Eur. J. Comb., 2016

Waiter-Client and Client-Waiter planarity, colorability and minor games.
Discret. Math., 2016

Universality of Graphs with Few Triangles and Anti-Triangles.
Comb. Probab. Comput., 2016

Manipulative Waiters with Probabilistic Intuition.
Comb. Probab. Comput., 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Building Spanning Trees Quickly in Maker-Breaker Games.
SIAM J. Discret. Math., 2015

Weak and strong <i>k</i>k-connectivity games.
Eur. J. Comb., 2014

Optimal covers with Hamilton cycles in random graphs.
Comb., 2014

A hypergraph Turán theorem via lagrangians of intersecting families.
J. Comb. Theory, Ser. A, 2013

Sharp threshold for the appearance of certain spanning trees in random graphs.
Random Struct. Algorithms, 2012

Hitting time results for Maker-Breaker games.
Random Struct. Algorithms, 2012

Doubly Biased Maker-Breaker Connectivity Game.
Electron. J. Comb., 2012

On two generalizations of the Alon-Tarsi polynomial method.
J. Comb. Theory, Ser. B, 2011

Fast embedding of spanning trees in biased Maker-Breaker games.
Electron. Notes Discret. Math., 2011

Global Maker-Breaker games on sparse graphs.
Eur. J. Comb., 2011

Winning Strong Games through Fast Strategies for Weak Games.
Electron. J. Comb., 2011

An application of the combinatorial Nullstellensatz to a graph labelling problem.
J. Graph Theory, 2010

On antimagic directed graphs.
J. Graph Theory, 2010

A sharp threshold for the Hamilton cycle Maker-Breaker game.
Random Struct. Algorithms, 2009

Fast winning strategies in Maker-Breaker games.
J. Comb. Theory, Ser. B, 2009

Fast Winning Strategies in Avoider-Enforcer Games.
Graphs Comb., 2009

Avoider-Enforcer: The Rules of the Game.
Electron. Notes Discret. Math., 2009

Playing to retain the advantage.
Electron. Notes Discret. Math., 2009

On Two Problems Regarding the Hamiltonian Cycle Game.
Electron. J. Comb., 2009

Hamilton cycles in highly connected and expanding graphs.
Comb., 2009

Planarity, Colorability, and Minor Games.
SIAM J. Discret. Math., 2008

Avoider-Enforcer games.
J. Comb. Theory, Ser. A, 2007

Fast winning strategies in positional games.
Electron. Notes Discret. Math., 2007

Bart-Moe games, JumbleG and discrepancy.
Eur. J. Comb., 2007

Anti-magic graphs via the Combinatorial NullStellenSatz.
J. Graph Theory, 2005