Dan Hefetz
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 37
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 7
-
- Limits and Structures in Graph Theory 37
- Co-authors
- Michael Krivelevich (24 shared papers)Tibor Szabó (15 shared papers)Miloš Stojaković (14 shared papers)Asaf Ferber (9 shared papers)Peter Keevash (2 shared papers)Michael Krivelevich (6 shared papers)Torsten Mütze (1 shared paper)Sebastian U. Stich (1 shared paper)
- Journals
- European Journal of Combinatorics (9 papers)Random Structures and Algorithms (6 papers)Journal of Combinatorial Theory Series B (4 papers)SIAM Journal on Discrete Mathematics (4 papers)Journal of Combinatorial Theory Series A (4 papers)
- Partner nations
- IsraelSwitzerlandUnited Kingdom
In The Last Decade
Dan Hefetz
53 papers receiving 425 citations
Peers
Comparison fields: 5 of 22
- Discrete Mathematics and Combinatorics 260
- Computational Theory and Mathematics 390
- Geometry and Topology 105
- Mathematical Physics 62
- Management Science and Operations Research 68
Countries citing papers authored by Dan Hefetz
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
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-authors
The 21 scholars most cited alongside Dan Hefetz, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 57 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2005 | 35 | |
| 2 | 2008 | 29 | |
| 3 | 2009 | 28 | |
| 4 | 2013 | 27 | |
| 5 | 2009 | 24 | |
| 6 | 2014 | 24 | |
| 7 | Positional Games | 2014 | 23 |
| 8 | 2006 | 21 | |
| 9 | 2008 | 21 | |
| 10 | 2011 | 20 | |
| 11 | 2008 | 15 | |
| 12 | 2009 | 14 | |
| 13 | 2009 | 13 | |
| 14 | 2013 | 11 | |
| 15 | 2016 | 11 | |
| 16 | 2009 | 10 | |
| 17 | 2012 | 9 | |
| 18 | 2018 | 9 | |
| 19 | 2011 | 8 | |
| 20 | 2010 | 8 |
About Dan Hefetz
Dan Hefetz is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Management Science and Operations Research and Mathematical Physics, having authored 57 papers that have together received 456 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (37 papers), Limits and Structures in Graph Theory (37 papers), Game Theory and Applications (12 papers), Graph Labeling and Dimension Problems (8 papers), Graph theory and applications (8 papers), Stochastic processes and statistical mechanics (8 papers), Advanced Topology and Set Theory (8 papers) and Complexity and Algorithms in Graphs (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (260 citations), Computational Theory and Mathematics (390 citations), Geometry and Topology (105 citations), Mathematical Physics (62 citations) and Management Science and Operations Research (68 citations). Dan Hefetz has collaborated with scholars based in Israel, Switzerland and United Kingdom. Frequent co-authors include Michael Krivelevich, Tibor Szabó, Miloš Stojaković, Asaf Ferber, Peter Keevash, Michael Krivelevich, Torsten Mütze, Sebastian U. Stich, Angelika Steger and Fabian Kühn. Their work appears in journals such as European Journal of Combinatorics, Random Structures and Algorithms, Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics and Journal of Combinatorial Theory Series A.
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.