My research is mainly about the study of intractable computational problems.
I design new algorithms for these NP-hard problems, analyse their running time, and make fine-grained complexity classifications.
These computational problems have applications in many different areas and I have mainly looked at problems from
Boolean satisfiability and constraint satisfaction, networks and graphs, and algorithmic decision theory.