Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Albert Vucaj
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
The lattice of clones of self-dual operations collapsed
2023
Manuel Bodirsky
Albert Vucaj
Dmitriy Zhuk
+
Submaximal clones over a three-element set up to minor-equivalence
2023
Albert Vucaj
Dmitriy Zhuk
+
PDF
Chat
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
2021
Manuel Bodirsky
Florian Starke
Albert Vucaj
+
The lattice of clones of self-dual operations collapsed
2021
Manuel Bodirsky
Albert Vucaj
Dmitriy Zhuk
+
Smooth digraphs modulo primitive positive constructability
2019
Manuel Bodirsky
Florian Starke
Albert Vucaj
+
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
2019
Manuel Bodirsky
Florian Starke
Albert Vucaj
+
Two-element structures modulo primitive positive constructability
2019
Manuel Bodirsky
Albert Vucaj
+
Two-element structures modulo primitive positive constructability
2019
Manuel Bodirsky
Albert Vucaj
Common Coauthors
Coauthor
Papers Together
Manuel Bodirsky
7
Dmitriy Zhuk
3
Florian Starke
3
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Complexity Classification in Infinite-Domain Constraint Satisfaction
2012
Manuel Bodirsky
3
+
PDF
Chat
A Dichotomy Theorem for Nonuniform CSPs
2017
Andreĭ A. Bulatov
3
+
PDF
Chat
A Proof of CSP Dichotomy Conjecture
2017
Dmitriy Zhuk
3
+
PDF
Chat
Taylor’s Modularity Conjecture and Related Problems for Idempotent Varieties
2017
Jakub Opršal
3
+
PDF
Chat
CSP dichotomy for special triads
2009
Libor Barto
Marcin Kozik
Miklós Maróti
Todd Niven
2
+
Complexity of tree homomorphisms
1996
Pavol Hell
Jaroslav Nešetřil
Xuding Zhu
2
+
On the complexity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml11" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi mathvariant="double-struck">H</mml:mi></mml:math>-coloring for special oriented trees
2017
Jakub Bulín
2
+
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
2009
Libor Barto
Marcin Kozik
Todd Niven
2
+
PDF
Chat
Congruence modularity implies cyclic terms for finite algebras
2009
Libor Barto
Marcin Kozik
Miklós Maróti
Ralph McKenzie
Todd Niven
2
+
PDF
Chat
Duality and Polynomial Testing of Tree Homomorphisms
1996
Pavol Hell
Jaroslav Nešetřil
Xuding Zhu
2
+
PDF
Chat
CSP DICHOTOMY FOR SPECIAL POLYADS
2013
Libor Barto
Jakub Bulín
2
+
Loop conditions for strongly connected digraphs
2019
Miroslav Olšák
2
+
PDF
Chat
Maximal Digraphs with Respect to Primitive Positive Constructability
2022
Manuel Bodirsky
Florian Starke
1
+
Galois theory for post algebras. I
1972
В. Г. Боднарчук
Lev Arkadʹevich Kaluzhnin
V. N. Kotov
B. A. Romov
1
+
On the complexity of H-coloring
1990
Pavol Hell
Jaroslav Nešetřil
1
+
Loop conditions
2019
Miroslav Olšák
1
+
Loop conditions with strongly connected graphs
2018
Miroslav Olšák
1
+
PDF
Chat
Algebraic Approach to Promise Constraint Satisfaction
2021
Libor Barto
Jakub Bulín
Andrei Krokhin
Jakub Opršal
1
+
PDF
Chat
On the number of finite algebraic structures
2014
Erhard Aichinger
Peter Mayr
Ralph McKenzie
1
+
Algebraic approach to promise constraint satisfaction
2019
Jakub Bulín
Andrei Krokhin
Jakub Opršal
1
+
Loop conditions
2017
Miroslav Olšák
1
+
Conservative constraint satisfaction re-revisited
2015
Andreǐ A. Bulatov
1