Máté Vizer

469 total citations
34 papers, 183 citations indexed

About

Máté Vizer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Máté Vizer has authored 34 papers receiving a total of 183 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 23 papers in Discrete Mathematics and Combinatorics and 16 papers in Geometry and Topology. Recurrent topics in Máté Vizer's work include Limits and Structures in Graph Theory (22 papers), Advanced Graph Theory Research (20 papers) and Graph theory and applications (9 papers). Máté Vizer is often cited by papers focused on Limits and Structures in Graph Theory (22 papers), Advanced Graph Theory Research (20 papers) and Graph theory and applications (9 papers). Máté Vizer collaborates with scholars based in Hungary, Switzerland and Czechia. Máté Vizer's co-authors include Dániel Gerbner, Abhishek Methuku, Balázs Patkós, Ervin Győri, Csilla Bujtás, Sandi Klavžar, Źsolt Tuza, Boštjan Brešar, Zoltán Füredi and Balázs Keszegh and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Máté Vizer

29 papers receiving 177 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Máté Vizer Hungary	8	144	108	78	20	19	34	183
Tom Sanders United Kingdom	9	75 0.5×	143 1.3×	69 0.9×	9 0.5×	28 1.5×	24	183
Juanjo Rué Spain	7	65 0.5×	84 0.8×	53 0.7×	6 0.3×	56 2.9×	41	148
Robert Šámal Czechia	7	133 0.9×	98 0.9×	66 0.8×	3 0.1×	8 0.4×	34	165
Julia Böttcher United Kingdom	8	143 1.0×	153 1.4×	76 1.0×	2 0.1×	11 0.6×	33	186
Tamar Ziegler Israel	7	58 0.4×	198 1.8×	103 1.3×	8 0.4×	64 3.4×	16	247
Tim Römer Germany	12	131 0.9×	94 0.9×	247 3.2×	5 0.3×	27 1.4×	42	316
David Saxton Brazil	6	140 1.0×	164 1.5×	104 1.3×	3 0.1×	7 0.4×	10	182
Nathan Lemons Hungary	9	124 0.9×	156 1.4×	102 1.3×	4 0.2×	5 0.3×	19	184
Renling Jin United States	7	85 0.6×	66 0.6×	125 1.6×	11 0.6×	105 5.5×	37	168
Yury Person Germany	10	238 1.7×	276 2.6×	169 2.2×	4 0.2×	13 0.7×	40	304

Countries citing papers authored by Máté Vizer

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Máté Vizer

This figure shows the co-authorship network connecting the top 25 collaborators of Máté Vizer. A scholar is included among the top collaborators of Máté Vizer 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 Máté Vizer. Máté Vizer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Gerbner, Dániel, et al.. (2023). Turán problems for edge-ordered graphs. Journal of Combinatorial Theory Series B. 160. 66–113. 4 indexed citations

Patkós, Balázs, Miloš Stojaković, & Máté Vizer. (2023). The constructor-blocker game. Applicable Analysis and Discrete Mathematics. 18(1). 193–214.

Patkós, Balázs, Źsolt Tuza, & Máté Vizer. (2023). Vector sum-intersection theorems. Discrete Mathematics. 346(10). 113506–113506.

Vizer, Máté, et al.. (2023). Improved Lower Bounds for Multiplicative Square-Free Sequences. The Electronic Journal of Combinatorics. 30(4). 1 indexed citations

Vizer, Máté, et al.. (2022). Fuglede’s Conjecture Holds for Cyclic Groups of Order pqrs. Journal of Fourier Analysis and Applications. 28(5). 9 indexed citations

Brešar, Boštjan, Csilla Bujtás, Sandi Klavžar, et al.. (2021). On Grundy Total Domination Number in Product Graphs. SHILAP Revista de lepidopterología. 3 indexed citations

Vizer, Máté, et al.. (2020). On the discrete Fuglede and Pompeiu problems. ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University). 14 indexed citations

Gerbner, Dániel, et al.. (2019). Edge ordered Turán problems. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 88(3). 717–722. 1 indexed citations

Gerbner, Dániel, Abhishek Methuku, & Máté Vizer. (2019). Asymptotics for the Turán number of Berge-K2,. Journal of Combinatorial Theory Series B. 137. 264–290. 16 indexed citations

10.

Vizer, Máté, et al.. (2019). Edge-ordered Ramsey numbers. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 88(3). 409–414. 2 indexed citations

11.

Gerbner, Dániel, Abhishek Methuku, & Máté Vizer. (2019). Generalized Turán problems for disjoint copies of graphs. Discrete Mathematics. 342(11). 3130–3141. 24 indexed citations

12.

Győri, Ervin, et al.. (2018). On the Turán number of some ordered even cycles. European Journal of Combinatorics. 73. 81–88. 3 indexed citations

13.

Gerbner, Dániel & Máté Vizer. (2018). Smart elements in combinatorial group testing problems. Journal of Combinatorial Optimization. 35(4). 1042–1060.

14.

Gerbner, Dániel, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, & Máté Vizer. (2018). An improvement on the maximum number of ‐dominating independent sets. Journal of Graph Theory. 91(1). 88–97. 3 indexed citations

15.

Gerbner, Dániel, Balázs Patkós, & Máté Vizer. (2018). Forbidden Subposet Problems for Traces of Set Families. The Electronic Journal of Combinatorics. 25(3). 3 indexed citations

16.

Brešar, Boštjan, Csilla Bujtás, Sandi Klavžar, et al.. (2017). Grundy dominating sequences and zero forcing sets. Discrete Optimization. 26. 66–77. 14 indexed citations

17.

Brešar, Boštjan, Csilla Bujtás, Sandi Klavžar, et al.. (2016). Dominating Sequences in Grid-Like and Toroidal Graphs. The Electronic Journal of Combinatorics. 23(4). 8 indexed citations

18.

Füredi, Zoltán, Dániel Gerbner, & Máté Vizer. (2015). A discrete isodiametric result: The Erdős–Ko–Rado theorem for multisets. European Journal of Combinatorics. 48. 224–233. 4 indexed citations

19.

Patkós, Balázs & Máté Vizer. (2014). Game saturation of intersecting families. Open Mathematics. 12(9). 4 indexed citations

20.

Ferber, Asaf, et al.. (2013). The Biased Odd Cycle Game. The Electronic Journal of Combinatorics. 20(2). 1 indexed citations

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.

Explore authors with similar magnitude of impact