Hi! I’m a theoretical computer scientist and a postdoctoral researcher in the team for operations research at LIP6. My research is driven by my desire to get to the core of things and to fully understand a problem. I’m especially intrigued by random processes where seemingly random choices accumulate in a certain, almost deterministic trend.
A prime example for such processes are randomized search heuristics (RSHs), which act as a means for finding good solutions to optimization problems that are so badly understood that they acts as a black box to the user. RSHs typically follow a simple iterative pattern but still yield strong results for a wide range of real-world optimization problems. My aim is to provide theoretical performance guarantees for the various operations of RSHs and to thus understand which of them are useful in certain situations. In the best case, such insights lead to improved algorithms. I especially like to analyze RSHs that evolve a probabilistic model of the problem space, so called estimation-of-distribution algorithms.
I am very happy to be funded by the Paris Region Fellowship Program, supporting my project on analyzing how different parameters of randomized search heuristics impact their run time. My host is Carola Doerr.
PhD student at the group for Algorithm Engineering at the Hasso Plattner Institute, Germany
I was co-organizer of the following events:
I was an invited speaker at the following events:
I collaborated with students on various projects in cooperation with industry partners. Many of these projects involved applying heuristic algorithms to the given problem.