|
|
I'm an assistant professor in the Department of Computer Science at University of Warwick. I'm associated with the Theory and Foundations Group and the Centre for Discrete Mathematics and its Applications (DIMAP).
My primary research interests lie in the design of algorithms for NP-hard combinatorial optimization problems, often via the development of new graph theoretic tools in combination with classical optimization techniques. My current research goals include the development of new mathematical models for the analysis of preprocessing algorithms and using structural graph theory to design fast algorithms for constraint satisfaction and combinatorial testing of software systems.
I'm also affiliated with the Clean Air in London project, which is a partnership between The Alan Turing Institute, Greater London Authority and University of Warwick.
My primary research interests lie in the design of algorithms for NP-hard combinatorial optimization problems, often via the development of new graph theoretic tools in combination with classical optimization techniques. My current research goals include the development of new mathematical models for the analysis of preprocessing algorithms and using structural graph theory to design fast algorithms for constraint satisfaction and combinatorial testing of software systems.
I'm also affiliated with the Clean Air in London project, which is a partnership between The Alan Turing Institute, Greater London Authority and University of Warwick.
