default search action
Dan Hefetz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Elad Aigner-Horev, Dan Hefetz, Mathias Schacht:
Ramsey Properties of Randomly Perturbed Hypergraphs. APPROX/RANDOM 2024: 59:1-59:18 - 2023
- [j49]Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri:
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62(2): 287-303 (2023) - [j48]Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich:
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63(4): 867-884 (2023) - [i4]Elad Aigner-Horev, Dan Hefetz, Michael Trushkin:
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. CoRR abs/2307.06285 (2023) - 2022
- [j47]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) - [j46]Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Small rainbow cliques in randomly perturbed dense graphs. Eur. J. Comb. 101: 103452 (2022) - [j45]Elad Aigner-Horev
, Oran Danon, Dan Hefetz
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 36(4): 2975-2994 (2022) - 2021
- [j44]Elad Aigner-Horev
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 35(3): 1569-1577 (2021) - 2020
- [j43]Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn
Edge-statistics on large graphs. Comb. Probab. Comput. 29(2): 163-189 (2020) - [j42]Omri Ben-Eliezer, Dan Hefetz
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020) - [j41]Omri Ben-Eliezer, Lior Gishboliner
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57(4): 892-919 (2020) - [c4]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: 718-737
2010 – 2019
- 2019
- [i3]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR abs/1907.08031 (2019) - 2018
- [j40]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [j39]Dan Hefetz
On the inducibility of cycles. J. Comb. Theory B 133: 243-258 (2018) - [c3]Dan Hefetz
Spanning-Tree Games. MFCS 2018: 35:1-35:16 - 2017
- [j38]Shoni Gilboa, Dan Hefetz
On degree anti-Ramsey numbers. Eur. J. Comb. 60: 31-41 (2017) - [j37]Dan Hefetz
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Eur. J. Comb. 63: 26-43 (2017) - [j36]Dan Hefetz
On the inducibility of cycles. Electron. Notes Discret. Math. 61: 593-599 (2017) - [j35]Dan Hefetz
Strong Ramsey games: Drawing on an infinite board. J. Comb. Theory A 150: 248-266 (2017) - 2016
- [j34]Dan Hefetz
Universality of Graphs with Few Triangles and Anti-Triangles. Comb. Probab. Comput. 25(4): 560-576 (2016) - [j33]Malgorzata Bednarska-Bzdega, Dan Hefetz
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25(6): 823-849 (2016) - [j32]Dan Hefetz
Waiter-Client and Client-Waiter planarity, colorability and minor games. Discret. Math. 339(5): 1525-1536 (2016) - [j31]Dan Hefetz
On saturation games. Eur. J. Comb. 51: 315-335 (2016) - [j30]Malgorzata Bednarska-Bzdega, Dan Hefetz
Picker-Chooser fixed graph games. J. Comb. Theory B 119: 122-154 (2016) - [j29]Dan Hefetz
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49(2): 345-362 (2016) - [c2]Dan Hefetz
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. DISC 2016: 99-113 - [i2]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
A Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. CoRR abs/1607.05212 (2016) - 2015
- [j28]Dennis Clemens
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29(3): 1683-1705 (2015) - 2014
- [j27]Dan Hefetz
Optimal covers with Hamilton cycles in random graphs. Comb. 34(5): 573-596 (2014) - [j26]Asaf Ferber, Dan Hefetz
Weak and strong kk-connectivity games. Eur. J. Comb. 35: 169-183 (2014) - 2013
- [j25]Dan Hefetz
A hypergraph Turán theorem via lagrangians of intersecting families. J. Comb. Theory A 120(8): 2020-2038 (2013) - 2012
- [j24]Dan Hefetz, Mirjana Mikalacki, Milos Stojakovic:
Doubly Biased Maker-Breaker Connectivity Game. Electron. J. Comb. 19(1): 61 (2012) - [j23]Asaf Ferber, Dan Hefetz
Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33(6): 1086-1099 (2012) - [j22]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41(1): 23-46 (2012) - [j21]Dan Hefetz
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41(4): 391-412 (2012) - 2011
- [j20]Asaf Ferber, Dan Hefetz:
Winning Strong Games through Fast Strategies for Weak Games. Electron. J. Comb. 18(1) (2011) - [j19]Dan Hefetz
Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32(2): 162-177 (2011) - [j18]Dan Hefetz
Fast embedding of spanning trees in biased Maker-Breaker games. Electron. Notes Discret. Math. 38: 331-336 (2011) - [j17]Dan Hefetz
On two generalizations of the Alon-Tarsi polynomial method. J. Comb. Theory B 101(6): 403-414 (2011) - [c1]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. SODA 2011: 900-912 - 2010
- [j16]Noga Alon, Dan Hefetz
Playing to Retain the Advantage. Comb. Probab. Comput. 19(4): 481-491 (2010) - [j15]Dan Hefetz
Avoider-Enforcer: The rules of the game. J. Comb. Theory A 117(2): 152-163 (2010) - [j14]Dan Hefetz
On antimagic directed graphs. J. Graph Theory 64(3): 219-232 (2010) - [j13]Dan Hefetz
An application of the combinatorial Nullstellensatz to a graph labelling problem. J. Graph Theory 65(1): 70-82 (2010) - [i1]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. CoRR abs/1008.1865 (2010)
2000 – 2009
- 2009
- [j12]Dan Hefetz
Hamilton cycles in highly connected and expanding graphs. Comb. 29(5): 547-568 (2009) - [j11]Dan Hefetz, Sebastian U. Stich:
On Two Problems Regarding the Hamiltonian Cycle Game. Electron. J. Comb. 16(1) (2009) - [j10]Dan Hefetz
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34: 261-265 (2009) - [j9]Dan Hefetz
Playing to retain the advantage. Electron. Notes Discret. Math. 34: 423-427 (2009) - [j8]Dan Hefetz
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25(4): 533-544 (2009) - [j7]Dan Hefetz
Fast winning strategies in Maker-Breaker games. J. Comb. Theory B 99(1): 39-47 (2009) - [j6]Dan Hefetz
A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34(1): 112-122 (2009) - 2008
- [j5]Dan Hefetz
Planarity, Colorability, and Minor Games. SIAM J. Discret. Math. 22(1): 194-212 (2008) - 2007
- [b1]Dan Hefetz:
Positional games on graphs. Tel Aviv University, Israel, 2007 - [j4]Dan Hefetz
Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28(4): 1131-1143 (2007) - [j3]Dan Hefetz
Fast winning strategies in positional games. Electron. Notes Discret. Math. 29: 213-217 (2007) - [j2]Dan Hefetz
Avoider-Enforcer games. J. Comb. Theory A 114(5): 840-853 (2007) - 2005
- [j1]Dan Hefetz
Anti-magic graphs via the Combinatorial NullStellenSatz. J. Graph Theory 50(4): 263-272 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: