Alexey Barsukov

According to our database, Alexey Barsukov authored at least 8 papers between 2022 and 2026.

Collaborative distances:

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

2026

On the complexity of Sandwich Problems for <i>M</i>-partitions.

Alexey Barsukov, Santiago Guzmán-Pro

CoRR, February, 2026

2025

Edge-coloring problems with forbidden patterns and planted colors.

Alexey Barsukov, Antoine Mottet, Davide Perinti

CoRR, July, 2025

Containment for Guarded Monotone Strict NP.

Alexey Barsukov, Michael Pinsker, Jakub Rydval

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Generalisations of matrix partitions: Complexity and obstructions.

Alexey Barsukov, Mamadou Moustapha Kanté

Theor. Comput. Sci., 2024

2023

Containment for Binary Guarded Monotone SNP.

Alexey Barsukov

CoRR, 2023

On Guarded Extensions of MMSNP.

Alexey Barsukov, Florent R. Madelaine

Proceedings of the Unity of Logic and Computation, 2023

2022

On dichotomy above Feder and Vardi's logic. (Sur la dichotomie au-dessus de la logique de Feder et Vardi).

Alexey Barsukov

PhD thesis, 2022

Maximum cut on interval graphs of interval count two is NP-complete.

Alexey Barsukov, Kaustav Bose, Bodhayan Roy

CoRR, 2022