A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. - Victor Lagerkvist; Biman Roy (MFCS, 2016)

A Dichotomy Theorem for the Inverse Satisfiability Problem. - Victor Lagerkvist; Biman Roy (FSTTCS, 2017)

On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. - Miguel Couceiro; Lucien Haddad; Victor Lagerqvist; Biman Roy (ISMVL, 2017)

Time Complexity of Constraint Satisfaction via Universal Algebra. - Peter Jonsson; Victor Lagerkvist; Biman Roy (MFCS, 2017)

The Inclusion Structure of Boolean Weak Bases. - Victor Lagerkvist; Biman Roy (ISMVL, 2019)

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems. - Biman Roy (2020)

Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. - Victor Lagerkvist; Biman Roy (J. Comput. Syst. Sci., 2021)

Fine-Grained Time Complexity of Constraint Satisfaction Problems. - Peter Jonsson; Victor Lagerkvist; Biman Roy (ACM Trans. Comput. Theory, 2021)

C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases. - Victor Lagerkvist; Biman Roy (J. Multiple Valued Log. Soft Comput., 2022)