default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Hegedüs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Gábor Hegedüs, Lajos Rónyai:
Gröbner Bases for Increasing Sequences. Electron. J. Comb. 31(2) (2024)- [j14]Gábor Hegedüs, Peter Frankl:
Variations on the Bollobás set-pair theorem. Eur. J. Comb. 120: 103983 (2024) - 2021
- [j13]Gábor Hegedüs, Lajos Rónyai:
An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets. Electron. J. Comb. 28(3) (2021) - [j12]Gábor Hegedüs:
A new proof of a generalization of Gerzon's bound. Period. Math. Hung. 83(1): 49-53 (2021) - 2020
- [j11]Gábor Hegedüs:
Difference sets and power residues. Australas. J Comb. 77: 180-183 (2020) - [j10]Gábor Hegedüs:
Sunflowers and -intersecting families. AKCE Int. J. Graphs Comb. 17(1): 402-406 (2020) - [j9]Gábor Hegedüs:
An Improved Exponential Upper Bound for the Erdős-Ginzburg-Ziv Constant. Integers 20: A22 (2020)
2010 – 2019
- 2019
- [j8]Gábor Hegedüs, Akihiro Higashitani, Alexander M. Kasprzyk
:
Ehrhart Polynomial Roots of Reflexive Polytopes. Electron. J. Comb. 26(1): 1 (2019) - 2017
- [j7]Gábor Hegedüs:
Inequalities for two systems of subspaces with prescribed intersections. Australas. J Comb. 67: 508- (2017) - 2016
- [j6]Gábor Hegedüs:
A bound for s-distance permutation families and explicit Ramsey graphs. Australas. J Comb. 64: 347-353 (2016) - [j5]Gábor Hegedüs:
A generalization of the Erdős-Ko-Rado Theorem. Australas. J Comb. 66: 256-264 (2016) - 2015
- [j4]Gábor Hegedüs:
A Bollobás-type theorem for affine subspaces. Australas. J Comb. 63: 262-267 (2015) - [j3]Gábor Hegedüs, Zijia Li, Josef Schicho, Hans-Peter Schröcker:
The theory of bonds II: Closed 6R linkages with maximal genus. J. Symb. Comput. 68: 167-180 (2015) - [i4]Gábor Hegedüs, Zijia Li, Josef Schicho, Hans-Peter Schröcker:
From the Fundamental Theorem of Algebra to Kempe's Universality Theorem. CoRR abs/1507.05317 (2015) - 2013
- [i3]Gábor Hegedüs, Josef Schicho, Hans-Peter Schröcker:
Four-Pose Synthesis of Angle-Symmetric 6R Linkages. CoRR abs/1309.4959 (2013) - 2012
- [c2]Gábor Hegedüs, Josef Schicho, Hans-Peter Schröcker:
Construction of Overconstrained Linkages by Factorization of Rational Motions. ARK 2012: 213-220 - [c1]Gábor Hegedüs, Josef Schicho, Hans-Peter Schröcker:
Bond Theory and Closed 5R Linkages. ARK 2012: 221-228 - [i2]Gábor Hegedüs, Josef Schicho, Hans-Peter Schröcker:
Factorization of Rational Curves in the Study Quadric and Revolute Linkages. CoRR abs/1202.0139 (2012) - [i1]Gábor Hegedüs, Josef Schicho, Hans-Peter Schröcker:
The Theory of Bonds: A New Method for the Analysis of Linkages. CoRR abs/1206.4020 (2012) - 2011
- [j2]Gábor Hegedüs, Alexander M. Kasprzyk:
Roots of Ehrhart Polynomials of Smooth Fano Polytopes. Discret. Comput. Geom. 46(3): 488-499 (2011)
2000 – 2009
- 2009
- [j1]Bálint Felszeghy, Gábor Hegedüs, Lajos Rónyai:
Algebraic Properties of Modulo q Complete l-Wide Families. Comb. Probab. Comput. 18(3): 309-333 (2009)
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-08-04 19:14 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:
