Gábor Bacsó
- Computational Theory and Mathematics top 2%
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Geometry and Topology top 10%
- Co-authors
- Źsolt TuzaZs. TuzaMyriam PreissmannAndrás GyárfásAndrás SeböDániel MarxVitaly VoloshinVladimir Gurvich
- Topics
- Advanced Graph Theory Research (26 papers)Graph Labeling and Dimension Problems (15 papers)graph theory and CDMA systems (12 papers)
In The Last Decade
Gábor Bacsó
27 papers receiving 267 citations
Peers
Comparison fields: 5 of 19
- Computational Theory and Mathematics 263
- Discrete Mathematics and Combinatorics 142
- Electrical and Electronic Engineering 68
- Computer Networks and Communications 41
- Geometry and Topology 31
Countries citing papers authored by Gábor Bacsó
This map shows the geographic impact of Gábor Bacsó'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 Bacsó 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 Bacsó more than expected).
Fields of papers citing papers by Gábor Bacsó
This network shows the impact of papers produced by Gábor Bacsó. 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 Bacsó. The network helps show where Gábor Bacsó may publish in the future.
Co-authorship network of co-authors of Gábor Bacsó
This figure shows the co-authorship network connecting the top 25 collaborators of Gábor Bacsó. A scholar is included among the top collaborators of Gábor Bacsó 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 Gábor Bacsó. Gábor Bacsó 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 | 0 | |
| 5 | 1 | |
| 6 | 0 | |
| 7 | 11 | |
| 8 | 5 | |
| 9 | 5 | |
| 10 | 1 | |
| 11 | 1 | |
| 12 | New challenges in the theory of hypergraph coloring | 3 |
| 13 | 19 | |
| 14 | 8 | |
| 15 | 3 | |
| 16 | 4 | |
| 17 | 3 | |
| 18 | Structural domination of graphs. | 8 |
| 19 | 1 | |
| 20 | On Minimally Imperfect Graphs with Circular Symmetry | 11 |
About Gábor Bacsó
Gábor Bacsó is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 33 papers that have together received 284 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (15 papers) and graph theory and CDMA systems (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (142 citations), Computational Theory and Mathematics (263 citations) and Geometry and Topology (31 citations). Gábor Bacsó has collaborated with scholars based in Hungary, Germany and Poland. Frequent co-authors include Źsolt Tuza, Zs. Tuza, Myriam Preissmann, András Gyárfás, András Sebö, Dániel Marx, Vitaly Voloshin, Vladimir Gurvich, Erik Jan van Leeuwen and Endre Boros. Their work appears in journals such as Discrete Mathematics, Algorithmica and SIAM Journal on Discrete 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.