Search the dblp DataBase

Publications of Author

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