Solution of a Problem of A. Ehrenfeucht and J. Mycielski. - Gyula O. H. Katona (J. Comb. Theory A, 1974)

Huffman codes and self-information. - Gyula O. H. Katona; Tibor O. H. Nemetz (IEEE Trans. Inf. Theory, 1976)

Contributions to the geometry of hamming spaces. - Rudolf Ahlswede; Gyula O. H. Katona (Discret. Math., 1977)

Obituary. - Gyula O. H. Katona (J. Comb. Theory B, 1979)

On the number of maximal dependencies in a data base relation of fixed order. - A. Békéssy; János Demetrovics; László Hannák; Peter Frankl; Gyula O. H. Katona (Discret. Math., 1980)

Extremal Combinatorial Problems in Relational Data Base. - János Demetrovics; Gyula O. H. Katona (FCT, 1981)

Sums of Vectors and Turán's Problem for 3-graphs. - Gyula O. H. Katona (Eur. J. Comb., 1981)

Intersecting Sperner families and their convex hulls. - Péter L. Erdös; Peter Frankl; Gyula O. H. Katona (Comb., 1984)

Extremal hypergraph problems and convex hulls. - Péter L. Erdös; Peter Frankl; Gyula O. H. Katona (Comb., 1985)

Minimum matrix representation of closure operations. - János Demetrovics; Zoltán Füredi; Gyula O. H. Katona (Discret. Appl. Math., 1985)

Polytopes Determined by Hypergraph Classes. - Peter Frankl; Gyula O. H. Katona (Eur. J. Comb., 1985)

Convex hulls of more-part Sperner families. - Péter L. Erdös; Gyula O. H. Katona (Graphs Comb., 1986)

All maximum 2-part Sperner families. - Péter L. Erdös; Gyula O. H. Katona (J. Comb. Theory A, 1986)

Extremal Combinatorial Problems of Database Models. - János Demetrovics; Gyula O. H. Katona (MFDBS, 1987)

On the Number of Databases and Closure Operations. - Gustav Burosch; János Demetrovics; Gyula O. H. Katona; Daniel J. Kleitman; Alexander A. Sapozhenko (Theor. Comput. Sci., 1991)

Combinatorial and Algebraic Results for Database Relations. - Gyula O. H. Katona (ICDT, 1992)

Partial Dependencies in Relational Databases and their Realization. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós (Discret. Appl. Math., 1992)

The Characterization of Branching Dependencies. - János Demetrovics; Gyula O. H. Katona; Attila Sali (Discret. Appl. Math., 1992)

A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations. - János Demetrovics; Gyula O. H. Katona (Ann. Math. Artif. Intell., 1993)

The largest component in a random subgraph of the n-cycle. - Gyula O. H. Katona; Louis V. Quintas (Discret. Math., 1993)

Greedy Construction of Nearly Regular Graphs. - Gyula O. H. Katona; Ákos Seress (Eur. J. Comb., 1993)

Optimization of the reliability polynomial in presence of mediocre elements. - Gyula O. H. Katona; Wojbor A. Woyczynski (Networks, 1993)

The Average Length of Keys and Functional Dependencies in (Random) Databases. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós; Oleg Seleznjev; Bernhard Thalheim (ICDT, 1995)

Preface. - András Hajnal; Gyula O. H. Katona; Attila Sali (Discret. Math., 1996)

Extremal problems for finite sets and convex hulls - A survey. - Gyula O. H. Katona (Discret. Math., 1997)

A Simple Proof of a Theorem of Milner. - Gyula O. H. Katona (J. Comb. Theory A, 1998)

Asymptotic Properties of Keys and Functional Dependencies in Random Databases. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós; Oleg Seleznjev; Bernhard Thalheim (Theor. Comput. Sci., 1998)

Low Discrepancy Allocation of Two-Dimensional Data. - Richard P. Anstee; János Demetrovics; Gyula O. H. Katona; Attila Sali (FoIKS, 2000)

Error-Correcting Keys in Relational Databases. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós (FoIKS, 2000)

