Chain Intersecting Families. - Attila Bernáth; Dániel Gerbner (Graphs Comb., 2007)

l-Chain Profile Vectors. - Dániel Gerbner; Balázs Patkós (SIAM J. Discret. Math., 2008)

Profile vectors in the lattice of subspaces. - Dániel Gerbner; Balázs Patkós (Discret. Math., 2009)

Extremal Combinatorial Problems - Dániel Gerbner (2009)

Finding the maximum and minimum elements with one lie. - Dániel Gerbner; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2010)

Polychromatic colorings of arbitrary rectangular partitions. - Dániel Gerbner; Balázs Keszegh; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós (Discret. Math., 2010)

Path-search in the pyramid and in other graphs - Dániel Gerbner; Balázs Keszegh (CoRR, 2011)

Two-Part Set Systems. - Péter L. Erdös; Dániel Gerbner; Nathan Lemons; Dhruv Mubayi; Cory Palmer; Balázs Patkós (Electron. J. Comb., 2012)

Search for the end of a path in the d-dimensional grid and in other graphs - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (CoRR, 2012)

Generalizations of the tree packing conjecture. - Dániel Gerbner; Balázs Keszegh; Cory Palmer (Discuss. Math. Graph Theory, 2012)

Almost Intersecting Families of Sets. - Dániel Gerbner; Nathan Lemons; Cory Palmer; Balázs Patkós; Vajk Szécsi (SIAM J. Discret. Math., 2012)

Density-Based Group Testing. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (Information Theory, Combinatorics, and Search Theory, 2013)

Profile polytopes of some classes of families. - Dániel Gerbner (Comb., 2013)

Separating families of convex sets. - Dániel Gerbner; Géza Tóth 001 (Comput. Geom., 2013)

Majority and plurality problems. - Dániel Gerbner; Gyula O. H. Katona; Dömötör Pálvölgyi; Balázs Patkós (Discret. Appl. Math., 2013)

The Magnus-Derek game in groups. - Dániel Gerbner (Discret. Math. Theor. Comput. Sci., 2013)

Saturating Sperner Families. - Dániel Gerbner; Balázs Keszegh; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós (Graphs Comb., 2013)

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. - Dániel Gerbner; Nathan Lemons; Cory Palmer; Dömötör Pálvölgyi; Balázs Patkós; Vajk Szécsi (Graphs Comb., 2013)

Partitioning 2-edge-colored graphs by monochromatic paths and cycles. - József Balogh; János Barát; Dániel Gerbner; András Gyárfás; Gábor N. Sárközy (Comb., 2014)

Edge-decomposition of Graphs into Copies of a Tree with Four Edges. - János Barát; Dániel Gerbner (Electron. J. Comb., 2014)

Covering Paths for Planar Point Sets. - Adrian Dumitrescu; Dániel Gerbner; Balázs Keszegh; Csaba D. Tóth (Discret. Comput. Geom., 2014)

Advantage in the discrete Voronoi game. - Dániel Gerbner; Viola Mészáros; Dömötör Pálvölgyi; Alexey Pokrovskiy; Günter Rote (J. Graph Algorithms Appl., 2014)

A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. - Zoltán Füredi; Dániel Gerbner; Máté Vizer (Eur. J. Comb., 2015)

Finding a majority ball with majority answers. - Máté Vizer; Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Electron. Notes Discret. Math., 2015)

A note on tilted Sperner families with patterns. - Dániel Gerbner; Máté Vizer (Discret. Math., 2016)

Topological orderings of weighted directed acyclic graphs. - Dániel Gerbner; Balázs Keszegh; Cory Palmer; Dömötör Pálvölgyi (Inf. Process. Lett., 2016)

Search for the end of a path in the d-dimensional grid and in other graphs. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Günter Rote; Gábor Wiener (Ars Math. Contemp., 2017)

Conscious and controlling elements in combinatorial group testing problems. - Dániel Gerbner; Máté Vizer (CoRR, 2017)

Conscious and controlling elements in combinatorial group testing problems with more defectives. - Dániel Gerbner; Máté Vizer (CoRR, 2017)

Finding a non-minority ball with majority answers. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2017)

Intersecting P-free families. - Dániel Gerbner; Abhishek Methuku; Casey Tompkins (J. Comb. Theory A, 2017)

Extremal Results for Berge Hypergraphs. - Dániel Gerbner; Cory Palmer (SIAM J. Discret. Math., 2017)

Forbidden Subposet Problems for Traces of Set Families. - Dániel Gerbner; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2018)

