Dan Hefetz

964 total citations
51 papers, 405 citations indexed

About

Dan Hefetz is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Dan Hefetz has authored 51 papers receiving a total of 405 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 33 papers in Discrete Mathematics and Combinatorics and 14 papers in Geometry and Topology. Recurrent topics in Dan Hefetz's work include Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (33 papers) and Game Theory and Applications (12 papers). Dan Hefetz is often cited by papers focused on Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (33 papers) and Game Theory and Applications (12 papers). Dan Hefetz collaborates with scholars based in Israel, Switzerland and United Kingdom. Dan Hefetz's co-authors include Michael Krivelevich, Tibor Szabó, Miloš Stojaković, Asaf Ferber, Peter Keevash, Michael Krivelevich, Torsten Mütze, Sebastian U. Stich, Noga Alon and A. Lahiri and has published in prestigious journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B and Journal of Combinatorial Theory Series A.

In The Last Decade

Dan Hefetz

47 papers receiving 376 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Dan Hefetz 349 234 95 63 53 51 405
Bill Sands 308 0.9× 133 0.6× 111 1.2× 32 0.5× 37 0.7× 43 380
Miloš Stojaković 143 0.4× 114 0.5× 32 0.3× 37 0.6× 30 0.6× 33 214
J. K. Truss 310 0.9× 111 0.5× 340 3.6× 19 0.3× 142 2.7× 79 501
Po‐Shen Loh 281 0.8× 269 1.1× 158 1.7× 9 0.1× 28 0.5× 36 358
Alfred W. Hales 210 0.6× 231 1.0× 189 2.0× 18 0.3× 44 0.8× 29 403
John H. Lindsey 78 0.2× 145 0.6× 91 1.0× 17 0.3× 56 1.1× 26 307
K. B. Reid 227 0.7× 106 0.5× 81 0.9× 19 0.3× 7 0.1× 45 310
M. van de Vel 188 0.5× 51 0.2× 190 2.0× 70 1.1× 89 1.7× 35 321
Lorenz Halbeısen 146 0.4× 46 0.2× 171 1.8× 10 0.2× 109 2.1× 60 290
E. S. Wolk 188 0.5× 44 0.2× 99 1.0× 34 0.5× 23 0.4× 21 277

Countries citing papers authored by Dan Hefetz

Since Specialization
Citations

This map shows the geographic impact of Dan Hefetz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dan Hefetz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Hefetz more than expected).

Fields of papers citing papers by Dan Hefetz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dan Hefetz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dan Hefetz. The network helps show where Dan Hefetz may publish in the future.

Co-authorship network of co-authors of Dan Hefetz

This figure shows the co-authorship network connecting the top 25 collaborators of Dan Hefetz. A scholar is included among the top collaborators of Dan Hefetz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dan Hefetz. Dan Hefetz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hefetz, Dan, et al.. (2025). Smoothed Analysis of the Komlós Conjecture: Rademacher Noise. The Electronic Journal of Combinatorics. 32(1).
2.
Hefetz, Dan, et al.. (2019). On the local structure of oriented graphs -- a case study in flag algebras. arXiv (Cornell University). 1 indexed citations
3.
Aharoni, Ron, et al.. (2018). Ramsey-nice families of graphs. European Journal of Combinatorics. 72. 29–44.
4.
Hefetz, Dan, et al.. (2018). On the inducibility of cycles. Journal of Combinatorial Theory Series B. 133. 243–258. 9 indexed citations
5.
Hefetz, Dan, et al.. (2017). Waiter–Client and Client–Waiter Hamiltonicity games on random graphs. European Journal of Combinatorics. 63. 26–43. 2 indexed citations
6.
Hefetz, Dan, et al.. (2017). Strong Ramsey games: Drawing on an infinite board. Journal of Combinatorial Theory Series A. 150. 248–266. 3 indexed citations
7.
Hefetz, Dan, et al.. (2016). Picker–Chooser fixed graph games. Journal of Combinatorial Theory Series B. 119. 122–154. 2 indexed citations
8.
Hefetz, Dan, et al.. (2016). Waiter–Client and Client–Waiter planarity, colorability and minor games. Discrete Mathematics. 339(5). 1525–1536. 4 indexed citations
9.
Hefetz, Dan, et al.. (2015). On saturation games. European Journal of Combinatorics. 51. 315–335. 2 indexed citations
10.
Hefetz, Dan, Miloš Stojaković, & Michael Krivelevich. (2014). Positional Games. arXiv (Cornell University). 19 indexed citations
11.
Hefetz, Dan, et al.. (2014). 4 Manipulative waiters with probabilistic intuition. 5 indexed citations
12.
Hefetz, Dan & Peter Keevash. (2013). A hypergraph Turán theorem via lagrangians of intersecting families. Journal of Combinatorial Theory Series A. 120(8). 2020–2038. 27 indexed citations
13.
Ferber, Asaf, Dan Hefetz, & Michael Krivelevich. (2012). Fast embedding of spanning trees in biased Maker–Breaker games. European Journal of Combinatorics. 33(6). 1086–1099. 5 indexed citations
14.
Ferber, Asaf, et al.. (2011). Hitting time results for Maker‐Breaker games. Random Structures and Algorithms. 41(1). 23–46. 16 indexed citations
15.
Ferber, Asaf, et al.. (2011). Hitting time results for Maker-Breaker games: extended abstract. Symposium on Discrete Algorithms. 900–912. 2 indexed citations
16.
Hefetz, Dan. (2011). On two generalizations of the Alon–Tarsi polynomial method. Journal of Combinatorial Theory Series B. 101(6). 403–414. 4 indexed citations
17.
Hefetz, Dan, Michael Krivelevich, Miloš Stojaković, & Tibor Szabó. (2009). Avoider–Enforcer: The rules of the game. Journal of Combinatorial Theory Series A. 117(2). 152–163. 9 indexed citations
18.
Hefetz, Dan, Michael Krivelevich, Miloš Stojaković, & Tibor Szabó. (2008). Fast winning strategies in Maker–Breaker games. Journal of Combinatorial Theory Series B. 99(1). 39–47. 27 indexed citations
19.
Hefetz, Dan, Michael Krivelevich, & Tibor Szabó. (2006). Bart–Moe games, JumbleG and discrepancy. European Journal of Combinatorics. 28(4). 1131–1143. 4 indexed citations
20.
Hefetz, Dan, Michael Krivelevich, & Tibor Szabó. (2006). Avoider–Enforcer games. Journal of Combinatorial Theory Series A. 114(5). 840–853. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026