Máté Vizer - RankMe

74 papers A* 1A 1Journal 72

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Generalized Trifference Problem. IEEE Trans. Inf. Theory Anurag Bishnoi, Bartlomiej Kielak, Benedek Kovács, Zoltán Lóránt Nagy, Gábor Somlai, Máté Vizer, Zeyu Zheng
2025	J	`jnl`	Edge mappings of graphs: Turán type parameters. Eur. J. Comb. Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2025	J	`jnl`	Generalized saturation game. Discret. Appl. Math. Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer
2025	J	`jnl`	The generalized trifference problem. CoRR Anurag Bishnoi, Bartlomiej Kielak, Benedek Kovács, Zoltán Lóránt Nagy, Gábor Somlai, Máté Vizer, Zeyu Zheng
2025	J	`jnl`	The robust chromatic number of certain graph classes. Discuss. Math. Graph Theory Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024	J	`jnl`	Counting connected partitions of graphs. J. Graph Theory Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024	J	`jnl`	Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. Balázs Patkós, Zsolt Tuza, Máté Vizer
2024	J	`jnl`	Generalized saturation game. CoRR Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer
2024	J	`jnl`	Some exact results for regular Turán problems for all large orders. Eur. J. Comb. Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024	J	`jnl`	Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer
2024	J	`jnl`	The Robust Chromatic Number of Graphs. Graphs Comb. Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer
2023	J	`jnl`	A plurality problem with three colors and query size three. Discret. Math. Dániel Gerbner, Dániel Lenger, Máté Vizer
2023	J	`jnl`	Improved Lower Bounds for Multiplicative Square-Free Sequences. Electron. J. Comb. Péter Pál Pach, Máté Vizer
2023	J	`jnl`	On graphs that contain exactly Discret. Appl. Math. Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2023	J	`jnl`	Turán problems for edge-ordered graphs. J. Comb. Theory B Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
2023	J	`jnl`	Vector sum-intersection theorems. Discret. Math. Balázs Patkós, Zsolt Tuza, Máté Vizer
2022	J	`jnl`	Forbidden subposet problems in the grid. Discret. Math. Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2022	J	`jnl`	On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. SIAM J. Discret. Math. Martin Balko, Máté Vizer
2022	J	`jnl`	On saturation of Berge hypergraphs. Eur. J. Comb. Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022	J	`jnl`	Rainbow Ramsey Problems for the Boolean Lattice. Order Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2022	J	`jnl`	Saturation problems with regularity constraints. Discret. Math. Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022	J	`jnl`	Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022	J	`jnl`	Unified approach to the generalized Turán problem and supersaturation. Discret. Math. Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer
2021	J	`jnl`	Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2021	J	`jnl`	On Grundy total domination number in product graphs. Discuss. Math. Graph Theory Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer
2021	J	`jnl`	On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. Dániel Gerbner, Máté Vizer
2021	J	`jnl`	On the maximum number of copies of H in graphs with given size and order. J. Graph Theory Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2021	J	`jnl`	Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. Electron. J. Comb. Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2020	J	`jnl`	Edge-ordered Ramsey numbers. Eur. J. Comb. Martin Balko, Máté Vizer
2020	J	`jnl`	Generalized Turán problems for even cycles. J. Comb. Theory B Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
2020	J	`jnl`	On clique coverings of complete multipartite graphs. Discret. Appl. Math. Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer
2020	J	`jnl`	Preface: 2nd Russian-Hungarian Combinatorial Workshop. Discret. Appl. Math. Gyula O. H. Katona, Andrei M. Raigorodskii, Máté Vizer
2020	J	`jnl`	Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer
2020	J	`jnl`	Rounds in a combinatorial search problem. Discret. Appl. Math. Dániel Gerbner, Máté Vizer
2020	J	`jnl`	Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. Máté Vizer, Dániel Gerbner
2020	J	`jnl`	t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019	J	`jnl`	Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2019	J	`jnl`	An improvement on the maximum number of k?dominating independent sets. J. Graph Theory Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer
2019	J	`jnl`	Asymptotics for the Turán number of Berge- J. Comb. Theory B Dániel Gerbner, Abhishek Methuku, Máté Vizer
2019	J	`jnl`	Domination game on uniform hypergraphs. Discret. Appl. Math. Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2019	J	`jnl`	Forbidding Rank-Preserving Copies of a Poset. Order Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019	J	`jnl`	Generalized Turán problems for disjoint copies of graphs. Discret. Math. Dániel Gerbner, Abhishek Methuku, Máté Vizer
2019	J	`jnl`	Geometry of Permutation Limits. Comb. Mustazee Rahman, Bálint Virág, Máté Vizer
2019	J	`jnl`	Majority problems of large query size. Discret. Appl. Math. Dániel Gerbner, Máté Vizer
2019	J	`jnl`	On the Number of Containments in P-free Families. Graphs Comb. Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019	J	`jnl`	Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2018	J	`jnl`	Correlation Bounds for Distant Parts of Factor of IID Processes. Comb. Probab. Comput. Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer
2018	J	`jnl`	Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. Dániel Gerbner, Balázs Patkós, Máté Vizer
2018	J	`jnl`	Line Percolation in Finite Projective Planes. SIAM J. Discret. Math. Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer
2018	J	`jnl`	On the Turán number of some ordered even cycles. Eur. J. Comb. Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
2018	J	`jnl`	On the maximum size of connected hypergraphs without a path of given length. Discret. Math. Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer
2018	J	`jnl`	On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. Eyal Ackerman, Balázs Keszegh, Máté Vizer
2018	J	`jnl`	Smart elements in combinatorial group testing problems. J. Comb. Optim. Dániel Gerbner, Máté Vizer
2017	J	`jnl`	A plurality problem with three colors and query size three. CoRR Dániel Gerbner, Dániel Lenger, Máté Vizer
2017	J	`jnl`	Coloring Points with Respect to Squares. Discret. Comput. Geom. Eyal Ackerman, Balázs Keszegh, Máté Vizer
2017	J	`jnl`	Conscious and controlling elements in combinatorial group testing problems with more defectives. CoRR Dániel Gerbner, Máté Vizer
2017	J	`jnl`	Conscious and controlling elements in combinatorial group testing problems. CoRR Dániel Gerbner, Máté Vizer
2017	J	`jnl`	Finding a non-minority ball with majority answers. Discret. Appl. Math. Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2017	J	`jnl`	Grundy dominating sequences and zero forcing sets. Discret. Optim. Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
2017	J	`jnl`	The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2016	J	`jnl`	A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. Kristóf Bérczi, Attila Bernáth, Máté Vizer
2016	J	`jnl`	A note on tilted Sperner families with patterns. Discret. Math. Dániel Gerbner, Máté Vizer
2016	A*	`conf`	Coloring Points with Respect to Squares. SoCG Eyal Ackerman, Balázs Keszegh, Máté Vizer
2016	J	`jnl`	Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
2016	A	`conf`	On the Size of Planarly Connected Crossing Graphs. GD Eyal Ackerman, Balázs Keszegh, Máté Vizer
2015	J	`jnl`	A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. Eur. J. Comb. Zoltán Füredi, Dániel Gerbner, Máté Vizer
2015	J	`jnl`	A note on $\mathtt{V}$-free $2$-matchings. CoRR Kristóf Bérczi, Attila Bernáth, Máté Vizer
2015	J	`jnl`	Finding a majority ball with majority answers. Electron. Notes Discret. Math. Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
2015	J	`jnl`	Identifying codes and searching with balls in graphs. Discret. Appl. Math. Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer
2015	J	`jnl`	On the size of planarly connected crossing graphs. CoRR Eyal Ackerman, Balázs Keszegh, Máté Vizer
2015	J	`jnl`	Regular Graphs are Antimagic. Electron. J. Comb. Kristóf Bérczi, Attila Bernáth, Máté Vizer
2015	J	`jnl`	Regular graphs are antimagic. CoRR Kristóf Bérczi, Attila Bernáth, Máté Vizer
2013	J	`jnl`	On the ratio of maximum and minimum degree in maximal intersecting families. Discret. Math. Zoltán Lóránt Nagy, Lale özkahya, Balázs Patkós, Máté Vizer
2013	J	`jnl`	The Biased Odd Cycle Game. Electron. J. Comb. Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer