My expertise is in algorithms for computationally “intractable” problems from a large number of domains. While intractable in classical complexity theory, domain-specific features and structure often make these problems easier to solve in the real world. Modern approaches, like parameterized algorithms and complexity, identify and exploit the domain-specific structure. Quantum algorithms have the potential to further speed up these computations.

Please get in touch to talk about projects that appeal to both industry and academia.

Domains and Keywords
Boolean satisfiability, computational chemistry, constraint satisfaction, fair resource allocation, graph and network algorithms, preference aggregation, preprocessing, quantum algorithms, scheduling, self-interested agents, turbocharging heuristics, worst-case running time guarantees.