![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Victor Lagerkvist
aka: Victor Lagerqvist
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 53 matches
- 2024
- 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) - 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) - 2023
- Peter Jonsson, Victor Lagerkvist:
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Algorithmica 85(1): 188-215 (2023) - Leif Eriksson, Victor Lagerkvist:
A Fast Algorithm for Consistency Checking Partially Ordered Time. IJCAI 2023: 1911-1918 - Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. IJCAI 2023: 1919-1926 - Leif Eriksson, Victor Lagerkvist:
A Fast Algorithm for Consistency Checking Partially Ordered Time. CoRR abs/2305.15917 (2023) - Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning. CoRR abs/2305.15950 (2023) - 2022
- Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75: 793-831 (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): 115-136 (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): 333-353 (2022) - 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) - Leif Eriksson, Victor Lagerkvist:
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. IJCAI 2022: 1804-1810 - Ambroise Baril, Miguel Couceiro
, Victor Lagerkvist:
An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. ISMVL 2022: 94-99 - Ambroise Baril, Miguel Couceiro
, Victor Lagerkvist:
Component twin-width as a parameter for BINARY-CSP and its semiring generalisations. CoRR abs/2207.12368 (2022) - Leif Eriksson, Victor Lagerkvist:
A Multivariate Complexity Analysis of Qualitative Reasoning Problems. CoRR abs/2209.15275 (2022) - Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR abs/2211.10144 (2022) - 2021
- Peter Jonsson, Victor Lagerkvist, George Osipov
:
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. 296: 103505 (2021) - 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) - 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: 1-24 (2021) - 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) - 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 - Leif Eriksson, Victor Lagerkvist:
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach. IJCAI 2021: 1873-1879 - 2020
- 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) - Peter Jonsson, Victor Lagerkvist:
Lower Bounds and Faster Algorithms for Equality Constraints. IJCAI 2020: 1784-1790 - Victor Lagerkvist:
A New Characterization of Restriction-Closed Hyperclones. ISMVL 2020: 303-308 - 2019
- Miguel Couceiro
, Lucien Haddad, Victor Lagerkvist:
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey. ISMVL 2019: 170-175 - Victor Lagerkvist, Biman Roy:
The Inclusion Structure of Boolean Weak Bases. ISMVL 2019: 31-36 - Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. MFCS 2019: 36:1-36:15 - Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. CoRR abs/1906.07031 (2019) - 2018
- Peter Jonsson, Victor Lagerkvist:
Why are CSPs Based on Partition Schemes Computationally Hard?. MFCS 2018: 43:1-43:15
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 11:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint