Vera Rosta
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Geometry and Topology top 5%
- Advanced Topology and Set Theory
- Graph theory and applications
Papers in
-
- Limits and Structures in Graph Theory 9
- Advanced Combinatorial Mathematics 3
-
- Advanced Graph Theory Research 8
- Graph Labeling and Dimension Problems 2
- Co-authors
- Stefan Burr (1 shared paper)Komei Fukuda (3 shared papers)Gyula Károlyi (3 shared papers)Shmuel Onn (1 shared paper)Antoine Deza (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series B (2 papers)The Electronic Journal of Combinatorics (2 papers)Journal of Global Optimization (1 paper)Computational Geometry (1 paper)Theoretical Computer Science (1 paper)
- Partner nations
- HungaryCanadaSwitzerland
In The Last Decade
Vera Rosta
11 papers receiving 208 citations
Peers
Comparison fields: 5 of 30
- Discrete Mathematics and Combinatorics 188
- Geometry and Topology 141
- Computational Theory and Mathematics 184
- Computer Graphics and Computer-Aided Design 20
- Algebra and Number Theory 9
Countries citing papers authored by Vera Rosta
This map shows the geographic impact of Vera Rosta'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 Vera Rosta with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vera Rosta more than expected).
Fields of papers citing papers by Vera Rosta
This network shows the impact of papers produced by Vera Rosta. 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 Vera Rosta. The network helps show where Vera Rosta may publish in the future.
Co-authors
The 5 scholars most cited alongside Vera Rosta, 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 | 1973 | 71 | |
| 2 | 1980 | 39 | |
| 3 | 2004 | 26 | |
| 4 | 1994 | 26 | |
| 5 | 1973 | 25 | |
| 6 | 2001 | 17 | |
| 7 | 2003 | 9 | |
| 8 | 1976 | 5 | |
| 9 | 2000 | 4 | |
| 10 | Wagner's theorem and combinatorial enumeration of 3-polytopes | 1993 | 1 |
| 11 | ON THE RAMSEY MULTIPLICITY OF THE ODD CYCLES | 2010 | 1 |
| 12 | 2009 | 0 |
About Vera Rosta
Vera Rosta is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering, having authored 12 papers that have together received 224 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (9 papers), Advanced Graph Theory Research (8 papers), Advanced Topology and Set Theory (4 papers), Advanced Combinatorial Mathematics (3 papers), Computational Geometry and Mesh Generation (3 papers), Graph Labeling and Dimension Problems (2 papers), Graph theory and applications (2 papers) and graph theory and CDMA systems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (188 citations), Geometry and Topology (141 citations), Computational Theory and Mathematics (184 citations), Computer Graphics and Computer-Aided Design (20 citations) and Algebra and Number Theory (9 citations). Vera Rosta has collaborated with scholars based in Hungary, Canada and Switzerland. Frequent co-authors include Stefan Burr, Komei Fukuda, Gyula Károlyi, Shmuel Onn and Antoine Deza. Their work appears in journals such as Journal of Combinatorial Theory Series B, The Electronic Journal of Combinatorics, Journal of Global Optimization, Computational Geometry and Theoretical Computer Science.
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.