András Pongrácz

Orcid: 0000-0002-2771-8974

According to our database1, András Pongrácz authored at least 13 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Finding cliques and dense subgraphs using edge queries.
CoRR, 2023

2021
Projective clone Homomorphisms.
J. Symb. Log., 2021

On the Reconstruction of the Center of a Projection by Distances and Incidence Relations.
J. Math. Imaging Vis., 2021

2020
Binary Linear Codes with Near-Extremal Maximum Distance.
SIAM J. Discret. Math., 2020

Discordant Voting Protocols for Cyclically Linked Agents.
Electron. J. Comb., 2020

2019
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.
SIAM J. Comput., 2019

2018
The universal homogeneous binary tree.
J. Log. Comput., 2018

2017
The complexity of counting quantifiers on equality languages.
Theor. Comput. Sci., 2017

Reducts of the Henson graphs with a constant.
Ann. Pure Appl. Log., 2017

2013
A new operation on partially ordered sets.
J. Comb. Theory, Ser. A, 2013

Reconstructing the topology of clones.
CoRR, 2013

The Number of Rooted Trees of Given Depth.
Electron. J. Comb., 2013

2012
On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices.
Int. J. Algebra Comput., 2012


  Loading...