default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Héger
Person information
- affiliation: Eötvös Loránd University, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Tamás Héger
, Zoltán Lóránt Nagy:
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces. IEEE Trans. Inf. Theory 68(2): 881-890 (2022)- 2021
- [j11]Imre Hatala, Tamás Héger, Sam Mattheus:
New values for the bipartite Ramsey number of the four-cycle versus stars. Discret. Math. 344(5): 112320 (2021) - [c1]Istvan Elek, Zoltán Blázsik, Tamás Héger, Dániel Lenger, Dániel Sindely:
Communicating Digital Evolutionary Machines. SAI (2) 2021: 976-986 - [i1]Tamás Héger, Zoltán Lóránt Nagy:
Short minimal codes and covering codes via strong blocking sets in projective spaces. CoRR abs/2103.07393 (2021) - 2020
- [j10]Tamás Héger, Péter Szilárd, Marcella Takáts:
The metric dimension of the incidence graphs of projective planes of small order. Australas. J Comb. 78: 352-375 (2020) - [j9]Tamás Héger, Lisa Hernandez Lucas:
Dominating sets in finite generalized quadrangles. Ars Math. Contemp. 19(1): 61-76 (2020)
2010 – 2019
- 2019
- [j8]Bence Csajbók, Tamás Héger:
Double blocking sets of size 3q-1 in PG(2, q). Eur. J. Comb. 78: 73-89 (2019) - 2016
- [j7]Jan De Beule, Tamás Héger, Tamás Szonyi, Geertrui Van de Voorde:
Blocking and Double Blocking Sets in Finite Planes. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j6]Tamás Héger, Balázs Patkós, Marcella Takáts:
Search problems in vector spaces. Des. Codes Cryptogr. 76(2): 207-216 (2015) - 2013
- [j5]András Gács, Tamás Héger, Zsuzsa Weiner:
On regular graphs of girth six arising from projective planes. Eur. J. Comb. 34(2): 285-296 (2013) - 2012
- [j4]Tamás Héger, Marcella Takáts:
Resolving Sets and Semi-Resolving Sets in Finite Projective Planes. Electron. J. Comb. 19(4): 30 (2012) - 2010
- [j3]Gabriela Araujo-Pardo, Camino Balbuena, Tamás Héger:
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. Discret. Math. 310(8): 1301-1306 (2010) - [j2]András Gács, Tamás Héger, Zoltán Lóránt Nagy, Dömötör Pálvölgyi:
Permutations, hyperplanes and polynomials over finite fields. Finite Fields Their Appl. 16(5): 301-314 (2010)
2000 – 2009
- 2008
- [j1]András Gács, Tamás Héger:
On geometric constructions of (k, g)-graphs. Contributions Discret. Math. 3(1) (2008)
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-04-24 23:09 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:
