Michael Kompatscher

According to our database, Michael Kompatscher authored at least 20 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Clonoids over vector spaces.

Stefano Fioravanti, Michael Kompatscher, Bernardo Rossi

CoRR, February, 2026

Ramsey expansions of metrically homogeneous graphs.

Andrés Aranda, David Bradley-Williams, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk

Eur. J. Comb., 2026

2025

Mal'cev clones over a three-element set up to minor-equivalence.

Stefano Fioravanti, Michael Kompatscher, Bernardo Rossi, Albert Vucaj

CoRR, August, 2025

2024

The Subpower Membership Problem of 2-Nilpotent Algebras.

Michael Kompatscher

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Circuit Equivalence in 2-Nilpotent Algebras.

Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Short Definitions in Constraint Languages.

Jakub Bulín, Michael Kompatscher

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.

Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker

SIAM J. Comput., 2022

CC-circuits and the expressive power of nilpotent algebras.

Michael Kompatscher

Log. Methods Comput. Sci., 2022

Local-global property for G-invariant terms.

Alexandr Kazda, Michael Kompatscher

Int. J. Algebra Comput., 2022

2021

Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.

Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker

J. Math. Log., 2021

CSAT and CEQV for nilpotent Maltsev algebras of Fitting length > 2.

Michael Kompatscher

CoRR, 2021

2020

Hrushovski's Encoding and ω-Categorical CSP Monsters.

Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.

Libor Barto, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker

J. Math. Log., 2019

2018

${2^{{\aleph _0}}}$ Pairwise nonisomorphic Maximal-closed Subgroups of Sym(ℕ) via the Classification of the Reducts of the Henson digraphs.

Lovkush Agarwal, Michael Kompatscher

J. Symb. Log., 2018

The equation solvability problem over supernilpotent algebras with Mal'cev term.

Michael Kompatscher

Int. J. Algebra Comput., 2018

A Complexity Dichotomy for Poset Constraint Satisfaction.

Michael Kompatscher, Trung Van Pham

FLAP, 2018

Forbidden cycles in metrically homogeneous graphs.

Jan Hubicka, Michael Kompatscher, Matej Konecný

CoRR, 2018

2017

Completing graphs to metric spaces.

Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk

Electron. Notes Discret. Math., 2017

A Complexity Dichotomy for Poset Constraint Satisfaction.

Michael Kompatscher, Van Trung Pham

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems.

Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017