Semantics in Databases. - Leopoldo E. Bertossi; Gyula O. H. Katona; Klaus-Dieter Schewe; Bernhard Thalheim (Semantics in Databases, 2001)

Pairs of Disjoint q-element Subsets Far from Each Other. - Hikoe Enomoto; Gyula O. H. Katona (Electron. J. Comb., 2001)

Intersecting Balanced Families of Sets. - Adam Idzik; Gyula O. H. Katona; Rajiv Vohra (J. Comb. Theory A, 2001)

Functional Dependencies in Presence of Errors. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós (FoIKS, 2002)

On the average size of sets in intersecting Sperner families. - Christian Bey; Konrad Engel; Gyula O. H. Katona; Uwe Leck (Discret. Math., 2002)

A coding problem for pairs of subsets. - Gyula O. H. Katona (Electron. Notes Discret. Math., 2003)

Strong qualitative independence. - Gyula O. H. Katona (Discret. Appl. Math., 2004)

New type of coding problem motivated by database theory. - Gyula O. H. Katona; Attila Sali (Discret. Appl. Math., 2004)

Constructions via Hamiltonian Theorems. - Gyula O. H. Katona (Discret. Math., 2005)

Preface. - Jin Ho Kwak; Gyula O. H. Katona; Dan Archdeacon (Discret. Math., 2005)

Largest family without A union B subset of C intersection D. - Annalisa De Bonis; Gyula O. H. Katona; Konrad J. Swanepoel (J. Comb. Theory A, 2005)

Two-Part and k-Sperner Families: New Proofs Using Permutations. - Péter L. Erdös; Zoltán Füredi; Gyula O. H. Katona (SIAM J. Discret. Math., 2005)

On the Number of Independent Functional Dependencies. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós; Bernhard Thalheim (FoIKS, 2006)

Some Contributions to the Minimum Representation Problem of Key Systems. - Gyula O. H. Katona; Krisztián Tichler (FoIKS, 2006)

On the security of individual data. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós (Ann. Math. Artif. Intell., 2006)

2-Bases of Quadruples. - Zoltán Füredi; Gyula O. H. Katona (Comb. Probab. Comput., 2006)

Forbidden inclusion patterns in families of subsets. - Gyula O. H. Katona (Electron. Notes Discret. Math., 2006)

Largest Families Without an r -Fork. - Annalisa De Bonis; Gyula O. H. Katona (Order, 2007)

Random Geometric Identification. - Gyula O. H. Katona (FoIKS, 2008)

Functional dependencies distorted by errors. - János Demetrovics; Gyula O. H. Katona; Dezsö Miklós (Discret. Appl. Math., 2008)

No four subsets forming an N. - Jerrold R. Griggs; Gyula O. H. Katona (J. Comb. Theory A, 2008)

Bounds on Maximal Families of Sets Not Containing Three Sets with A INTERSECTION B SUBSET OF C , A NOT A SUBSET OF B. - Teena Carroll; Gyula O. H. Katona (Order, 2008)

On the Distance of Databases. - Gyula O. H. Katona; Anita Keszler; Attila Sali (FoIKS, 2010)

Random Databases with Correlated Data. - Gyula O. H. Katona (Conceptual Modelling and Its Theoretical Foundations, 2012)

Encoding Databases Satisfying a Given Set of Dependencies. - Gyula O. H. Katona; Krisztián Tichler (FoIKS, 2012)

On the distance of databases. - Gyula O. H. Katona; Attila Sali (Ann. Math. Artif. Intell., 2012)

Most Probably Intersecting Families of Subsets. - Gyula O. H. Katona; Gyula Y. Katona; Zsolt Katona (Comb. Probab. Comput., 2012)

Minimum average-case queries of q+1-ary search game with small sets. - Kun Meng; Chuang Lin 002; Wen An Liu; Yang Yang 004; Gyula O. H. Katona (Discret. Appl. Math., 2012)

Erdös-Ko-Rado from intersecting shadows. - Gyula O. H. Katona; Ákos Kisvölcsey (Discuss. Math. Graph Theory, 2012)

Memories on Shadows and Shadows of Memories. - Gyula O. H. Katona (The Mathematics of Paul Erdős II, 2013)

