On geometric constructions of (k, g)-graphs. - András Gács; Tamás Héger (Contributions Discret. Math., 2008)

Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. - Gabriela Araujo-Pardo; Camino Balbuena; Tamás Héger (Discret. Math., 2010)

Permutations, hyperplanes and polynomials over finite fields. - András Gács; Tamás Héger; Zoltán Lóránt Nagy; Dömötör Pálvölgyi (Finite Fields Their Appl., 2010)

Resolving Sets and Semi-Resolving Sets in Finite Projective Planes. - Tamás Héger; Marcella Takáts (Electron. J. Comb., 2012)

On regular graphs of girth six arising from projective planes. - András Gács; Tamás Héger; Zsuzsa Weiner (Eur. J. Comb., 2013)

Search problems in vector spaces. - Tamás Héger; Balázs Patkós; Marcella Takáts (Des. Codes Cryptogr., 2015)

Blocking and Double Blocking Sets in Finite Planes. - Jan De Beule; Tamás Héger; Tamás Szonyi; Geertrui Van de Voorde (Electron. J. Comb., 2016)

Double blocking sets of size 3q-1 in PG(2, q). - Bence Csajbók; Tamás Héger (Eur. J. Comb., 2019)

The metric dimension of the incidence graphs of projective planes of small order. - Tamás Héger; Péter Szilárd; Marcella Takáts (Australas. J Comb., 2020)

Dominating sets in finite generalized quadrangles. - Tamás Héger; Lisa Hernandez Lucas (Ars Math. Contemp., 2020)

Communicating Digital Evolutionary Machines. - Istvan Elek; Zoltán Blázsik; Tamás Héger; Dániel Lenger; Dániel Sindely (SAI (2), 2021)

New values for the bipartite Ramsey number of the four-cycle versus stars. - Imre Hatala; Tamás Héger; Sam Mattheus (Discret. Math., 2021)

Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces. - Tamás Héger; Zoltán Lóránt Nagy (IEEE Trans. Inf. Theory, 2022)