Imre Bárány
- Computer Graphics and Computer-Aided Design top 0.5%
- Computational Theory and Mathematics top 1%
- Applied Mathematics top 2%
- Computer Vision and Pattern Recognition top 5%
- Discrete Mathematics and Combinatorics top 2%
- Co-authors
- Zoltán FürediLaurence A. WolseyTony J. Van RoyJiřı́ MatoušekLászló LovászPável ValtrJános PachSenya Shlosman
- Topics
- Computational Geometry and Mesh Generation (37 papers)Limits and Structures in Graph Theory (18 papers)graph theory and CDMA systems (14 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsApplied Mathematics
- Partner nations
- HungaryUnited KingdomUnited States
In The Last Decade
Imre Bárány
80 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 107
- Computer Graphics and Computer-Aided Design 432
- Computational Theory and Mathematics 385
- Applied Mathematics 259
- Computer Vision and Pattern Recognition 194
- Discrete Mathematics and Combinatorics 181
Countries citing papers authored by Imre Bárány
This map shows the geographic impact of Imre Bárány'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 Imre Bárány with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Imre Bárány more than expected).
Fields of papers citing papers by Imre Bárány
This network shows the impact of papers produced by Imre Bárány. 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 Imre Bárány. The network helps show where Imre Bárány may publish in the future.
Co-authorship network of co-authors of Imre Bárány
This figure shows the co-authorship network connecting the top 25 collaborators of Imre Bárány. A scholar is included among the top collaborators of Imre Bárány based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Imre Bárány. Imre Bárány is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 3 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 3 | |
| 8 | 1 | |
| 9 | 3 | |
| 10 | 3 | |
| 11 | 3 | |
| 12 | Planar point sets with few empty convex polygons | 0 |
| 13 | 19 | |
| 14 | Central limit theorem for random convex chains | 1 |
| 15 | 30 | |
| 16 | Caratheodory's theorem, colourful and applicable | 8 |
| 17 | 3 | |
| 18 | 11 | |
| 19 | 22 | |
| 20 | 2 |
About Imre Bárány
Imre Bárány is a scholar working on Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 86 papers that have together received 1.2k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (37 papers), Limits and Structures in Graph Theory (18 papers) and graph theory and CDMA systems (14 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (432 citations), Discrete Mathematics and Combinatorics (181 citations) and Applied Mathematics (259 citations). Imre Bárány has collaborated with scholars based in Hungary, United Kingdom and United States. Frequent co-authors include Zoltán Füredi, Laurence A. Wolsey, Tony J. Van Roy, Jiřı́ Matoušek, László Lovász, Pável Valtr, János Pach, Senya Shlosman, Shmuel Onn and Daniel J. Kleitman. Their work appears in journals such as Management Science, Mathematical Programming and American Mathematical Monthly.
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.