Gábor Kun
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- semigroups and automata theory
- Advanced Algebra and Logic
Papers in
-
- Advanced Graph Theory Research 12
- Complexity and Algorithms in Graphs 6
- Advanced Algebra and Logic 3
- Graph Labeling and Dimension Problems 3
-
- Limits and Structures in Graph Theory 9
- Co-authors
- Gerhard Jank (3 shared papers)Márió Szegedy (2 shared papers)Jaroslav Nešetřil (4 shared papers)Béla Bollobás (1 shared paper)Imre Leader (1 shared paper)Ryan O’Donnell (1 shared paper)Yuichi Yoshida (1 shared paper)Yuan Zhou (1 shared paper)
- Journals
- Theory of Computing (2 papers)European Journal of Combinatorics (2 papers)Journal of Combinatorial Theory Series B (1 paper)Israel Journal of Mathematics (1 paper)Random Structures and Algorithms (1 paper)
- Partner nations
- HungaryUnited StatesGermany
In The Last Decade
Gábor Kun
22 papers receiving 190 citations
Peers
Comparison fields: 5 of 38
- Discrete Mathematics and Combinatorics 42
- Computational Theory and Mathematics 146
- Geometry and Topology 36
- Computer Graphics and Computer-Aided Design 11
- Algebra and Number Theory 13
Countries citing papers authored by Gábor Kun
This map shows the geographic impact of Gábor Kun'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 Gábor Kun with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gábor Kun more than expected).
Fields of papers citing papers by Gábor Kun
This network shows the impact of papers produced by Gábor Kun. 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 Gábor Kun. The network helps show where Gábor Kun may publish in the future.
Co-authors
The 17 scholars most cited alongside Gábor Kun, 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 26 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 29 | |
| 2 | 2012 | 25 | |
| 3 | 2009 | 21 | |
| 4 | Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games | 2000 | 20 |
| 5 | 2002 | 18 | |
| 6 | 2013 | 15 | |
| 7 | 2008 | 14 | |
| 8 | 2001 | 13 | |
| 9 | 2007 | 9 | |
| 10 | 1999 | 9 | |
| 11 | 2015 | 7 | |
| 12 | 2015 | 7 | |
| 13 | 2003 | 6 | |
| 14 | 2016 | 5 | |
| 15 | 2007 | 4 | |
| 16 | 2016 | 2 | |
| 17 | 2008 | 2 | |
| 18 | 2003 | 2 | |
| 19 | 2022 | 1 | |
| 20 | 2023 | 1 |
About Gábor Kun
Gábor Kun is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Management Science and Operations Research, having authored 26 papers that have together received 212 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (12 papers), Limits and Structures in Graph Theory (9 papers), Complexity and Algorithms in Graphs (6 papers), Graph theory and applications (3 papers), Guidance and Control Systems (3 papers), Advanced Algebra and Logic (3 papers), Graph Labeling and Dimension Problems (3 papers) and Fuzzy and Soft Set Theory (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (42 citations), Computational Theory and Mathematics (146 citations), Geometry and Topology (36 citations), Computer Graphics and Computer-Aided Design (11 citations) and Algebra and Number Theory (13 citations). Gábor Kun has collaborated with scholars based in Hungary, United States and Germany. Frequent co-authors include Gerhard Jank, Márió Szegedy, Jaroslav Nešetřil, Béla Bollobás, Imre Leader, Ryan O’Donnell, Yuichi Yoshida, Yuan Zhou, Daniel Dadush and Gábor Lippner. Their work appears in journals such as Theory of Computing, European Journal of Combinatorics, Journal of Combinatorial Theory Series B, Israel Journal of Mathematics and Random Structures and Algorithms.
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.