Search When the Lie Depends on the Target. - Gyula O. H. Katona; Krisztián Tichler (Information Theory, Combinatorics, and Search Theory, 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)

Sperner type theorems with excluded subposets. - Gyula O. H. Katona (Discret. Appl. Math., 2013)

Color the cycles. - Gyula O. H. Katona; Zsolt Tuza (Discret. Math., 2013)

Two-colorings with many monochromatic cliques in both colors. - Peter Frankl; Mitsuo Kato; Gyula O. H. Katona; Norihide Tokushige (J. Comb. Theory B, 2013)

A coding problem for pairs of subsets. - Béla Bollobás; Zoltán Füredi; Ida Kantor; Gyula O. H. Katona; Imre Leader (Geometry, Structure and Randomness in Combinatorics, 2014)

Union-Intersecting Set Systems. - Gyula O. H. Katona; Dániel T. Nagy (Graphs Comb., 2015)

Incomparable Copies of a Poset in the Boolean Lattice. - Gyula O. H. Katona; Dániel T. Nagy (Order, 2015)

Preface: Levon Khachatrian's legacy in extremal combinatorics. - Zoltán Füredi; Gyula O. H. Katona (Discret. Appl. Math., 2017)

Around the Complete Intersection Theorem. - Gyula O. H. Katona (Discret. Appl. Math., 2017)

Preface. - Deepa Sinha; Thomas Zaslavsky; Gyula O. H. Katona; Tao-Ming Wang (Electron. Notes Discret. Math., 2017)

Results on the Wiener profile. - Morteza Faghani; Gyula O. H. Katona (AKCE Int. J. Graphs Comb., 2018)

The domination number of the graph defined by two levels of the n-cube. - Leila Badakhshian; Gyula O. H. Katona; Zsolt Tuza (Discret. Appl. Math., 2019)

Preface: 2nd Russian-Hungarian Combinatorial Workshop. - Gyula O. H. Katona; Andrei M. Raigorodskii; Máté Vizer (Discret. Appl. Math., 2020)

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)

The number of triangles is more when they have no common vertex. - Chuanqi Xiao; Gyula O. H. Katona (Discret. Math., 2021)

The domination number of the graph defined by two levels of the n-cube, II. - József Balogh; Gyula O. H. Katona; William Linz; Zsolt Tuza (Eur. J. Comb., 2021)

On strengthenings of the intersecting shadow theorem. - Peter Frankl; Gyula O. H. Katona (J. Comb. Theory A, 2021)

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". - Alexander Barg; Lara Dolecek; Ryan Gabrys; Gyula O. H. Katona; János Körner; Andrew McGregor 001; Olgica Milenkovic; Sihem Mesnager; Gilles Zémor (IEEE Trans. Inf. Theory, 2021)

A generalization of the independence number. - Gyula O. H. Katona (Discret. Appl. Math., 2022)

The Turán number of the square of a path. - Chuanqi Xiao; Gyula O. H. Katona; Jimeng Xiao; Oscar Zamora 001 (Discret. Appl. Math., 2022)

Largest Family Without a Pair of Posets on Consecutive Levels of the Boolean Lattice. - Gyula O. H. Katona; Jimeng Xiao (Order, 2022)

Extremal graphs without long paths and large cliques. - Gyula O. H. Katona; Chuanqi Xiao (Eur. J. Comb., 2024)

Shadow Minimization Boolean Function Reconstruction. - Levon Aslanyan; Gyula O. H. Katona; Hasmik Sahakyan (Informatica, 2024)

Study on Using Reinforcement Learning for the Monotone Boolean Reconstruction. - Hasmik Sahakyan; Gyula O. H. Katona; Levon Aslanyan (Informatica (Slovenia), 2024)

The number of disjoint pairs in families of k-element subsets. - Joanna Jasinska; Gyula O. H. Katona (Discuss. Math. Graph Theory, 2025)

Forbidden Subposets in the Cycle Poset. - Aysan Behnia; Gholam Hossein Fath-Tabar; Gyula O. H. Katona (Order, 2025)