Dániel Gerbner
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 69
- Advanced Combinatorial Mathematics 29
-
- Complexity and Algorithms in Graphs 17
- Advanced Graph Theory Research 6
- Co-authors
- Cory Palmer (20 shared papers)Balázs Patkós (41 shared papers)Abhishek Methuku (23 shared papers)Máté Vizer (35 shared papers)Balázs Keszegh (16 shared papers)Dömötör Pálvölgyi (13 shared papers)János Barát (2 shared papers)Ervin Győri (3 shared papers)
- Journals
- Discrete Mathematics (13 papers)The Electronic Journal of Combinatorics (12 papers)European Journal of Combinatorics (12 papers)Discrete Applied Mathematics (9 papers)Graphs and Combinatorics (9 papers)
- Partner nations
- HungaryUnited StatesSwitzerland
In The Last Decade
Dániel Gerbner
90 papers receiving 514 citations
Peers
Comparison fields: 5 of 21
- Discrete Mathematics and Combinatorics 474
- Computational Theory and Mathematics 68
- Computer Graphics and Computer-Aided Design 7
- Geometry and Topology 13
- Computer Networks and Communications 8
Countries citing papers authored by Dániel Gerbner
This map shows the geographic impact of Dániel Gerbner'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 Dániel Gerbner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dániel Gerbner more than expected).
Fields of papers citing papers by Dániel Gerbner
This network shows the impact of papers produced by Dániel Gerbner. 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 Dániel Gerbner. The network helps show where Dániel Gerbner may publish in the future.
Co-authors
The 25 scholars most cited alongside Dániel Gerbner, 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 107 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2017 | 56 | |
| 2 | 2018 | 43 | |
| 3 | 2019 | 42 | |
| 4 | 2020 | 31 | |
| 5 | 2019 | 26 | |
| 6 | 2019 | 25 | |
| 7 | 2014 | 24 | |
| 8 | 2012 | 23 | |
| 9 | 2020 | 18 | |
| 10 | 2014 | 13 | |
| 11 | 2021 | 12 | |
| 12 | 2012 | 10 | |
| 13 | 2021 | 10 | |
| 14 | 2022 | 10 | |
| 15 | 2012 | 7 | |
| 16 | 2016 | 7 | |
| 17 | 2008 | 6 | |
| 18 | 2015 | 6 | |
| 19 | 2013 | 5 | |
| 20 | 2014 | 5 |
About Dániel Gerbner
Dániel Gerbner is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Networks and Communications, Computer Graphics and Computer-Aided Design and Economics and Econometrics, having authored 107 papers that have together received 540 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (69 papers), Advanced Combinatorial Mathematics (29 papers), Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (6 papers), Optimization and Search Problems (5 papers), Game Theory and Voting Systems (3 papers), Computational Geometry and Mesh Generation (2 papers) and Stochastic processes and statistical mechanics (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (474 citations), Computational Theory and Mathematics (68 citations), Computer Graphics and Computer-Aided Design (7 citations), Geometry and Topology (13 citations) and Computer Networks and Communications (8 citations). Dániel Gerbner has collaborated with scholars based in Hungary, United States and Switzerland. Frequent co-authors include Cory Palmer, Balázs Patkós, Abhishek Methuku, Máté Vizer, Balázs Keszegh, Dömötör Pálvölgyi, János Barát, Ervin Győri, Nathan Lemons and Gábor N. Sárközy. Their work appears in journals such as Discrete Mathematics, The Electronic Journal of Combinatorics, European Journal of Combinatorics, Discrete Applied Mathematics and Graphs and Combinatorics.
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.