On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices. - Gábor Horváth 004; Kamilla Kátai-Urbán; Péter Pál Pach; Gabriella Pluhár; András Pongrácz; Csaba A. Szabó (Int. J. Algebra Comput., 2012)

The Number of Rooted Trees of Given Depth. - Péter Pál Pach; Gabriella Pluhár; András Pongrácz; Csaba A. Szabó (Electron. J. Comb., 2013)

Reconstructing the topology of clones. - Manuel Bodirsky; Michael Pinsker; András Pongrácz (CoRR, 2013)

A new operation on partially ordered sets. - Péter Pál Pach; Michael Pinsker; András Pongrácz; Csaba A. Szabó (J. Comb. Theory A, 2013)

Reducts of the Henson graphs with a constant. - András Pongrácz (Ann. Pure Appl. Log., 2017)

The complexity of counting quantifiers on equality languages. - Barnaby Martin; András Pongrácz; Michal Wrona (Theor. Comput. Sci., 2017)

The universal homogeneous binary tree. - Manuel Bodirsky; David Bradley-Williams; Michael Pinsker; András Pongrácz (J. Log. Comput., 2018)

Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. - Manuel Bodirsky; Barnaby Martin; Michael Pinsker; András Pongrácz (SIAM J. Comput., 2019)

Discordant Voting Protocols for Cyclically Linked Agents. - András Pongrácz (Electron. J. Comb., 2020)

Binary Linear Codes with Near-Extremal Maximum Distance. - András Pongrácz (SIAM J. Discret. Math., 2020)

On the Reconstruction of the Center of a Projection by Distances and Incidence Relations. - András Pongrácz; Csaba Vincze (J. Math. Imaging Vis., 2021)

Projective clone Homomorphisms. - Manuel Bodirsky; Michael Pinsker; András Pongrácz (J. Symb. Log., 2021)

Finding cliques and dense subgraphs using edge queries. - Endre Csóka; András Pongrácz (CoRR, 2023)