Csilla Bujtás
- Computational Theory and Mathematics top 1%
- Discrete Mathematics and Combinatorics top 2%
- Electrical and Electronic Engineering
- Computer Networks and Communications top 10%
- Geometry and Topology top 10%
- Co-authors
- Źsolt TuzaMichael A. HenningSandi KlavžarE. SampathkumarVitaly VoloshinZs. TuzaSzilárd JaskóBalázs Patkós
- Topics
- Advanced Graph Theory Research (60 papers)Graph Labeling and Dimension Problems (32 papers)Limits and Structures in Graph Theory (32 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- SHILAP Revista de lepidopterologíaTheoretical Computer ScienceNetworks
In The Last Decade
Csilla Bujtás
67 papers receiving 461 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 408
- Discrete Mathematics and Combinatorics 186
- Electrical and Electronic Engineering 127
- Computer Networks and Communications 79
- Geometry and Topology 64
Countries citing papers authored by Csilla Bujtás
This map shows the geographic impact of Csilla Bujtás'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 Csilla Bujtás with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Csilla Bujtás more than expected).
Fields of papers citing papers by Csilla Bujtás
This network shows the impact of papers produced by Csilla Bujtás. 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 Csilla Bujtás. The network helps show where Csilla Bujtás may publish in the future.
Co-authorship network of co-authors of Csilla Bujtás
This figure shows the co-authorship network connecting the top 25 collaborators of Csilla Bujtás. A scholar is included among the top collaborators of Csilla Bujtás 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 Csilla Bujtás. Csilla Bujtás 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 | 0 | |
| 3 | 4 | |
| 4 | 3 | |
| 5 | 7 | |
| 6 | 3 | |
| 7 | 3 | |
| 8 | 7 | |
| 9 | 5 | |
| 10 | 5 | |
| 11 | 7 | |
| 12 | 22 | |
| 13 | 9 | |
| 14 | 6 | |
| 15 | 33 | |
| 16 | Voloshin's conjecture for C-perfect hypertrees. | 3 |
| 17 | 5 | |
| 18 | 7 | |
| 19 | New challenges in the theory of hypergraph coloring | 3 |
| 20 | 1 |
About Csilla Bujtás
Csilla Bujtás is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 72 papers that have together received 492 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (60 papers), Graph Labeling and Dimension Problems (32 papers) and Limits and Structures in Graph Theory (32 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (186 citations), Computational Theory and Mathematics (408 citations) and Geometry and Topology (64 citations). Csilla Bujtás has collaborated with scholars based in Hungary, Slovenia and India. Frequent co-authors include Źsolt Tuza, Michael A. Henning, Sandi Klavžar, E. Sampathkumar, Vitaly Voloshin, Zs. Tuza, Szilárd Jaskó, Balázs Patkós, Boštjan Brešar and Máté Vizer. Their work appears in journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Networks.
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.