Gábor Simonyi

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 12

Top Topics

Computational Effort

Top Venues

J. Graph Theory

IEEE Trans. Inf. Theory

Publications

Anna Gujgiczer, Gábor Simonyi
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number. Graphs Comb. 40 (3) (2024)
Bence Csonka, Gábor Simonyi
Shannon capacity, Lovász theta number and the Mycielski construction. CoRR (2023)
Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi
Structured Codes of Graphs. SIAM J. Discret. Math. 37 (1) (2023)
Anna Gujgiczer, János Körner, Gábor Simonyi
Codes with structured Hamming distance in graph families. CoRR (2022)
Anna Gujgiczer, Gábor Simonyi
On multichromatic numbers of widely colorable graphs. J. Graph Theory 100 (2) (2022)
Gábor Simonyi
Shannon Capacity and the Categorical Product. Electron. J. Comb. 28 (1) (2021)
Attila Sali, Gábor Simonyi, Gábor Tardos
Partitioning Transitive Tournaments into Isomorphic Digraphs. Order 38 (2) (2021)
Gábor Simonyi
On Colorful Edge Triples in Edge-Colored Complete Graphs. Graphs Comb. 36 (6) (2020)
Gábor Simonyi
Shannon capacity and the categorical product. CoRR (2019)
Zita Helle, Gábor Simonyi
Orientations Making k-Cycles Cyclic. Graphs Comb. 32 (6) (2016)
Gábor Simonyi, Gábor Tardos, Ambrus Zsbán
Relations between the Local Chromatic Number and Its Directed Version. J. Graph Theory 79 (4) (2015)
Gábor Simonyi, Ágnes Tóth
Dilworth Rate: A Generalization of Witsenhausen's Zero-Error Rate for Directed Graphs. IEEE Trans. Inf. Theory 61 (2) (2015)
Gábor Simonyi, Ágnes Tóth
A generalization of Witsenhausen's zero-error rate for directed graphs. CoRR (2014)
Gábor Simonyi, Ágnes Tóth
A generalization of Witsenhausen's zero-error rate for directed graphs. ISIT (2014)
Gábor Simonyi, Claude Tardif, Ambrus Zsbán
Colourful Theorems and Indices of Homomorphism Complexes. Electron. J. Comb. 20 (1) (2013)
Bojan Mohar, Gábor Simonyi, Gábor Tardos
Local chromatic number of quadrangulations of surfaces. Comb. 33 (4) (2013)
András Gyárfás, Gábor Simonyi, Ágnes Tóth
Gallai colorings and domination in multipartite digraphs. J. Graph Theory 71 (3) (2012)
János Körner, Silvia Messuti, Gábor Simonyi
Families of Graph-different Hamilton Paths. SIAM J. Discret. Math. 26 (1) (2012)
Gábor Simonyi, Gábor Tardos
On directed local chromatic number, shift graphs, and Borsuk-like graphs. J. Graph Theory 66 (1) (2011)
János Körner, Silvia Messuti, Gábor Simonyi
Families of Very Different Paths. Electron. Notes Discret. Math. 38 (2011)
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
Permutation Capacities and Oriented Infinite Paths. Electron. Notes Discret. Math. 38 (2011)
János Körner, Silvia Messuti, Gábor Simonyi
Families of graph-different Hamilton paths CoRR (2011)
Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth
Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discret. Math. 24 (2) (2010)
Gábor Simonyi, Ambrus Zsbán
On topological relaxations of chromatic conjectures. Eur. J. Comb. 31 (8) (2010)
János Körner, Gábor Simonyi, Blerina Sinaimeri
On types of growth for graph-different permutations. J. Comb. Theory, Ser. A 116 (3) (2009)
Gábor Simonyi
Necklace Bisection with One Cut Less than Needed. Electron. J. Comb. 15 (1) (2008)
János Körner, Claudia Malvenuto, Gábor Simonyi
Graph-Different Permutations. SIAM J. Discret. Math. 22 (2) (2008)
János Körner, Gábor Simonyi, Blerina Sinaimeri
On types of growth for graph-different permutations CoRR (2007)
Gábor Simonyi, Gábor Tardos
Colorful subgraphs in Kneser-like graphs. Eur. J. Comb. 28 (8) (2007)
Gábor Simonyi, Gábor Tardos
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings. Comb. 26 (5) (2006)
Gábor Simonyi
Asymptotic values of the Hall-ratio for graph powers. Discret. Math. 306 (19-20) (2006)
János Körner, Concetta Pilotto, Gábor Simonyi
Local chromatic number and Sperner capacity. J. Comb. Theory, Ser. B 95 (1) (2005)
Zoltán Füredi, András Gyárfás, Gábor Simonyi
Connected matchings and Hadwiger's conjecture. Comb. Probab. Comput. 14 (3) (2005)
András Gyárfás, Gábor Simonyi
Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46 (3) (2004)
Gábor Simonyi
On Witsenhausen's zero-error rate for multiple sources. IEEE Trans. Inf. Theory 49 (12) (2003)
János Körner, Gábor Simonyi
Graph Pairs and their Entropies: Modularity Problems. Comb. 20 (2) (2000)
Gábor Simonyi
Perfection, Imperfection, and Graph Entropy. Electron. Notes Discret. Math. 5 (2000)
Attila Sali, Gábor Simonyi
Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities. Eur. J. Comb. 20 (1) (1999)
Attila Sali, Gábor Simonyi
. Discret. Math. 185 (1-3) (1998)
Attila Sali, Gábor Simonyi
Recovering Set Systems and Graph Entropy. Comb. Probab. Comput. 6 (4) (1997)
Attila Sali, Gábor Simonyi
Oriented list colouring of undirected graphs. Contemporary Trends in Discrete Mathematics (1997)
Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena
On the minimum number of edges giving maximum oriented chromatic number. Contemporary Trends in Discrete Mathematics (1997)
Gábor Simonyi
Entropy Splitting Hypergraphs. J. Comb. Theory, Ser. B 66 (2) (1996)
Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi
Different capacities of a digraph. Graphs Comb. 10 (2-4) (1994)
Rudolf Ahlswede, Gábor Simonyi
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discret. Math. 128 (1-3) (1994)
Gábor Simonyi
Graph entropy: A survey. Combinatorial Optimization (1993)
János Körner, Gábor Simonyi, Zsolt Tuza
Perfect couples of graphs. Comb. 12 (2) (1992)
János Körner, Gábor Simonyi
A Sperner-Type Theorem and Qualitative Independence. J. Comb. Theory, Ser. A 59 (1) (1992)
Rudolf Ahlswede, Gábor Simonyi
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory. IEEE Trans. Inf. Theory 37 (4) (1991)
Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
Entropy splitting for antiblocking corners and perfect graphs. Comb. 10 (1) (1990)
Gábor Simonyi
On write-unidirectional memory codes. IEEE Trans. Inf. Theory 35 (3) (1989)
Gérard D. Cohen, Gábor Simonyi
Coding for write-unidirectional memories and conflict resolution. Discret. Appl. Math. 24 (1-3) (1989)
János Körner, Gábor Simonyi
Separating Partition Systems and Locally Different Sequences. SIAM J. Discret. Math. 1 (3) (1988)