Victor Lagerkvist

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 45

Top Topics

Constraint Satisfaction

Preliminary Investigation

Interval Algebra

Top Venues

Publications

Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture. CoRR (2024)
Peter Jonsson, Victor Lagerkvist, George Osipov
CSPs with Few Alien Constraints. CP (2024)
Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR (2024)
Leif Eriksson, Victor Lagerkvist
A Fast Algorithm for Consistency Checking Partially Ordered Time. IJCAI (2023)
Leif Eriksson, Victor Lagerkvist
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. CoRR (2023)
Leif Eriksson, Victor Lagerkvist
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. IJCAI (2023)
Leif Eriksson, Victor Lagerkvist
A Fast Algorithm for Consistency Checking Partially Ordered Time. CoRR (2023)
Peter Jonsson, Victor Lagerkvist
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Algorithmica 85 (1) (2023)
Leif Eriksson, Victor Lagerkvist
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. CoRR (2022)
Miguel Couceiro, Lucien Haddad, Victor Lagerkvist
A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms. J. Multiple Valued Log. Soft Comput. 38 (1-2) (2022)
Victor Lagerkvist, Biman Roy
C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases. J. Multiple Valued Log. Soft Comput. 38 (3-4) (2022)
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. ISMVL (2022)
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
Component twin-width as a parameter for BINARY-CSP and its semiring generalisations. CoRR (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR (2022)
Leif Eriksson, Victor Lagerkvist
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. IJCAI (2022)
Victor Lagerkvist, Magnus Wahlström
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14 (1) (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75 (2022)
Peter Jonsson, Victor Lagerkvist, George Osipov
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. 296 (2021)
Leif Eriksson, Victor Lagerkvist
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach. IJCAI (2021)
Victor Lagerkvist, Biman Roy
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. J. Comput. Syst. Sci. 117 (2021)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892 (2021)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory 13 (1) (2021)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP (2021)
Victor Lagerkvist, Magnus Wahlström
Sparsification of SAT and CSP Problems via Tractable Extensions. ACM Trans. Comput. Theory 12 (2) (2020)
Peter Jonsson, Victor Lagerkvist
Lower Bounds and Faster Algorithms for Equality Constraints. IJCAI (2020)
Victor Lagerkvist
A New Characterization of Restriction-Closed Hyperclones. ISMVL (2020)
Victor Lagerkvist, Gustav Nordh
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. CoRR (2019)
Victor Lagerkvist, Biman Roy
The Inclusion Structure of Boolean Weak Bases. ISMVL (2019)
Victor Lagerkvist, Gustav Nordh
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. MFCS (2019)
Miguel Couceiro, Lucien Haddad, Victor Lagerkvist
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey. ISMVL (2019)
Peter Jonsson, Victor Lagerkvist
Why are CSPs Based on Partition Schemes Computationally Hard?. MFCS (2018)
Victor Lagerkvist, Magnus Wahlström
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? CoRR (2018)
Victor Lagerkvist, Magnus Wahlström
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. CP (2017)
Victor Lagerkvist, Magnus Wahlström
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra. CoRR (2017)
Victor Lagerkvist, Biman Roy
A Dichotomy Theorem for the Inverse Satisfiability Problem. FSTTCS (2017)
Peter Jonsson, Victor Lagerkvist
An initial study of time complexity in infinite-domain constraint satisfaction. Artif. Intell. 245 (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. MFCS (2017)
Victor Lagerkvist, Magnus Wahlström
The power of primitive positive definitions with polynomially many variables. J. Log. Comput. 27 (5) (2017)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84 (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. CoRR (2017)
Victor Lagerkvist, Biman Roy
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. MFCS (2016)
Victor Lagerkvist
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem. MFCS (1) (2015)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. 581 (2015)
Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
Bounded Bases of Strong Partial Clones. ISMVL (2015)
Peter Jonsson, Victor Lagerkvist
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. CP (2015)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR (2014)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. MFCS (2) (2014)
Victor Lagerkvist, Magnus Wahlström
Polynomially Closed Co-clones. ISMVL (2014)
Victor Lagerkvist
Weak bases of Boolean co-clones. Inf. Process. Lett. 114 (9) (2014)
Victor Lagerkvist
Weak Bases of Boolean Co-Clones. CoRR (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA (2013)