Separating Partition Systems and Locally Different Sequences. - János Körner; Gábor Simonyi (SIAM J. Discret. Math., 1988)

Coding for write-unidirectional memories and conflict resolution. - Gérard D. Cohen; Gábor Simonyi (Discret. Appl. Math., 1989)

On write-unidirectional memory codes. - Gábor Simonyi (IEEE Trans. Inf. Theory, 1989)

Entropy splitting for antiblocking corners and perfect graphs. - Imre Csiszár; János Körner; László Lovász 001; Katalin Marton; Gábor Simonyi (Comb., 1990)

Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory. - Rudolf Ahlswede; Gábor Simonyi (IEEE Trans. Inf. Theory, 1991)

Perfect couples of graphs. - János Körner; Gábor Simonyi; Zsolt Tuza (Comb., 1992)

A Sperner-Type Theorem and Qualitative Independence. - János Körner; Gábor Simonyi (J. Comb. Theory A, 1992)

Graph entropy: A survey. - Gábor Simonyi (Combinatorial Optimization, 1993)

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. - Rudolf Ahlswede; Gábor Simonyi (Discret. Math., 1994)

Different capacities of a digraph. - Anna Galluccio; Luisa Gargano; János Körner; Gábor Simonyi (Graphs Comb., 1994)

Entropy Splitting Hypergraphs. - Gábor Simonyi (J. Comb. Theory B, 1996)

On the minimum number of edges giving maximum oriented chromatic number. - Alexandr V. Kostochka; Tomasz Luczak 001; Gábor Simonyi; Éric Sopena (Contemporary Trends in Discrete Mathematics, 1997)

Oriented list colouring of undirected graphs. - Attila Sali; Gábor Simonyi (Contemporary Trends in Discrete Mathematics, 1997)

Recovering Set Systems and Graph Entropy. - Attila Sali; Gábor Simonyi (Comb. Probab. Comput., 1997)

Intersecting set systems and graphic matroids, . - Attila Sali; Gábor Simonyi (Discret. Math., 1998)

Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities. - Attila Sali; Gábor Simonyi (Eur. J. Comb., 1999)

Graph Pairs and their Entropies: Modularity Problems. - János Körner; Gábor Simonyi (Comb., 2000)

Perfection, Imperfection, and Graph Entropy. - Gábor Simonyi (Electron. Notes Discret. Math., 2000)

On Witsenhausen's zero-error rate for multiple sources. - Gábor Simonyi (IEEE Trans. Inf. Theory, 2003)

Edge colorings of complete graphs without tricolored triangles. - András Gyárfás; Gábor Simonyi (J. Graph Theory, 2004)

Connected matchings and Hadwiger's conjecture. - Zoltán Füredi; András Gyárfás; Gábor Simonyi (Comb. Probab. Comput., 2005)

Local chromatic number and Sperner capacity. - János Körner; Concetta Pilotto; Gábor Simonyi (J. Comb. Theory B, 2005)

Local Chromatic Number, KY Fan's Theorem, And Circular Colorings. - Gábor Simonyi; Gábor Tardos (Comb., 2006)

Asymptotic values of the Hall-ratio for graph powers. - Gábor Simonyi (Discret. Math., 2006)

Colorful subgraphs in Kneser-like graphs. - Gábor Simonyi; Gábor Tardos (Eur. J. Comb., 2007)

Necklace Bisection with One Cut Less than Needed. - Gábor Simonyi (Electron. J. Comb., 2008)

Graph-Different Permutations. - János Körner; Claudia Malvenuto; Gábor Simonyi (SIAM J. Discret. Math., 2008)

On types of growth for graph-different permutations. - János Körner; Gábor Simonyi; Blerina Sinaimeri (J. Comb. Theory A, 2009)

On topological relaxations of chromatic conjectures. - Gábor Simonyi; Ambrus Zsbán (Eur. J. Comb., 2010)

Permutation Capacities of Families of Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (SIAM J. Discret. Math., 2010)

Permutation Capacities and Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (Electron. Notes Discret. Math., 2011)

Families of Very Different Paths. - János Körner; Silvia Messuti; Gábor Simonyi (Electron. Notes Discret. Math., 2011)

On directed local chromatic number, shift graphs, and Borsuk-like graphs. - Gábor Simonyi; Gábor Tardos (J. Graph Theory, 2011)

Gallai colorings and domination in multipartite digraphs. - András Gyárfás; Gábor Simonyi; Ágnes Tóth (J. Graph Theory, 2012)

Families of Graph-different Hamilton Paths. - János Körner; Silvia Messuti; Gábor Simonyi (SIAM J. Discret. Math., 2012)

Local chromatic number of quadrangulations of surfaces. - Bojan Mohar; Gábor Simonyi; Gábor Tardos (Comb., 2013)

Colourful Theorems and Indices of Homomorphism Complexes. - Gábor Simonyi; Claude Tardif; Ambrus Zsbán (Electron. J. Comb., 2013)

A generalization of Witsenhausen's zero-error rate for directed graphs. - Gábor Simonyi; Ágnes Tóth (ISIT, 2014)

Relations between the Local Chromatic Number and Its Directed Version. - Gábor Simonyi; Gábor Tardos; Ambrus Zsbán (J. Graph Theory, 2015)

Dilworth Rate: A Generalization of Witsenhausen's Zero-Error Rate for Directed Graphs. - Gábor Simonyi; Ágnes Tóth (IEEE Trans. Inf. Theory, 2015)

Orientations Making k-Cycles Cyclic. - Zita Helle; Gábor Simonyi (Graphs Comb., 2016)

On Colorful Edge Triples in Edge-Colored Complete Graphs. - Gábor Simonyi (Graphs Comb., 2020)

Shannon Capacity and the Categorical Product. - Gábor Simonyi (Electron. J. Comb., 2021)

Partitioning Transitive Tournaments into Isomorphic Digraphs. - Attila Sali; Gábor Simonyi; Gábor Tardos (Order, 2021)

Codes with structured Hamming distance in graph families. - Anna Gujgiczer; János Körner; Gábor Simonyi (CoRR, 2022)

On multichromatic numbers of widely colorable graphs. - Anna Gujgiczer; Gábor Simonyi (J. Graph Theory, 2022)

Structured Codes of Graphs. - Noga Alon; Anna Gujgiczer; János Körner; Aleksa Milojevic; Gábor Simonyi (SIAM J. Discret. Math., 2023)

Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number. - Anna Gujgiczer; Gábor Simonyi (Graphs Comb., 2024)

Shannon Capacity, Lovász Theta Number and the Mycielski Construction. - Bence Csonka; Gábor Simonyi (IEEE Trans. Inf. Theory, 2024)