Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh (CP, 2013)

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (SODA, 2013)

Polynomially Closed Co-clones. - Victor Lagerkvist; Magnus Wahlström (ISMVL, 2014)

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (MFCS (2), 2014)

Weak bases of Boolean co-clones. - Victor Lagerkvist (Inf. Process. Lett., 2014)

Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. - Peter Jonsson; Victor Lagerkvist (CP, 2015)

Bounded Bases of Strong Partial Clones. - Victor Lagerkvist; Magnus Wahlström; Bruno Zanuttini (ISMVL, 2015)

Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem. - Victor Lagerkvist (MFCS (1), 2015)

Constructing NP-intermediate problems by blowing holes with parameters of various properties. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh (Theor. Comput. Sci., 2015)

A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. - Victor Lagerkvist; Biman Roy (MFCS, 2016)

Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications. - Victor Lagerkvist (2016)

Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. - Victor Lagerkvist; Magnus Wahlström (CP, 2017)

A Dichotomy Theorem for the Inverse Satisfiability Problem. - Victor Lagerkvist; Biman Roy (FSTTCS, 2017)

On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. - Miguel Couceiro; Lucien Haddad; Victor Lagerqvist; Biman Roy (ISMVL, 2017)

Time Complexity of Constraint Satisfaction via Universal Algebra. - Peter Jonsson; Victor Lagerkvist; Biman Roy (MFCS, 2017)

An initial study of time complexity in infinite-domain constraint satisfaction. - Peter Jonsson; Victor Lagerkvist (Artif. Intell., 2017)

Strong partial clones and the time complexity of SAT problems. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (J. Comput. Syst. Sci., 2017)

The power of primitive positive definitions with polynomially many variables. - Victor Lagerkvist; Magnus Wahlström (J. Log. Comput., 2017)

Why are CSPs Based on Partition Schemes Computationally Hard?. - Peter Jonsson; Victor Lagerkvist (MFCS, 2018)

Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? - Victor Lagerkvist; Magnus Wahlström (CoRR, 2018)

Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey. - Miguel Couceiro; Lucien Haddad; Victor Lagerkvist (ISMVL, 2019)

The Inclusion Structure of Boolean Weak Bases. - Victor Lagerkvist; Biman Roy (ISMVL, 2019)

On the Strength of Uniqueness Quantification in Primitive Positive Formulas. - Victor Lagerkvist; Gustav Nordh (MFCS, 2019)

Lower Bounds and Faster Algorithms for Equality Constraints. - Peter Jonsson; Victor Lagerkvist (IJCAI, 2020)

A New Characterization of Restriction-Closed Hyperclones. - Victor Lagerkvist (ISMVL, 2020)

Sparsification of SAT and CSP Problems via Tractable Extensions. - Victor Lagerkvist; Magnus Wahlström (ACM Trans. Comput. Theory, 2020)

Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. - Peter Jonsson; Victor Lagerkvist; Sebastian Ordyniak (CP, 2021)

Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach. - Leif Eriksson; Victor Lagerkvist (IJCAI, 2021)

Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. - Peter Jonsson; Victor Lagerkvist; George Osipov (Artif. Intell., 2021)

Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. - Victor Lagerkvist; Biman Roy (J. Comput. Syst. Sci., 2021)

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. - Peter Jonsson; Victor Lagerkvist; Johannes Schmidt 001; Hannes Uppman (Theor. Comput. Sci., 2021)

Fine-Grained Time Complexity of Constraint Satisfaction Problems. - Peter Jonsson; Victor Lagerkvist; Biman Roy (ACM Trans. Comput. Theory, 2021)

A Multivariate Complexity Analysis of Qualitative Reasoning Problems. - Leif Eriksson; Victor Lagerkvist (IJCAI, 2022)

An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (ISMVL, 2022)

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (CoRR, 2022)

Computational Short Cuts in Infinite Domain Constraint Satisfaction. - Peter Jonsson; Victor Lagerkvist; Sebastian Ordyniak (J. Artif. Intell. Res., 2022)

A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms. - Miguel Couceiro; Lucien Haddad; Victor Lagerkvist (J. Multiple Valued Log. Soft Comput., 2022)

C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases. - Victor Lagerkvist; Biman Roy (J. Multiple Valued Log. Soft Comput., 2022)

The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. - Victor Lagerkvist; Magnus Wahlström (ACM Trans. Comput. Theory, 2022)

A Fast Algorithm for Consistency Checking Partially Ordered Time. - Leif Eriksson; Victor Lagerkvist (IJCAI, 2023)

Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. - Leif Eriksson; Victor Lagerkvist (IJCAI, 2023)

General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. - Peter Jonsson; Victor Lagerkvist (Algorithmica, 2023)

CSPs with Few Alien Constraints. - Peter Jonsson; Victor Lagerkvist; George Osipov (CP, 2024)

Solving Quantified Boolean Formulas with Few Existential Variables. - Leif Eriksson; Victor Lagerkvist; Sebastian Ordyniak; George Osipov; Fahad Panolan; Mateusz Rychlicki (IJCAI, 2024)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture. - Ambroise Baril; Miguel Couceiro; Victor Lagerkvist (CoRR, 2024)

A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds. - Victor Lagerkvist; Mohamed Maizia; Johannes Schmidt 001 (CoRR, 2025)

Facets in Argumentation: A Formal Approach to Argument Significance. - Johannes Klaus Fichte; Nicolas Fröhlich 001; Markus Hecher; Victor Lagerkvist; Yasir Mahmood 002; Arne Meier; Jonathan Persson (CoRR, 2025)

The Richness of CSP Non-redundancy. - Joshua Brakensiek; Venkatesan Guruswami; Bart M. P. Jansen; Victor Lagerkvist; Magnus Wahlström (CoRR, 2025)

Complexity of Faceted Explanations in Propositional Abduction. - Johannes Schmidt 001; Mohamed Maizia; Victor Lagerkvist; Johannes Klaus Fichte (CoRR, 2025)