I am a post-doctoral researcher in the theoretical computer science group at RWTH Aachen University. My research interests include parameterized complexity, approximation and exact algorithms. My current research includes designing (kernelization) algorithms for problems in sparse graph classes. The graph classes that I'm interested in include H-minor-free, H-topological-minor-free graphs and the recently introduced classes of bounded expansion and no-where dense graphs. I also dabble with width measures for directed graphs and model-checking.
Please note that I do not offer summer internships and I do not reply to such mails.Back to the Theory Homepage.