Gábor Simonyi

Orcid: 0000-0003-0270-4565

According to our database1, Gábor Simonyi authored at least 49 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shannon Capacity, Lovász Theta Number and the Mycielski Construction.
IEEE Trans. Inf. Theory, November, 2024

Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number.
Graphs Comb., May, 2024

2023
Structured Codes of Graphs.
SIAM J. Discret. Math., March, 2023

2022
On multichromatic numbers of widely colorable graphs.
J. Graph Theory, 2022

Codes with structured Hamming distance in graph families.
CoRR, 2022

2021
Partitioning Transitive Tournaments into Isomorphic Digraphs.
Order, 2021

Shannon Capacity and the Categorical Product.
Electron. J. Comb., 2021

2020
On Colorful Edge Triples in Edge-Colored Complete Graphs.
Graphs Comb., 2020

2016
Orientations Making k-Cycles Cyclic.
Graphs Comb., 2016

2015
Dilworth Rate: A Generalization of Witsenhausen's Zero-Error Rate for Directed Graphs.
IEEE Trans. Inf. Theory, 2015

Relations between the Local Chromatic Number and Its Directed Version.
J. Graph Theory, 2015

2014
A generalization of Witsenhausen's zero-error rate for directed graphs.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Colourful Theorems and Indices of Homomorphism Complexes.
Electron. J. Comb., 2013

Local chromatic number of quadrangulations of surfaces.
Comb., 2013

2012
Families of Graph-different Hamilton Paths.
SIAM J. Discret. Math., 2012

Gallai colorings and domination in multipartite digraphs.
J. Graph Theory, 2012

2011
On directed local chromatic number, shift graphs, and Borsuk-like graphs.
J. Graph Theory, 2011

Families of Very Different Paths.
Electron. Notes Discret. Math., 2011

Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math., 2011

2010
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discret. Math., 2010

On topological relaxations of chromatic conjectures.
Eur. J. Comb., 2010

2009
On types of growth for graph-different permutations.
J. Comb. Theory A, 2009

2008
Graph-Different Permutations.
SIAM J. Discret. Math., 2008

Necklace Bisection with One Cut Less than Needed.
Electron. J. Comb., 2008

2007
Colorful subgraphs in Kneser-like graphs.
Eur. J. Comb., 2007

2006
Asymptotic values of the Hall-ratio for graph powers.
Discret. Math., 2006

Local Chromatic Number, KY Fan's Theorem, And Circular Colorings.
Comb., 2006

2005
Local chromatic number and Sperner capacity.
J. Comb. Theory B, 2005

Connected matchings and Hadwiger's conjecture.
Comb. Probab. Comput., 2005

2004
Edge colorings of complete graphs without tricolored triangles.
J. Graph Theory, 2004

2003
On Witsenhausen's zero-error rate for multiple sources.
IEEE Trans. Inf. Theory, 2003

2000
Perfection, Imperfection, and Graph Entropy.
Electron. Notes Discret. Math., 2000

Graph Pairs and their Entropies: Modularity Problems.
Comb., 2000

1999
Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities.
Eur. J. Comb., 1999

1998
Intersecting set systems and graphic matroids<sup>, </sup>.
Discret. Math., 1998

1997
Recovering Set Systems and Graph Entropy.
Comb. Probab. Comput., 1997

Oriented list colouring of undirected graphs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

On the minimum number of edges giving maximum oriented chromatic number.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Entropy Splitting Hypergraphs.
J. Comb. Theory B, 1996

1994
Different capacities of a digraph.
Graphs Comb., 1994

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
Discret. Math., 1994

1993
Graph entropy: A survey.
Proceedings of the Combinatorial Optimization, 1993

1992
A Sperner-Type Theorem and Qualitative Independence.
J. Comb. Theory A, 1992

Perfect couples of graphs.
Comb., 1992

1991
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.
IEEE Trans. Inf. Theory, 1991

1990
Entropy splitting for antiblocking corners and perfect graphs.
Comb., 1990

1989
On write-unidirectional memory codes.
IEEE Trans. Inf. Theory, 1989

Coding for write-unidirectional memories and conflict resolution.
Discret. Appl. Math., 1989

1988
Separating Partition Systems and Locally Different Sequences.
SIAM J. Discret. Math., 1988


  Loading...