Follow
Marcin Kozik
Marcin Kozik
Professor of Computer Science, Jagiellonian University
Verified email at uj.edu.pl
Title
Cited by
Cited by
Year
Constraint satisfaction problems solvable by local consistency methods
L Barto, M Kozik
Journal of the ACM (JACM) 61 (1), 1-19, 2014
2042014
The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell)
L Barto, M Kozik, T Niven
SIAM Journal on Computing 38 (5), 1782-1802, 2009
2042009
Constraint satisfaction problems of bounded width
L Barto, M Kozik
2009 50th Annual IEEE symposium on foundations of computer science, 595-603, 2009
1892009
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
L Barto, M Kozik
Logical Methods in Computer Science 8, 2012
1532012
Characterizations of several Maltsev conditions
M Kozik, A Krokhin, M Valeriote, R Willard
Algebra universalis 73 (3), 205-224, 2015
852015
Robust satisfiability of constraint satisfaction problems
L Barto, M Kozik
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
522012
On the scope of the universal-algebraic approach to constraint satisfaction
B Martin, M Bodirsky, M Hils
Logical Methods in Computer Science 8, 2012
482012
Algebraic properties of valued constraint satisfaction problem
M Kozik, J Ochremiak
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
422015
Robustly solvable constraint satisfaction problems
L Barto, M Kozik
SIAM Journal on Computing 45 (4), 1646-1669, 2016
382016
Absorption in universal algebra and CSP
L Barto, M Kozik
Wadern: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2017
372017
Absorption and directed Jónsson terms
A Kazda, M Kozik, R McKenzie, M Moore
Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer …, 2018
362018
Graphs, polymorphisms and the complexity of homomorphism problems
L Barto, M Kozik, T Niven
Proceedings of the fortieth annual ACM symposium on Theory of computing, 789-796, 2008
362008
CSP dichotomy for special triads
L Barto, M Kozik, M Maróti, T Niven
Proceedings of the American Mathematical Society 137 (9), 2921-2934, 2009
352009
Dichotomy for symmetric boolean PCSPs
M Ficak, M Kozik, M Olsák, S Stankiewicz
arXiv preprint arXiv:1904.12424, 2019
342019
Near unanimity constraints have bounded pathwidth duality
L Barto, M Kozik, R Willard
2012 27th Annual IEEE Symposium on Logic in Computer Science, 125-134, 2012
342012
Congruence distributivity implies bounded width
L Barto, M Kozik
SIAM Journal on Computing 39 (4), 1531-1542, 2010
332010
Weak consistency notions for all the CSPs of bounded width
M Kozik
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
322016
New conditions for Taylor varieties and CSP
L Barto, M Kozik
2010 25th Annual IEEE Symposium on Logic in Computer Science, 100-109, 2010
312010
Mal’tsev conditions, lack of absorption, and solvability
L Barto, M Kozik, D Stanovský
Algebra universalis 74 (1), 185-206, 2015
302015
Combinatorial gap theorem and reductions between promise CSPs
L Barto, M Kozik
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
252022
The system can't perform the operation now. Try again later.
Articles 1–20