Victor Lagerkvist

68 papers A* 10A 5B 4Journal 39Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings.
Theory Comput. Syst.
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2026 J jnl
New perspectives on semiring applications to dynamic programming.
Discret. Appl. Math.
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2026 A* conf
Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming.
AAAI
Victor Lagerkvist, Johanna Groven, Leif Eriksson
2025 A* conf
A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds.
IJCAI
Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt
2025 J jnl
A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds.
CoRR
Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
CoRR
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
Theory Pract. Log. Program.
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 A* conf
Facets in Argumentation: A Formal Approach to Argument Significance.
IJCAI
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Facets in Argumentation: A Formal Approach to Argument Significance.
CoRR
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables.
CoRR
Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlström
2025 J jnl
Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings.
CoRR
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2025 J jnl
New Perspectives on Semiring Applications to Dynamic Programming.
CoRR
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2025 J jnl
The Richness of CSP Non-redundancy.
CoRR
Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlström
2024 A conf
CSPs with Few Alien Constraints.
CP
Peter Jonsson, Victor Lagerkvist, George Osipov
2024 J jnl
CSPs with Few Alien Constraints.
CoRR
Peter Jonsson, Victor Lagerkvist, George Osipov
2024 A* conf
Solving Quantified Boolean Formulas with Few Existential Variables.
IJCAI
Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki
2024 J jnl
Solving Quantified Boolean Formulas with Few Existential Variables.
CoRR
Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024 J jnl
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture.
CoRR
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2023 A* conf
A Fast Algorithm for Consistency Checking Partially Ordered Time.
IJCAI
Leif Eriksson, Victor Lagerkvist
2023 J jnl
A Fast Algorithm for Consistency Checking Partially Ordered Time.
CoRR
Leif Eriksson, Victor Lagerkvist
2023 J jnl
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs.
Algorithmica
Peter Jonsson, Victor Lagerkvist
2023 A* conf
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning.
IJCAI
Leif Eriksson, Victor Lagerkvist
2023 J jnl
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning.
CoRR
Leif Eriksson, Victor Lagerkvist
2022 A* conf
A Multivariate Complexity Analysis of Qualitative Reasoning Problems.
IJCAI
Leif Eriksson, Victor Lagerkvist
2022 J jnl
A Multivariate Complexity Analysis of Qualitative Reasoning Problems.
CoRR
Leif Eriksson, Victor Lagerkvist
2022 J jnl
A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms.
J. Multiple Valued Log. Soft Comput.
Miguel Couceiro, Lucien Haddad, Victor Lagerkvist
2022 — conf
An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems.
ISMVL
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2022 J jnl
C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases.
J. Multiple Valued Log. Soft Comput.
Victor Lagerkvist, Biman Roy
2022 J jnl
Component twin-width as a parameter for BINARY-CSP and its semiring generalisations.
CoRR
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
2022 J jnl
Computational Short Cuts in Infinite Domain Constraint Satisfaction.
CoRR
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022 J jnl
Computational Short Cuts in Infinite Domain Constraint Satisfaction.
J. Artif. Intell. Res.
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022 J jnl
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems.
ACM Trans. Comput. Theory
Victor Lagerkvist, Magnus Wahlström
2021 J jnl
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms.
Artif. Intell.
Peter Jonsson, Victor Lagerkvist, George Osipov
2021 J jnl
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem.
J. Comput. Syst. Sci.
Victor Lagerkvist, Biman Roy
2021 J jnl
Fine-Grained Time Complexity of Constraint Satisfaction Problems.
ACM Trans. Comput. Theory
Peter Jonsson, Victor Lagerkvist, Biman Roy
2021 A* conf
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach.
IJCAI
Leif Eriksson, Victor Lagerkvist
2021 A conf
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.
CP
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2021 J jnl
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems.
Theor. Comput. Sci.
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2020 — conf
A New Characterization of Restriction-Closed Hyperclones.
ISMVL
Victor Lagerkvist
2020 A* conf
Lower Bounds and Faster Algorithms for Equality Constraints.
IJCAI
Peter Jonsson, Victor Lagerkvist
2020 J jnl
Sparsification of SAT and CSP Problems via Tractable Extensions.
ACM Trans. Comput. Theory
Victor Lagerkvist, Magnus Wahlström
2019 — conf
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey.
ISMVL
Miguel Couceiro, Lucien Haddad, Victor Lagerkvist
2019 B conf
On the Strength of Uniqueness Quantification in Primitive Positive Formulas.
MFCS
Victor Lagerkvist, Gustav Nordh
2019 J jnl
On the Strength of Uniqueness Quantification in Primitive Positive Formulas.
CoRR
Victor Lagerkvist, Gustav Nordh
2019 — conf
The Inclusion Structure of Boolean Weak Bases.
ISMVL
Victor Lagerkvist, Biman Roy
2018 J jnl
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms?
CoRR
Victor Lagerkvist, Magnus Wahlström
2018 B conf
Why are CSPs Based on Partition Schemes Computationally Hard?.
MFCS
Peter Jonsson, Victor Lagerkvist
2017 — conf
A Dichotomy Theorem for the Inverse Satisfiability Problem.
FSTTCS
Victor Lagerkvist, Biman Roy
2017 J jnl
An initial study of time complexity in infinite-domain constraint satisfaction.
Artif. Intell.
Peter Jonsson, Victor Lagerkvist
2017 A conf
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra.
CP
Victor Lagerkvist, Magnus Wahlström
2017 J jnl
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra.
CoRR
Victor Lagerkvist, Magnus Wahlström
2017 J jnl
Strong partial clones and the time complexity of SAT problems.
J. Comput. Syst. Sci.
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2017 J jnl
The power of primitive positive definitions with polynomially many variables.
J. Log. Comput.
Victor Lagerkvist, Magnus Wahlström
2017 B conf
Time Complexity of Constraint Satisfaction via Universal Algebra.
MFCS
Peter Jonsson, Victor Lagerkvist, Biman Roy
2017 J jnl
Time Complexity of Constraint Satisfaction via Universal Algebra.
CoRR
Peter Jonsson, Victor Lagerkvist, Biman Roy
2016 B conf
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT.
MFCS
Victor Lagerkvist, Biman Roy
2016 — —
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications.
Victor Lagerkvist
2015 — conf
Bounded Bases of Strong Partial Clones.
ISMVL
Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
2015 J jnl
Constructing NP-intermediate problems by blowing holes with parameters of various properties.
Theor. Comput. Sci.
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
2015 — conf
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem.
MFCS (1)
Victor Lagerkvist
2015 A conf
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs.
CP
Peter Jonsson, Victor Lagerkvist
2014 — conf
Polynomially Closed Co-clones.
ISMVL
Victor Lagerkvist, Magnus Wahlström
2014 — conf
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.
MFCS (2)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2014 J jnl
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.
CoRR
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2014 J jnl
Weak bases of Boolean co-clones.
Inf. Process. Lett.
Victor Lagerkvist
2013 A conf
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction.
CP
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
2013 A* conf
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.
SODA
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2013 J jnl
Weak Bases of Boolean Co-Clones.
CoRR
Victor Lagerkvist