Anti-magic graphs via the Combinatorial NullStellenSatz. - Dan Hefetz (J. Graph Theory, 2005)

Bart-Moe games, JumbleG and discrepancy. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Eur. J. Comb., 2007)

Fast winning strategies in positional games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Electron. Notes Discret. Math., 2007)

Avoider-Enforcer games. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (J. Comb. Theory A, 2007)

Positional games on graphs - Dan Hefetz (2007)

Planarity, Colorability, and Minor Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (SIAM J. Discret. Math., 2008)

Hamilton cycles in highly connected and expanding graphs. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Comb., 2009)

On Two Problems Regarding the Hamiltonian Cycle Game. - Dan Hefetz; Sebastian U. Stich (Electron. J. Comb., 2009)

Playing to retain the advantage. - Dan Hefetz; Noga Alon; Michael Krivelevich (Electron. Notes Discret. Math., 2009)

Fast Winning Strategies in Avoider-Enforcer Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Graphs Comb., 2009)

Fast winning strategies in Maker-Breaker games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (J. Comb. Theory B, 2009)

A sharp threshold for the Hamilton cycle Maker-Breaker game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Random Struct. Algorithms, 2009)

Avoider-Enforcer: The rules of the game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (J. Comb. Theory A, 2010)

On antimagic directed graphs. - Dan Hefetz; Torsten Mütze; Justus Schwartz (J. Graph Theory, 2010)

An application of the combinatorial Nullstellensatz to a graph labelling problem. - Dan Hefetz; Annina Saluz; Huong T. T. Tran (J. Graph Theory, 2010)

Winning Strong Games through Fast Strategies for Weak Games. - Asaf Ferber; Dan Hefetz (Electron. J. Comb., 2011)

Global Maker-Breaker games on sparse graphs. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Eur. J. Comb., 2011)

Fast embedding of spanning trees in biased Maker-Breaker games. - Dan Hefetz; Asaf Ferber; Michael Krivelevich (Electron. Notes Discret. Math., 2011)

On two generalizations of the Alon-Tarsi polynomial method. - Dan Hefetz (J. Comb. Theory B, 2011)

Doubly Biased Maker-Breaker Connectivity Game. - Dan Hefetz; Mirjana Mikalacki; Milos Stojakovic (Electron. J. Comb., 2012)

Hitting time results for Maker-Breaker games. - Sonny Ben-Shimon; Asaf Ferber; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2012)

Sharp threshold for the appearance of certain spanning trees in random graphs. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Random Struct. Algorithms, 2012)

A hypergraph Turán theorem via lagrangians of intersecting families. - Dan Hefetz; Peter Keevash (J. Comb. Theory A, 2013)

Optimal covers with Hamilton cycles in random graphs. - Dan Hefetz; Daniela Kühn; John Lapinskas; Deryk Osthus (Comb., 2014)

Weak and strong kk-connectivity games. - Asaf Ferber; Dan Hefetz (Eur. J. Comb., 2014)

Building Spanning Trees Quickly in Maker-Breaker Games. - Dennis Clemens; Asaf Ferber; Roman Glebov; Dan Hefetz; Anita Liebenau (SIAM J. Discret. Math., 2015)

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. - Dan Hefetz; Fabian Kuhn; Yannic Maus; Angelika Steger (DISC, 2016)

Manipulative Waiters with Probabilistic Intuition. - Malgorzata Bednarska-Bzdega; Dan Hefetz; Michael Krivelevich; Tomasz Luczak 001 (Comb. Probab. Comput., 2016)

Universality of Graphs with Few Triangles and Anti-Triangles. - Dan Hefetz; Mykhaylo Tyomkyn (Comb. Probab. Comput., 2016)

Waiter-Client and Client-Waiter planarity, colorability and minor games. - Dan Hefetz; Michael Krivelevich; Wei En Tan (Discret. Math., 2016)

On saturation games. - Dan Hefetz; Michael Krivelevich; Alon Naor; Milos Stojakovic (Eur. J. Comb., 2016)

Picker-Chooser fixed graph games. - Malgorzata Bednarska-Bzdega; Dan Hefetz; Tomasz Luczak 001 (J. Comb. Theory B, 2016)

Random directed graphs are robustly Hamiltonian. - Dan Hefetz; Angelika Steger; Benny Sudakov (Random Struct. Algorithms, 2016)

On degree anti-Ramsey numbers. - Shoni Gilboa; Dan Hefetz (Eur. J. Comb., 2017)

Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. - Dan Hefetz; Michael Krivelevich; Wei En Tan (Eur. J. Comb., 2017)

Strong Ramsey games: Drawing on an infinite board. - Dan Hefetz; Christopher Kusch; Lothar Narins; Alexey Pokrovskiy; Clément Requilé; Amir Sarid (J. Comb. Theory A, 2017)

Spanning-Tree Games. - Dan Hefetz; Orna Kupferman; Amir Lellouche; Gal Vardi (MFCS, 2018)

Ramsey-nice families of graphs. - Ron Aharoni; Noga Alon; Michal Amir; Penny Haxell; Dan Hefetz; Zilin Jiang; Gal Kronenberg; Alon Naor (Eur. J. Comb., 2018)

On the inducibility of cycles. - Dan Hefetz; Mykhaylo Tyomkyn (J. Comb. Theory B, 2018)

Edge-statistics on large graphs. - Noga Alon; Dan Hefetz; Michael Krivelevich; Mykhaylo Tyomkyn (Comb. Probab. Comput., 2020)

Very fast construction of bounded-degree spanning graphs via the semi-random graph process. - Omri Ben-Eliezer; Lior Gishboliner; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2020)

Semi-random graph process. - Omri Ben-Eliezer; Dan Hefetz; Gal Kronenberg; Olaf Parczyk; Clara Shikhelman; Milos Stojakovic (Random Struct. Algorithms, 2020)

Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. - Elad Aigner-Horev; Dan Hefetz (SIAM J. Discret. Math., 2021)

On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. - Shoni Gilboa; Roman Glebov; Dan Hefetz; Nati Linial; Avraham Morgenstern (Electron. J. Comb., 2022)

Small rainbow cliques in randomly perturbed dense graphs. - Elad Aigner-Horev; Oran Danon; Dan Hefetz; Shoham Letzter (Eur. J. Comb., 2022)

Large Rainbow Cliques in Randomly Perturbed Dense Graphs. - Elad Aigner-Horev; Oran Danon; Dan Hefetz; Shoham Letzter (SIAM J. Discret. Math., 2022)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. - Elad Aigner-Horev; Dan Hefetz; Michael Trushkin (CoRR, 2023)

Rainbow trees in uniformly edge-colored graphs. - Elad Aigner-Horev; Dan Hefetz; Abhiruk Lahiri (Random Struct. Algorithms, 2023)

Cycle lengths in randomly perturbed graphs. - Elad Aigner-Horev; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2023)

Ramsey Properties of Randomly Perturbed Hypergraphs. - Elad Aigner-Horev; Dan Hefetz; Mathias Schacht (APPROX/RANDOM, 2024)

Minors, connectivity, and diameter in randomly perturbed sparse graphs. - Elad Aigner-Horev; Dan Hefetz; Michael Krivelevich (Eur. J. Comb., 2025)

Smoothed analysis in compressed sensing. - Elad Aigner-Horev; Dan Hefetz; Michael Trushkin (CoRR, 2025)