Biman Roy

Publication Activity (10 Years)

Years Active: 2016-2022
Publications (10 Years): 9

Top Topics

Soft Constraints

Stochastic Local Search Algorithms

Satisfiability Problem

Top Venues

J. Comput. Syst. Sci.

ACM Trans. Comput. Theory

Publications

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) (2022)
Victor Lagerkvist, Biman Roy
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. J. Comput. Syst. Sci. 117 (2021)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory 13 (1) (2021)
Victor Lagerkvist, Biman Roy
The Inclusion Structure of Boolean Weak Bases. ISMVL (2019)
Victor Lagerkvist, Biman Roy
A Dichotomy Theorem for the Inverse Satisfiability Problem. FSTTCS (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. MFCS (2017)
Miguel Couceiro, Lucien Haddad, Victor Lagerqvist, Biman Roy
On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. ISMVL (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. CoRR (2017)
Victor Lagerkvist, Biman Roy
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. MFCS (2016)