Dániel T. Nagy

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 25

Top Topics

Boolean Functions

Redescription Mining

Query Complexity

Top Venues

SIAM J. Discret. Math.

Publications

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer
Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118 (2024)
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
Query complexity of Boolean functions on the middle slice of the cube. CoRR (2023)
Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
The extensible No-Three-In-Line problem. Eur. J. Comb. 114 (2023)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
Turán problems for edge-ordered graphs. J. Comb. Theory, Ser. B 160 (2023)
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
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Rainbow Ramsey Problems for the Boolean Lattice. Order 39 (3) (2022)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Forbidden subposet problems in the grid. Discret. Math. 345 (3) (2022)
József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós
On Generalized Turán Results in Height Two Posets. SIAM J. Discret. Math. 36 (2) (2022)
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
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288 (2021)
Dániel T. Nagy, Balázs Patkós
On L-Close Sperner Systems. Graphs Comb. 37 (3) (2021)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. Electron. J. Comb. 28 (1) (2021)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96 (1) (2021)
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35 (2) (2021)
Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy
Triangle areas in line arrangements. Discret. Math. 343 (12) (2020)
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao
Set systems related to a house allocation problem. Discret. Math. 343 (7) (2020)
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR (2020)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34 (3) (2020)
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
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
On the Number of Containments in P-free Families. Graphs Comb. 35 (6) (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Forbidding Rank-Preserving Copies of a Poset. Order 36 (3) (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. 26 (2) (2019)
Dániel T. Nagy
Forbidden subposet problems with size restrictions. J. Comb. Theory, Ser. A 155 (2018)
Dániel T. Nagy
On the Number of 4-Edge Paths in Graphs With Given Edge Density. Comb. Probab. Comput. 26 (3) (2017)
Gyula O. H. Katona, Dániel T. Nagy
Incomparable Copies of a Poset in the Boolean Lattice. Order 32 (3) (2015)
Gyula O. H. Katona, Dániel T. Nagy
Union-Intersecting Set Systems. Graphs Comb. 31 (5) (2015)
Peter Burcsi, Dániel T. Nagy
The method of double chains for largest families with excluded subposets. Electron. J. Graph Theory Appl. 1 (1) (2013)