Identifying defective sets using queries of small size. - Fabrício Benevides; Dániel Gerbner; Cory Palmer; Dominik K. Vu (Discret. Math., 2018)

Smart elements in combinatorial group testing problems. - Dániel Gerbner; Máté Vizer (J. Comb. Optim., 2018)

Line Percolation in Finite Projective Planes. - Dániel Gerbner; Balázs Keszegh; Gábor Mészáros; Balázs Patkós; Máté Vizer (SIAM J. Discret. Math., 2018)

On the Number of Cycles in a Graph with Restricted Cycle Lengths. - Dániel Gerbner; Balázs Keszegh; Cory Palmer; Balázs Patkós (SIAM J. Discret. Math., 2018)

On the Weight of Berge-F-Free Hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Cory Palmer (Electron. J. Comb., 2019)

Stability Results for Vertex Turán Problems in Kneser Graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2019)

Between the deterministic and non-deterministic query complexity. - Dániel Gerbner (CoRR, 2019)

Majority problems of large query size. - Dániel Gerbner; Máté Vizer (Discret. Appl. Math., 2019)

Generalized Turán problems for disjoint copies of graphs. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Math., 2019)

Linearity of saturation for Berge hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Michael Tait (Eur. J. Comb., 2019)

Counting copies of a fixed subgraph in F-free graphs. - Dániel Gerbner; Cory Palmer (Eur. J. Comb., 2019)

On the Number of Containments in P-free Families. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Graphs Comb., 2019)

Asymptotics for the Turán number of Berge-K2, t. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2019)

An improvement on the maximum number of k?dominating independent sets. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Balázs Patkós; Máté Vizer (J. Graph Theory, 2019)

Forbidding Rank-Preserving Copies of a Poset. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2019)

Smart elements in combinatorial group testing problems with more defectives. - Máté Vizer; Dániel Gerbner (Art Discret. Appl. Math., 2020)

On Berge-Ramsey Problems. - Dániel Gerbner (Electron. J. Comb., 2020)

Finding non-minority balls with majority and plurality queries. - Huilan Chang; Dániel Gerbner; Balázs Patkós (Discret. Appl. Math., 2020)

On clique coverings of complete multipartite graphs. - Akbar Davoodi; Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Appl. Math., 2020)

Rounds in a combinatorial search problem. - Dániel Gerbner; Máté Vizer (Discret. Appl. Math., 2020)

Set systems related to a house allocation problem. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Casey Tompkins; Chuanqi Xiao (Discret. Math., 2020)

General lemmas for Berge-Turán hypergraph problems. - Dániel Gerbner; Abhishek Methuku; Cory Palmer (Eur. J. Comb., 2020)

Generalized Turán problems for even cycles. - Dániel Gerbner; Ervin Györi; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2020)

Generalized Forbidden Subposet Problems. - Dániel Gerbner; Balázs Keszegh; Balázs Patkós (Order, 2020)

Ramsey Problems for Berge Hypergraphs. - Dániel Gerbner; Abhishek Methuku; Gholam Reza Omidi; Máté Vizer (SIAM J. Discret. Math., 2020)

t-Wise Berge and t-Heavy Hypergraphs. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (SIAM J. Discret. Math., 2020)

A note on the Turán number of a Berge odd cycle. - Dániel Gerbner (Australas. J Comb., 2021)

Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2021)

Adaptive majority problems for restricted query graphs and for weighted sets. - 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 (Discret. Appl. Math., 2021)

On Turán-good graphs. - Dániel Gerbner (Discret. Math., 2021)

On non-adaptive majority problems of large query size. - Dániel Gerbner; Máté Vizer (Discret. Math. Theor. Comput. Sci., 2021)

A Note on Stability for Maximal F-Free Graphs. - Dániel Gerbner (Graphs Comb., 2021)

Hypergraphs without exponents. - Zoltán Füredi; Dániel Gerbner (J. Comb. Theory A, 2021)

On the maximum number of copies of H in graphs with given size and order. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (J. Graph Theory, 2021)

Generalized Rainbow Turán Numbers. - Dániel Gerbner; Tamás Mészáros 001; Abhishek Methuku; Cory Palmer (Electron. J. Comb., 2022)

Forbidden subposet problems in the grid. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Discret. Math., 2022)

Unified approach to the generalized Turán problem and supersaturation. - Dániel Gerbner; Zoltán Lóránt Nagy; Máté Vizer (Discret. Math., 2022)

Saturation problems with regularity constraints. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Math., 2022)

Singular Turán numbers and WORM-colorings. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discuss. Math. Graph Theory, 2022)

