Author

Victor Lagerkvist

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

A Fast Algorithm for Maltsev Constraints

The constraint satisfaction problem over a set of relations $\Gamma$ (CSP($\Gamma$)) is the computational problem of deciding if a set of constraints admits at least one solution. The classical complexity for finite-domain CSP($\Gamma$) is settled by the CSP dichotomy theorem: it is tractable if $\Gamma$ satisfies a no...

Victor Lagerkvist · 0 citations

Conference Jul 2026

Maximum Satisfiability of Simple Temporal Problems

The results suggest that MaxSTP is often computationally harder than optimizing qualitative CSPs - it is verified that many such problems are FPT when parameterized by n or tw, and it is demonstrated that FPT algorithms for MaxSTP are indeed possible but with other parameters such as k + vc.

J. Fichte, Johanna Groven, Peter Jonsson et al. · Proceedings of the Thirty-Fi... · 0 citations