default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Simonyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Anna Gujgiczer, Gábor Simonyi
:
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number. Graphs Comb. 40(3): 64 (2024)- 2023
- [j42]Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi:
Structured Codes of Graphs. SIAM J. Discret. Math. 37(1): 379-403 (2023) - [i6]Bence Csonka, Gábor Simonyi:
Shannon capacity, Lovász theta number and the Mycielski construction. CoRR abs/2312.09224 (2023) - 2022
- [j41]Anna Gujgiczer, Gábor Simonyi:
On multichromatic numbers of widely colorable graphs. J. Graph Theory 100(2): 346-361 (2022) - [i5]Anna Gujgiczer, János Körner, Gábor Simonyi:
Codes with structured Hamming distance in graph families. CoRR abs/2202.06810 (2022) - 2021
- [j40]Gábor Simonyi:
Shannon Capacity and the Categorical Product. Electron. J. Comb. 28(1): 1 (2021) - [j39]Attila Sali, Gábor Simonyi, Gábor Tardos:
Partitioning Transitive Tournaments into Isomorphic Digraphs. Order 38(2): 211-228 (2021) - 2020
- [j38]Gábor Simonyi:
On Colorful Edge Triples in Edge-Colored Complete Graphs. Graphs Comb. 36(6): 1623-1637 (2020)
2010 – 2019
- 2019
- [i4]Gábor Simonyi:
Shannon capacity and the categorical product. CoRR abs/1911.00944 (2019) - 2016
- [j37]Zita Helle, Gábor Simonyi:
Orientations Making k-Cycles Cyclic. Graphs Comb. 32(6): 2415-2423 (2016) - 2015
- [j36]Gábor Simonyi, Gábor Tardos, Ambrus Zsbán:
Relations between the Local Chromatic Number and Its Directed Version. J. Graph Theory 79(4): 318-330 (2015) - [j35]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): 715-726 (2015) - 2014
- [c4]Gábor Simonyi, Ágnes Tóth:
A generalization of Witsenhausen's zero-error rate for directed graphs. ISIT 2014: 2864-2868 - [i3]Gábor Simonyi, Ágnes Tóth:
A generalization of Witsenhausen's zero-error rate for directed graphs. CoRR abs/1406.0767 (2014) - 2013
- [j34]Bojan Mohar, Gábor Simonyi, Gábor Tardos:
Local chromatic number of quadrangulations of surfaces. Comb. 33(4): 467-495 (2013) - [j33]Gábor Simonyi, Claude Tardif, Ambrus Zsbán:
Colourful Theorems and Indices of Homomorphism Complexes. Electron. J. Comb. 20(1): 10 (2013) - 2012
- [j32]András Gyárfás, Gábor Simonyi, Ágnes Tóth:
Gallai colorings and domination in multipartite digraphs. J. Graph Theory 71(3): 278-292 (2012) - [j31]János Körner, Silvia Messuti, Gábor Simonyi:
Families of Graph-different Hamilton Paths. SIAM J. Discret. Math. 26(1): 321-329 (2012) - 2011
- [j30]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: 195-199 (2011) - [j29]János Körner, Silvia Messuti, Gábor Simonyi:
Families of Very Different Paths. Electron. Notes Discret. Math. 38: 529-533 (2011) - [j28]Gábor Simonyi, Gábor Tardos:
On directed local chromatic number, shift graphs, and Borsuk-like graphs. J. Graph Theory 66(1): 65-82 (2011) - [i2]János Körner, Silvia Messuti, Gábor Simonyi:
Families of graph-different Hamilton paths. CoRR abs/1106.3754 (2011) - 2010
- [j27]Gábor Simonyi, Ambrus Zsbán:
On topological relaxations of chromatic conjectures. Eur. J. Comb. 31(8): 2110-2119 (2010) - [j26]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): 441-456 (2010)
2000 – 2009
- 2009
- [j25]János Körner, Gábor Simonyi, Blerina Sinaimeri:
On types of growth for graph-different permutations. J. Comb. Theory A 116(3): 713-723 (2009) - 2008
- [j24]Gábor Simonyi:
Necklace Bisection with One Cut Less than Needed. Electron. J. Comb. 15(1) (2008) - [j23]János Körner, Claudia Malvenuto, Gábor Simonyi:
Graph-Different Permutations. SIAM J. Discret. Math. 22(2): 489-499 (2008) - 2007
- [j22]Gábor Simonyi, Gábor Tardos:
Colorful subgraphs in Kneser-like graphs. Eur. J. Comb. 28(8): 2188-2200 (2007) - [i1]János Körner, Gábor Simonyi, Blerina Sinaimeri:
On types of growth for graph-different permutations. CoRR abs/0712.1442 (2007) - 2006
- [j21]Gábor Simonyi, Gábor Tardos:
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings. Comb. 26(5): 587-626 (2006) - [j20]Gábor Simonyi:
Asymptotic values of the Hall-ratio for graph powers. Discret. Math. 306(19-20): 2593-2601 (2006) - 2005
- [j19]Zoltán Füredi, András Gyárfás, Gábor Simonyi:
Connected matchings and Hadwiger's conjecture. Comb. Probab. Comput. 14(3): 435-438 (2005) - [j18]János Körner, Concetta Pilotto, Gábor Simonyi:
Local chromatic number and Sperner capacity. J. Comb. Theory B 95(1): 101-117 (2005) - 2004
- [j17]András Gyárfás, Gábor Simonyi:
Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46(3): 211-216 (2004) - 2003
- [j16]Gábor Simonyi:
On Witsenhausen's zero-error rate for multiple sources. IEEE Trans. Inf. Theory 49(12): 3258-3260 (2003) - 2000
- [j15]János Körner, Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems. Comb. 20(2): 227-240 (2000) - [j14]Gábor Simonyi:
Perfection, Imperfection, and Graph Entropy. Electron. Notes Discret. Math. 5: 278-280 (2000)
1990 – 1999
- 1999
- [j13]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
- [j12]Attila Sali, Gábor Simonyi:
Intersecting set systems and graphic matroids, . Discret. Math. 185(1-3): 279-285 (1998) - 1997
- [j11]Attila Sali, Gábor Simonyi:
Recovering Set Systems and Graph Entropy. Comb. Probab. Comput. 6(4): 481-491 (1997) - [c3]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: 179-182 - [c2]Attila Sali, Gábor Simonyi:
Oriented list colouring of undirected graphs. Contemporary Trends in Discrete Mathematics 1997: 307-316 - 1996
- [j10]Gábor Simonyi:
Entropy Splitting Hypergraphs. J. Comb. Theory B 66(2): 310-323 (1996) - 1994
- [j9]Rudolf Ahlswede, Gábor Simonyi:
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discret. Math. 128(1-3): 389-394 (1994) - [j8]Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi:
Different capacities of a digraph. Graphs Comb. 10(2-4): 105-121 (1994) - 1993
- [c1]Gábor Simonyi:
Graph entropy: A survey. Combinatorial Optimization 1993: 399-441 - 1992
- [j7]János Körner, Gábor Simonyi, Zsolt Tuza:
Perfect couples of graphs. Comb. 12(2): 179-192 (1992) - [j6]János Körner, Gábor Simonyi:
A Sperner-Type Theorem and Qualitative Independence. J. Comb. Theory A 59(1): 90-103 (1992) - 1991
- [j5]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): 1143-1150 (1991) - 1990
- [j4]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): 27-40 (1990)
1980 – 1989
- 1989
- [j3]Gérard D. Cohen, Gábor Simonyi:
Coding for write-unidirectional memories and conflict resolution. Discret. Appl. Math. 24(1-3): 103-114 (1989) - [j2]Gábor Simonyi:
On write-unidirectional memory codes. IEEE Trans. Inf. Theory 35(3): 663-669 (1989) - 1988
- [j1]János Körner, Gábor Simonyi:
Separating Partition Systems and Locally Different Sequences. SIAM J. Discret. Math. 1(3): 355-359 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
