Máté Vizer
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 35
- Advanced Combinatorial Mathematics 15
-
- Advanced Graph Theory Research 13
- Complexity and Algorithms in Graphs 9
- Graph Labeling and Dimension Problems 2
- Co-authors
- Dániel Gerbner (35 shared papers)Abhishek Methuku (19 shared papers)Balázs Patkós (31 shared papers)Ervin Győri (4 shared papers)Csilla Bujtás (6 shared papers)Źsolt Tuza (10 shared papers)Balázs Keszegh (9 shared papers)Boštjan Brešar (4 shared papers)
- Journals
- Discrete Mathematics (7 papers)Discrete Applied Mathematics (7 papers)The Electronic Journal of Combinatorics (6 papers)European Journal of Combinatorics (5 papers)SIAM Journal on Discrete Mathematics (3 papers)
- Partner nations
- HungarySwitzerlandRussia
In The Last Decade
Máté Vizer
47 papers receiving 292 citations
Peers
Comparison fields: 5 of 14
- Discrete Mathematics and Combinatorics 180
- Computational Theory and Mathematics 120
- Computer Graphics and Computer-Aided Design 12
- Geometry and Topology 10
- Algebra and Number Theory 4
Countries citing papers authored by Máté Vizer
This map shows the geographic impact of Máté Vizer'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 Máté Vizer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Máté Vizer more than expected).
Fields of papers citing papers by Máté Vizer
This network shows the impact of papers produced by Máté Vizer. 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 Máté Vizer. The network helps show where Máté Vizer may publish in the future.
Co-authors
The 22 scholars most cited alongside Máté Vizer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 60 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 31 | |
| 2 | 2015 | 27 | |
| 3 | 2019 | 26 | |
| 4 | 2019 | 25 | |
| 5 | 2017 | 23 | |
| 6 | 2018 | 15 | |
| 7 | 2019 | 15 | |
| 8 | 2016 | 10 | |
| 9 | 2022 | 10 | |
| 10 | 2017 | 7 | |
| 11 | 2018 | 7 | |
| 12 | 2014 | 6 | |
| 13 | 2015 | 6 | |
| 14 | 2018 | 6 | |
| 15 | Geometry of Permutation Limits | 2019 | 6 |
| 16 | 2020 | 6 | |
| 17 | 2018 | 5 | |
| 18 | 2020 | 5 | |
| 19 | 2021 | 5 | |
| 20 | 2015 | 4 |
About Máté Vizer
Máté Vizer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Mathematical Physics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 60 papers that have together received 303 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (35 papers), Advanced Combinatorial Mathematics (15 papers), Advanced Graph Theory Research (13 papers), Complexity and Algorithms in Graphs (9 papers), Stochastic processes and statistical mechanics (3 papers), Graph Labeling and Dimension Problems (2 papers), Optimization and Search Problems (2 papers) and Mathematical Analysis and Transform Methods (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (180 citations), Computational Theory and Mathematics (120 citations), Computer Graphics and Computer-Aided Design (12 citations), Geometry and Topology (10 citations) and Algebra and Number Theory (4 citations). Máté Vizer has collaborated with scholars based in Hungary, Switzerland and Russia. Frequent co-authors include Dániel Gerbner, Abhishek Methuku, Balázs Patkós, Ervin Győri, Csilla Bujtás, Źsolt Tuza, Balázs Keszegh, Boštjan Brešar, Sandi Klavžar and Eyal Ackerman. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, The Electronic Journal of Combinatorics, European Journal of Combinatorics 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.