| 2008 |
|---|
| 23 | EE | János Körner,
Claudia Malvenuto,
Gábor Simonyi:
Graph-Different Permutations.
SIAM J. Discrete Math. 22(2): 489-499 (2008) |
| 2007 |
|---|
| 22 | EE | János Körner,
Gábor Simonyi,
Blerina Sinaimeri:
On types of growth for graph-different permutations
CoRR abs/0712.1442: (2007) |
| 21 | EE | Gábor Simonyi,
Gábor Tardos:
Colorful subgraphs in Kneser-like graphs.
Eur. J. Comb. 28(8): 2188-2200 (2007) |
| 2006 |
|---|
| 20 | EE | Gábor Simonyi,
Gábor Tardos:
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings.
Combinatorica 26(5): 587-626 (2006) |
| 19 | EE | Gábor Simonyi:
Asymptotic values of the Hall-ratio for graph powers.
Discrete Mathematics 306(19-20): 2593-2601 (2006) |
| 2005 |
|---|
| 18 | EE | Zoltán Füredi,
András Gyárfás,
Gábor Simonyi:
Connected matchings and Hadwiger's conjecture.
Combinatorics, Probability & Computing 14(3): 435-438 (2005) |
| 17 | EE | János Körner,
Concetta Pilotto,
Gábor Simonyi:
Local chromatic number and Sperner capacity.
J. Comb. Theory, Ser. B 95(1): 101-117 (2005) |
| 2004 |
|---|
| 16 | EE | András Gyárfás,
Gábor Simonyi:
Edge colorings of complete graphs without tricolored triangles.
Journal of Graph Theory 46(3): 211-216 (2004) |
| 2003 |
|---|
| 15 | | Gábor Simonyi:
On Witsenhausen's zero-error rate for multiple sources.
IEEE Transactions on Information Theory 49(12): 3258-3260 (2003) |
| 2000 |
|---|
| 14 | EE | János Körner,
Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems.
Combinatorica 20(2): 227-240 (2000) |
| 13 | EE | Gábor Simonyi:
Perfection, Imperfection, and Graph Entropy.
Electronic Notes in Discrete Mathematics 5: 278-280 (2000) |
| 1999 |
|---|
| 12 | EE | Attila Sali,
Gábor Simonyi:
Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities.
Eur. J. Comb. 20(1): 93-99 (1999) |
| 1998 |
|---|
| 11 | EE | Attila Sali,
Gábor Simonyi:
Intersecting set systems and graphic matroids, .
Discrete Mathematics 185(1-3): 279-285 (1998) |
| 1997 |
|---|
| 10 | | Attila Sali,
Gábor Simonyi:
Recovering Set Systems and Graph Entropy.
Combinatorics, Probability & Computing 6(4): 481-491 (1997) |
| 1996 |
|---|
| 9 | EE | Gábor Simonyi:
Entropy Splitting Hypergraphs.
J. Comb. Theory, Ser. B 66(2): 310-323 (1996) |
| 1994 |
|---|
| 8 | EE | Rudolf Ahlswede,
Gábor Simonyi:
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
Discrete Mathematics 128(1-3): 389-394 (1994) |
| 1992 |
|---|
| 7 | | János Körner,
Gábor Simonyi,
Zsolt Tuza:
Perfect couples of graphs.
Combinatorica 12(2): 179-192 (1992) |
| 6 | | János Körner,
Gábor Simonyi:
A Sperner-Type Theorem and Qualitative Independence.
J. Comb. Theory, Ser. A 59(1): 90-103 (1992) |
| 1991 |
|---|
| 5 | | Rudolf Ahlswede,
Gábor Simonyi:
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.
IEEE Transactions on Information Theory 37(4): 1143-1150 (1991) |
| 1990 |
|---|
| 4 | | Imre Csiszár,
János Körner,
László Lovász,
Katalin Marton,
Gábor Simonyi:
Entropy splitting for antiblocking corners and perfect graphs.
Combinatorica 10(1): 27-40 (1990) |
| 1989 |
|---|
| 3 | EE | Gérard D. Cohen,
Gábor Simonyi:
Coding for write-unidirectional memories and conflict resolution.
Discrete Applied Mathematics 24(1-3): 103-114 (1989) |
| 2 | | Gábor Simonyi:
On write-unidirectional memory codes.
IEEE Transactions on Information Theory 35(3): 663- (1989) |
| 1988 |
|---|
| 1 | | János Körner,
Gábor Simonyi:
Separating Partition System and Locally Different Sequences.
SIAM J. Discrete Math. 1(3): 355-359 (1988) |
