Computationally and Algebraically Complex Finite Algebra Membership Problems. - Marcin Kozik (Int. J. Algebra Comput., 2007)

Graphs, polymorphisms and the complexity of homomorphism problems. - Libor Barto; Marcin Kozik; Todd Niven (STOC, 2008)

A finite set of functions with an EXPTIME-complete composition problem. - Marcin Kozik (Theor. Comput. Sci., 2008)

Constraint Satisfaction Problems of Bounded Width. - Libor Barto; Marcin Kozik (FOCS, 2009)

Congruence Distributivity Implies Bounded Width. - Libor Barto; Marcin Kozik (SIAM J. Comput., 2009)

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell). - Libor Barto; Marcin Kozik; Todd Niven (SIAM J. Comput., 2009)

A 2EXPTIME Complete Varietal Membership Problem. - Marcin Kozik (SIAM J. Comput., 2009)

New Conditions for Taylor Varieties and CSP. - Libor Barto; Marcin Kozik (LICS, 2010)

Robust Satisfiability of Constraint Satisfaction Problems. - Libor Barto; Marcin Kozik (Electron. Colloquium Comput. Complex., 2011)

Near Unanimity Constraints Have Bounded Pathwidth Duality. - Libor Barto; Marcin Kozik; Ross Willard (LICS, 2012)

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem - Libor Barto; Marcin Kozik (Log. Methods Comput. Sci., 2012)

Constraint Satisfaction Problems Solvable by Local Consistency Methods. - Libor Barto; Marcin Kozik (J. ACM, 2014)

Algebraic Properties of Valued Constraint Satisfaction Problem. - Marcin Kozik; Joanna Ochremiak (ICALP (1), 2015)

Weak consistency notions for all the CSPs of bounded width. - Marcin Kozik (LICS, 2016)

Weaker consistency notions for all the CSPs of bounded width. - Marcin Kozik (CoRR, 2016)

The subpower membership problem for semigroups. - Andrei Bulatov 001; Marcin Kozik; Peter Mayr 001; Markus Steindl (Int. J. Algebra Comput., 2016)

Robustly Solvable Constraint Satisfaction Problems. - Libor Barto; Marcin Kozik (SIAM J. Comput., 2016)

Absorption in Universal Algebra and CSP. - Libor Barto; Marcin Kozik (The Constraint Satisfaction Problem, 2017)

Dichotomy for Symmetric Boolean PCSPs. - Miron Ficak; Marcin Kozik; Miroslav Olsák; Szymon Stankiewicz (ICALP, 2019)

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. - Víctor Dalmau; Marcin Kozik; Andrei A. Krokhin; Konstantin Makarychev; Yury Makarychev; Jakub Oprsal (SIAM J. Comput., 2019)

Sensitive Instances of the Constraint Satisfaction Problem. - Libor Barto; Marcin Kozik; Johnson Tan; Matt Valeriote (ICALP, 2020)

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. - Libor Barto; Zarathustra Brady; Andrei Bulatov 001; Marcin Kozik; Dmitriy Zhuk (LICS, 2021)

Solving CSPs Using Weak Local Consistency. - Marcin Kozik (SIAM J. Comput., 2021)

Combinatorial Gap Theorem and Reductions between Promise CSPs. - Libor Barto; Marcin Kozik (SODA, 2022)

Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. - Libor Barto; Bertalan Bodor; Marcin Kozik; Antoine Mottet; Michael Pinsker (LICS, 2023)

On the complexity of the approximate hypergraph homomorphism problem. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (CoRR, 2023)

Symmetries of structures that fail to interpret something finite. - Libor Barto; Bertalan Bodor; Marcin Kozik; Antoine Mottet; Michael Pinsker (CoRR, 2023)

Injective hardness condition for PCSPs. - Demian Banakh; Marcin Kozik (LICS, 2024)

Model-checking positive equality free logic on a fixed structure (direttissima). - Manuel Bodirsky; Marcin Kozik; Florent R. Madelaine; Barnaby Martin; Michal Wrona (CoRR, 2024)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. - Libor Barto; Zarathustra Brady; Andrei Bulatov 001; Marcin Kozik; Dmitriy Zhuk (TheoretiCS, 2024)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. - Johanna Brunar; Marcin Kozik; Tomás Nagy; Michael Pinsker (CoRR, 2025)

Classical Simulation of Quantum CSP Strategies. - Demian Banakh; Lorenzo Ciardo; Marcin Kozik; Jan Tulowiecki (CoRR, 2025)

1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (ACM Trans. Comput. Log., 2025)