A note on the uniformity threshold for Berge hypergraphs. - Dániel Gerbner (Eur. J. Comb., 2022)

Some exact results for generalized Turán problems. - Dániel Gerbner; Cory Palmer (Eur. J. Comb., 2022)

On saturation of Berge hypergraphs. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2022)

Hypergraph Based Berge Hypergraphs. - Martin Balko; Dániel Gerbner; Dong Yeap Kang; Younjin Kim; Cory Palmer (Graphs Comb., 2022)

Generalized Turán Problems for Complete Bipartite Graphs. - Dániel Gerbner; Balázs Patkós (Graphs Comb., 2022)

Rainbow Ramsey Problems for the Boolean Lattice. - Fei-Huang Chang; Dániel Gerbner; Wei-Tian Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2022)

The covering lemma and q-analogues of extremal set theory problems. - Dániel Gerbner (Ars Math. Contemp., 2023)

Generalized Turán problems for $K_{2,t}$. - Dániel Gerbner (Electron. J. Comb., 2023)

Some Exact Results for Non-Degenerate Generalized Turán Problems. - Dániel Gerbner (Electron. J. Comb., 2023)

A plurality problem with three colors and query size three. - Dániel Gerbner; Dániel Lenger; Máté Vizer (Discret. Math., 2023)

Generalized Turán problems for small graphs. - Dániel Gerbner (Discuss. Math. Graph Theory, 2023)

Turán problems for edge-ordered graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Gábor Tardos; Máté Vizer (J. Comb. Theory B, 2023)

Paths are Turán-good. - Dániel Gerbner (Graphs Comb., 2023)

Generalized Turán problems for double stars. - Dániel Gerbner (Discret. Math., 2023)

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. - 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 (Discret. Appl. Math., 2023)

The maximum number of triangles in Fk-free graphs. - Xiutao Zhu; Yaojun Chen; Dániel Gerbner; Ervin Györi; Hilal Hama Karim (Eur. J. Comb., 2023)

The Profile Polytope of Nontrivial Intersecting Families. - Dániel Gerbner (SIAM J. Discret. Math., 2023)

Directed Graphs Without Rainbow Stars. - Dániel Gerbner; Andrzej Grzesik; Cory Palmer; Magdalena Prorok (Electron. J. Comb., 2024)

On the extremal graphs in generalized Turán problems. - Dániel Gerbner (Discret. Math., 2024)

Generalized Turán results for disjoint cliques. - Dániel Gerbner (Discret. Math., 2024)

On weakly Turán-good graphs. - Dániel Gerbner (Discuss. Math. Graph Theory, 2024)

Stability of extremal connected hypergraphs avoiding Berge-paths. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Nika Salia; Máté Vizer (Eur. J. Comb., 2024)

On Turán problems with bounded matching number. - Dániel Gerbner (J. Graph Theory, 2024)

Stability from graph symmetrization arguments in generalized Turán problems. - Dániel Gerbner; Hilal Hama Karim (J. Graph Theory, 2024)

The Turán Number of Berge Book Hypergraphs. - Dániel Gerbner (SIAM J. Discret. Math., 2024)

Generalized Turán results for intersecting cliques. - Dániel Gerbner; Balázs Patkós (Discret. Math., 2024)

Some exact results for regular Turán problems for all large orders. - Dániel Gerbner; Balázs Patkós; Zsolt Tuza; Máté Vizer (Eur. J. Comb., 2024)

On Non-degenerate Berge-Turán Problems. - Dániel Gerbner (Graphs Comb., 2024)

On the number of A-transversals in hypergraphs. - János Barát; Dániel Gerbner; Anastasia Halfpap (Period. Math. Hung., 2024)

Query complexity of Boolean functions on the middle slice of the cube. - Dániel Gerbner; Balázs Keszegh; Dániel T. Nagy; Kartal Nagy; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2025)

Degree powers and number of stars in graphs with a forbidden broom. - Dániel Gerbner (Discret. Math., 2025)

On non-degenerate Turán problems for expansions. - Dániel Gerbner (Eur. J. Comb., 2025)

On degree powers and counting stars in F-free graphs. - Dániel Gerbner (Eur. J. Comb., 2025)

On hypergraph Turán problems with bounded matching number. - Dániel Gerbner; Casey Tompkins; Junpeng Zhou (Eur. J. Comb., 2025)

Cooperation in combinatorial search. - Dániel Gerbner; Balázs Keszegh; Kartal Nagy; Balázs Patkós; Gábor Wiener (Optim. Lett., 2025)