Smallest Graphs Achieving the Stinson Bound. - Máté Gyarmati; Péter Ligeti (IEEE Trans. Inf. Theory, 2020)

On the information ratio of graphs without high-degree neighbors. - Máté Gyarmati; Péter Ligeti (Discret. Appl. Math., 2021)

Secret sharing on regular bipartite access structures. - Máté Gyarmati (Des. Codes Cryptogr., 2023)

Information Ratio of Unicyclic Graphs. - Máté Gyarmati (IEEE Trans. Inf. Theory, 2024)

Conjunctive hierarchical secret sharing by finite geometry. - Máté Gyarmati; Péter Ligeti; Péter Sziklai; Marcella Takáts (Des. Codes Cryptogr., 2025)