default search action
András Pongrácz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i5]Endre Csóka, András Pongrácz:
Finding cliques and dense subgraphs using edge queries. CoRR abs/2310.06826 (2023) - 2021
- [j11]András Pongrácz
, Csaba Vincze:
On the Reconstruction of the Center of a Projection by Distances and Incidence Relations. J. Math. Imaging Vis. 63(4): 443-456 (2021) - [j10]Manuel Bodirsky
Projective clone Homomorphisms. J. Symb. Log. 86(1): 148-161 (2021) - 2020
- [j9]András Pongrácz
Discordant Voting Protocols for Cyclically Linked Agents. Electron. J. Comb. 27(1): 1 (2020) - [j8]András Pongrácz
Binary Linear Codes with Near-Extremal Maximum Distance. SIAM J. Discret. Math. 34(4): 2300-2317 (2020)
2010 – 2019
- 2019
- [j7]Manuel Bodirsky
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. 48(4): 1224-1264 (2019) - 2018
- [j6]Manuel Bodirsky
The universal homogeneous binary tree. J. Log. Comput. 28(1): 133-163 (2018) - 2017
- [j5]András Pongrácz
Reducts of the Henson graphs with a constant. Ann. Pure Appl. Log. 168(7): 1472-1489 (2017) - [j4]Barnaby Martin
The complexity of counting quantifiers on equality languages. Theor. Comput. Sci. 670: 56-67 (2017) - 2016
- [c2]Barnaby Martin, András Pongrácz, Michal Wrona:
The Complexity of Counting Quantifiers on Equality Languages. CiE 2016: 333-342 - [c1]Manuel Bodirsky, Barnaby Martin
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP 2016: 119:1-119:14 - [i4]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint satisfaction problems for reducts of homogeneous graphs. CoRR abs/1602.05819 (2016) - 2014
- [i3]Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. CoRR abs/1409.2170 (2014) - [i2]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Projective clone homomorphisms. CoRR abs/1409.4601 (2014) - 2013
- [j3]Péter Pál Pach, Gabriella Pluhár, András Pongrácz
The Number of Rooted Trees of Given Depth. Electron. J. Comb. 20(2): 38 (2013) - [j2]Péter Pál Pach, Michael Pinsker
A new operation on partially ordered sets. J. Comb. Theory A 120(7): 1450-1462 (2013) - [i1]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Reconstructing the topology of clones. CoRR abs/1312.7699 (2013) - 2012
- [j1]Gábor Horváth, Kamilla Kátai-Urbán
On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices. Int. J. Algebra Comput. 22(7) (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: