On the difference of the domination number of a digraph and of its reverse. - Stefan Gyürki (Discret. Appl. Math., 2012)

Constructing goal-minimally k-diametric graphs by lifts. - Stefan Gyürki (Discret. Math., 2012)

An efficient algorithm for testing goal-minimality of graphs. - Stefan Gyürki; Ján Mazák (Discret. Appl. Math., 2013)

Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation. - Stefan Gyürki; Mikhail H. Klin (CASC, 2014)

Infinite families of directed strongly regular graphs using equitable partitions. - Stefan Gyürki (Discret. Math., 2016)

Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures. - Stefan Gyürki; Mikhail H. Klin (Australas. J Comb., 2017)

Goal-minimally k-diametric Graphs with not so Small Diameters. - Stefan Gyürki (ITAT, 2022)

On the automorphisms of a family of small q-regular graphs of girth 8. - Stefan Gyürki; Pavol János (Art Discret. Appl. Math., 2022)

Super-symmetric maps from generalized dihedral groups. - Stefan Gyürki; Ivona Hrivová; Sona Pavlíková (Art Discret. Appl. Math., 2024)

Using bi-coset graphs to construct small regular and biregular graphs. - Stefan Gyürki; Robert Jajcay; Pavol János; Jozef Sirán; Yan Wang (Discret. Math., 2024)

Super-symmetric maps from dihedral groups. - Stefan Gyürki; Ivona Hrivová; Sona Pavlíková (Ars Math. Contemp., 2025)

Orientably-regular embeddings of complete multigraphs. - Stefan Gyürki; Sona Pavlíková; Jozef Sirán (J. Comb. Theory B, 2025)