Dan Hefetz

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 27

Top Topics

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63 (4) (2023)
Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62 (2) (2023)
Elad Aigner-Horev, Dan Hefetz, Michael Trushkin
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. CoRR (2023)
Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter
Small rainbow cliques in randomly perturbed dense graphs. Eur. J. Comb. 101 (2022)
Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial, Avraham Morgenstern
On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. Electron. J. Comb. 29 (3) (2022)
Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Elad Aigner-Horev, Dan Hefetz
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 35 (3) (2021)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57 (4) (2020)
Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn
Edge-statistics on large graphs. Comb. Probab. Comput. 29 (2) (2020)
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic
Semi-random graph process. Random Struct. Algorithms 56 (3) (2020)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA (2020)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR (2019)
Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi
Spanning-Tree Games. MFCS (2018)
Dan Hefetz, Mykhaylo Tyomkyn
On the inducibility of cycles. J. Comb. Theory, Ser. B 133 (2018)
Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor
Ramsey-nice families of graphs. Eur. J. Comb. 72 (2018)
Shoni Gilboa, Dan Hefetz
On degree anti-Ramsey numbers. Eur. J. Comb. 60 (2017)
Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy, Clément Requilé, Amir Sarid
Strong Ramsey games: Drawing on an infinite board. J. Comb. Theory, Ser. A 150 (2017)
Dan Hefetz, Michael Krivelevich, Wei En Tan
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Eur. J. Comb. 63 (2017)
Dan Hefetz, Mykhaylo Tyomkyn
On the inducibility of cycles. Electron. Notes Discret. Math. 61 (2017)
Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. DISC (2016)
Dan Hefetz, Angelika Steger, Benny Sudakov
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49 (2) (2016)
Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger
A Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. CoRR (2016)
Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25 (6) (2016)
Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic
On saturation games. Eur. J. Comb. 51 (2016)
Dan Hefetz, Michael Krivelevich, Wei En Tan
Waiter-Client and Client-Waiter planarity, colorability and minor games. Discret. Math. 339 (5) (2016)
Malgorzata Bednarska-Bzdega, Dan Hefetz, Tomasz Luczak
Picker-Chooser fixed graph games. J. Comb. Theory, Ser. B 119 (2016)
Dan Hefetz, Mykhaylo Tyomkyn
Universality of Graphs with Few Triangles and Anti-Triangles. Comb. Probab. Comput. 25 (4) (2016)
Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29 (3) (2015)
Asaf Ferber, Dan Hefetz
k-connectivity games. Eur. J. Comb. 35 (2014)
Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal covers with Hamilton cycles in random graphs. Comb. 34 (5) (2014)
Dan Hefetz, Peter Keevash
A hypergraph Turán theorem via lagrangians of intersecting families. J. Comb. Theory, Ser. A 120 (8) (2013)
Dan Hefetz, Mirjana Mikalacki, Milos Stojakovic
Doubly Biased Maker-Breaker Connectivity Game. Electron. J. Comb. 19 (1) (2012)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41 (4) (2012)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41 (1) (2012)
Asaf Ferber, Dan Hefetz, Michael Krivelevich
Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33 (6) (2012)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32 (2) (2011)
Dan Hefetz, Asaf Ferber, Michael Krivelevich
Fast embedding of spanning trees in biased Maker-Breaker games. Electron. Notes Discret. Math. 38 (2011)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games. SODA (2011)
Asaf Ferber, Dan Hefetz
Winning Strong Games through Fast Strategies for Weak Games. Electron. J. Comb. 18 (1) (2011)
Dan Hefetz
On two generalizations of the Alon-Tarsi polynomial method. J. Comb. Theory, Ser. B 101 (6) (2011)
Dan Hefetz, Annina Saluz, Huong T. T. Tran
An application of the combinatorial Nullstellensatz to a graph labelling problem. J. Graph Theory 65 (1) (2010)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Avoider-Enforcer: The rules of the game. J. Comb. Theory, Ser. A 117 (2) (2010)
Dan Hefetz, Torsten Mütze, Justus Schwartz
On antimagic directed graphs. J. Graph Theory 64 (3) (2010)
Noga Alon, Dan Hefetz, Michael Krivelevich
Playing to Retain the Advantage. Comb. Probab. Comput. 19 (4) (2010)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games CoRR (2010)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34 (1) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast winning strategies in Maker-Breaker games. J. Comb. Theory, Ser. B 99 (1) (2009)
Dan Hefetz, Noga Alon, Michael Krivelevich
Playing to retain the advantage. Electron. Notes Discret. Math. 34 (2009)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Hamilton cycles in highly connected and expanding graphs. Comb. 29 (5) (2009)
Dan Hefetz, Sebastian U. Stich
On Two Problems Regarding the Hamiltonian Cycle Game. Electron. J. Comb. 16 (1) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34 (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25 (4) (2009)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Planarity, Colorability, and Minor Games. SIAM J. Discret. Math. 22 (1) (2008)
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
Fast winning strategies in positional games. Electron. Notes Discret. Math. 29 (2007)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Avoider-Enforcer games. J. Comb. Theory, Ser. A 114 (5) (2007)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28 (4) (2007)
Dan Hefetz
Anti-magic graphs via the Combinatorial NullStellenSatz. J. Graph Theory 50 (4) (2005)