Gábor Simonyi
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Topological and Geometric Data Analysis
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 20
- Advanced Combinatorial Mathematics 4
-
- Advanced Graph Theory Research 18
- Topological and Geometric Data Analysis 13
- Graph Labeling and Dimension Problems 7
- Co-authors
- János KörnerGábor TardosLászló LovászK. MartonImre CsiszárZsolt TuzaAttila SaliRudolf Ahlswede
In The Last Decade
Gábor Simonyi
38 papers receiving 393 citations
Peers
Comparison fields: 5 of 38
- Discrete Mathematics and Combinatorics 213
- Computational Theory and Mathematics 294
- Geometry and Topology 111
- Mathematical Physics 43
- Computer Networks and Communications 84
Countries citing papers authored by Gábor Simonyi
This map shows the geographic impact of Gábor Simonyi'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 Simonyi 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 Simonyi more than expected).
Fields of papers citing papers by Gábor Simonyi
This network shows the impact of papers produced by Gábor Simonyi. 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 Simonyi. The network helps show where Gábor Simonyi may publish in the future.
Co-authorship network
The 19 scholars most cited alongside Gábor Simonyi, 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 | 1 | |
| 2 | 2023 | 3 | |
| 3 | On 4-Chromatic Schrijver Graphs: Their Structure, Non-3-Colorability, and Critical Edges : A Story with Drums | 2020 | 0 |
| 4 | 2014 | 1 | |
| 5 | 2013 | 5 | |
| 6 | 2010 | 11 | |
| 7 | 2008 | 3 | |
| 8 | 2008 | 14 | |
| 9 | 2007 | 18 | |
| 10 | 2006 | 6 | |
| 11 | 2005 | 26 | |
| 12 | Local chromatic number and the Borsuk-Ulam Theorem | 2004 | 2 |
| 13 | 1999 | 11 | |
| 14 | 1998 | 0 | |
| 15 | 1996 | 3 | |
| 16 | 1994 | 8 | |
| 17 | 1992 | 27 | |
| 18 | 1990 | 51 | |
| 19 | 1989 | 6 | |
| 20 | 1988 | 33 |
About Gábor Simonyi
Gábor Simonyi is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science and Mathematical Physics, having authored 40 papers that have together received 423 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (20 papers), Advanced Graph Theory Research (18 papers), Topological and Geometric Data Analysis (13 papers), Graph theory and applications (8 papers), Graph Labeling and Dimension Problems (7 papers), Homotopy and Cohomology in Algebraic Topology (7 papers), Advanced Topology and Set Theory (6 papers) and Advanced Combinatorial Mathematics (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (213 citations), Computational Theory and Mathematics (294 citations), Geometry and Topology (111 citations), Mathematical Physics (43 citations) and Computer Networks and Communications (84 citations). Gábor Simonyi has collaborated with scholars based in Hungary, Italy and Canada. Frequent co-authors include János Körner, Gábor Tardos, László Lovász, K. Marton, Imre Csiszár, Zsolt Tuza, Attila Sali, Rudolf Ahlswede, Siniša T. Vrećica and Claude Tardif. Their work appears in journals such as SIAM Journal on Discrete Mathematics, IEEE Transactions on Information Theory, COMBINATORICA, Journal of Graph Theory and The Electronic Journal of 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.