Gábor Kun
-
- Limits and Structures in Graph Theory 8
-
- Advanced Graph Theory Research 11
- Complexity and Algorithms in Graphs 6
- Advanced Algebra and Logic 3
- Geometry and Topology top 10%
- Graph theory and applications 3
-
- Guidance and Control Systems 3
-
- Fuzzy and Soft Set Theory 3
-
- Optimization and Search Problems 2
- Co-authors
- Gerhard JankMárió SzegedyBéla BollobásImre LeaderJaroslav NešetřilRyan O’DonnellYuan ZhouYuichi Yoshida
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Theory of Computing (2 papers)European Journal of Combinatorics (2 papers)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- HungaryUnited StatesGermany
In The Last Decade
Gábor Kun
20 papers receiving 162 citations
Peers
Comparison fields: 5 of 35
- Discrete Mathematics and Combinatorics 33
- Computational Theory and Mathematics 124
- Geometry and Topology 32
- Algebra and Number Theory 13
- Computer Graphics and Computer-Aided Design 9
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-authorship network
The 15 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
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2023 | 1 | |
| 3 | 2022 | 1 | |
| 4 | 2016 | 2 | |
| 5 | 2016 | 3 | |
| 6 | 2015 | 7 | |
| 7 | 2015 | 6 | |
| 8 | 2013 | 13 | |
| 9 | 2012 | 25 | |
| 10 | 2012 | 20 | |
| 11 | 2008 | 12 | |
| 12 | 2007 | 9 | |
| 13 | 2007 | 1 | |
| 14 | 2006 | 0 | |
| 15 | 2003 | 6 | |
| 16 | 2003 | 2 | |
| 17 | 2002 | 15 | |
| 18 | 2001 | 0 | |
| 19 | 2001 | 12 | |
| 20 | Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games | 2000 | 18 |
About Gábor Kun
Gábor Kun is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Algebra and Number Theory and Computer Graphics and Computer-Aided Design, having authored 23 papers that have together received 181 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (8 papers), Complexity and Algorithms in Graphs (6 papers), Guidance and Control Systems (3 papers), Advanced Algebra and Logic (3 papers), Fuzzy and Soft Set Theory (3 papers), Graph theory and applications (3 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (33 citations), Computational Theory and Mathematics (124 citations), Geometry and Topology (32 citations), Algebra and Number Theory (13 citations) and Computer Graphics and Computer-Aided Design (9 citations). Gábor Kun has collaborated with scholars based in Hungary, United States and Germany. Frequent co-authors include Gerhard Jank, Márió Szegedy, Béla Bollobás, Imre Leader, Jaroslav Nešetřil, Ryan O’Donnell, Yuan Zhou, Yuichi Yoshida, Gábor Lippner and Daniel Dadush. Their work appears in journals such as Theory of Computing, European Journal of Combinatorics, Journal of Combinatorial Theory Series B, Random Structures and Algorithms and Israel Journal of Mathematics.
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.