Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2019
Citations
22
17
h-index
3
3
i10-index
0
0
0
8
4
2017
2018
2019
2020
2021
2022
2023
2024
2
3
8
2
2
4
1
Public access
View all
View all
2 articles
0 articles
available
not available
Based on funding mandates
Follow
Biman Roy
PhD, Linköping University
No verified email
Constraint Satisfaction Problem
Complexity Theorey
Universal Algebra
Articles
Cited by
Public access
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
Time complexity of constraint satisfaction via universal algebra
P Jonsson, V Lagerkvist, B Roy
arXiv preprint arXiv:1706.05902
, 2017
8
2017
A Dichotomy Theorem for the Inverse Satisfiability Problem
V Lagerkvist, B Roy
37th IARCS Annual Conference on Foundations of Software Technology and …
, 2018
7
2018
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT
V Lagerkvist, B Roy
41st International Symposium on Mathematical Foundations of Computer Science …
, 2016
7
2016
The system can't perform the operation now. Try again later.
Articles 1–3
Show more
Privacy
Terms
Help
About Scholar
Search help
