default search action
Victor Lagerkvist
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Peter Jonsson, Victor Lagerkvist, George Osipov:
CSPs with Few Alien Constraints. CP 2024: 15:1-15:17 - [c25]Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897 - [i14]Ambroise Baril, Miguel Couceiro, Victor Lagerkvist:
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzazewski Conjecture. CoRR abs/2404.09798 (2024) - [i13]Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024) - [i12]Peter Jonsson, Victor Lagerkvist, George Osipov:
CSPs with Few Alien Constraints. CoRR abs/2408.12909 (2024) - 2023
- [j15]Peter Jonsson, Victor Lagerkvist:
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Algorithmica 85(1): 188-215 (2023) - [c24]Leif Eriksson, Victor Lagerkvist:
A Fast Algorithm for Consistency Checking Partially Ordered Time. IJCAI 2023: 1911-1918 - [c23]Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. IJCAI 2023: 1919-1926 - [i11]Leif Eriksson, Victor Lagerkvist:
A Fast Algorithm for Consistency Checking Partially Ordered Time. CoRR abs/2305.15917 (2023) - [i10]Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. CoRR abs/2305.15950 (2023) - 2022
- [j14]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75: 793-831 (2022) - [j13]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): 115-136 (2022) - [j12]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): 333-353 (2022) - [j11]Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022) - [c22]Leif Eriksson, Victor Lagerkvist:
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. IJCAI 2022: 1804-1810 - [c21]Ambroise Baril, Miguel Couceiro
, Victor Lagerkvist:
An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. ISMVL 2022: 94-99 - [i9]Ambroise Baril, Miguel Couceiro
Component twin-width as a parameter for BINARY-CSP and its semiring generalisations. CoRR abs/2207.12368 (2022) - [i8]Leif Eriksson, Victor Lagerkvist:
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. CoRR abs/2209.15275 (2022) - [i7]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR abs/2211.10144 (2022) - 2021
- [j10]Peter Jonsson, Victor Lagerkvist, George Osipov
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. 296: 103505 (2021) - [j9]Victor Lagerkvist, Biman Roy:
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. J. Comput. Syst. Sci. 117: 23-39 (2021) - [j8]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892: 1-24 (2021) - [j7]Peter Jonsson, Victor Lagerkvist, Biman Roy:
Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory 13(1): 2:1-2:32 (2021) - [c20]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP 2021: 32:1-32:20 - [c19]Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach. IJCAI 2021: 1873-1879 - 2020
- [j6]Victor Lagerkvist, Magnus Wahlström
Sparsification of SAT and CSP Problems via Tractable Extensions. ACM Trans. Comput. Theory 12(2): 13:1-13:29 (2020) - [c18]Peter Jonsson, Victor Lagerkvist:
Lower Bounds and Faster Algorithms for Equality Constraints. IJCAI 2020: 1784-1790 - [c17]Victor Lagerkvist:
A New Characterization of Restriction-Closed Hyperclones. ISMVL 2020: 303-308
2010 – 2019
- 2019
- [c16]Victor Lagerkvist, Biman Roy:
The Inclusion Structure of Boolean Weak Bases. ISMVL 2019: 31-36 - [c15]Miguel Couceiro
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey. ISMVL 2019: 170-175 - [c14]Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. MFCS 2019: 36:1-36:15 - [i6]Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. CoRR abs/1906.07031 (2019) - 2018
- [c13]Peter Jonsson, Victor Lagerkvist:
Why are CSPs Based on Partition Schemes Computationally Hard?. MFCS 2018: 43:1-43:15 - [i5]Victor Lagerkvist, Magnus Wahlström:
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? CoRR abs/1801.09488 (2018) - 2017
- [j5]Peter Jonsson, Victor Lagerkvist:
An initial study of time complexity in infinite-domain constraint satisfaction. Artif. Intell. 245: 115-133 (2017) - [j4]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84: 52-78 (2017) - [j3]Victor Lagerkvist, Magnus Wahlström
The power of primitive positive definitions with polynomially many variables. J. Log. Comput. 27(5): 1465-1488 (2017) - [c12]Victor Lagerkvist, Magnus Wahlström:
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. CP 2017: 157-171 - [c11]Victor Lagerkvist, Biman Roy:
A Dichotomy Theorem for the Inverse Satisfiability Problem. FSTTCS 2017: 39:39-39:14 - [c10]Miguel Couceiro
On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. ISMVL 2017: 88-93 - [c9]Peter Jonsson, Victor Lagerkvist, Biman Roy:
Time Complexity of Constraint Satisfaction via Universal Algebra. MFCS 2017: 17:1-17:15 - [i4]Peter Jonsson, Victor Lagerkvist, Biman Roy:
Time Complexity of Constraint Satisfaction via Universal Algebra. CoRR abs/1706.05902 (2017) - [i3]Victor Lagerkvist, Magnus Wahlström:
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra. CoRR abs/1706.05941 (2017) - 2016
- [b1]Victor Lagerkvist:
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications. Linköping University, Sweden, 2016 - [c8]Victor Lagerkvist, Biman Roy:
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. MFCS 2016: 64:1-64:14 - 2015
- [j2]Peter Jonsson, Victor Lagerkvist, Gustav Nordh:
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. 581: 67-82 (2015) - [c7]Peter Jonsson, Victor Lagerkvist:
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. CP 2015: 183-199 - [c6]Victor Lagerkvist, Magnus Wahlström
Bounded Bases of Strong Partial Clones. ISMVL 2015: 189-194 - [c5]Victor Lagerkvist:
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem. MFCS (1) 2015: 357-368 - 2014
- [j1]Victor Lagerkvist:
Weak bases of Boolean co-clones. Inf. Process. Lett. 114(9): 462-468 (2014) - [c4]Victor Lagerkvist, Magnus Wahlström
Polynomially Closed Co-clones. ISMVL 2014: 85-90 - [c3]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: 408-419 - [i2]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman:
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR abs/1406.3247 (2014) - 2013
- [c2]Peter Jonsson, Victor Lagerkvist, Gustav Nordh:
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP 2013: 398-414 - [c1]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA 2013: 1264-1277 - [i1]Victor Lagerkvist:
Weak Bases of Boolean Co-Clones. CoRR abs/1310.3674 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: