I am an Algorithm Engineer with a focus on solving NP-hard combinatorial problems using various techniques such as mixed integer programming (and LP-relaxation based approaches), constraint programming, SAT-solvers, and more. After identifying the core of the problem in a theoretical analysis, I try to utilize and combine already existent and highly optimized algorithm implementations for related problems. In cases where this approach is not successful, I like to experiment with other methods including, e.g., auction-based algorithms, meta-heuristics, or deep reinforcement learning.

Research

Here is a small selection of my publications:

• Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces IROS, 2015
• Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost ALENEX, 2019
• Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation CIAC, 2019 BEST PAPER AWARD
• Minimum Scan Cover with Angular Transition CostsSIAM J. Discrete Math., 2021

Projects

I have been involved in multiple projects

• ASIMOV ("Automated conStellatIon Management Of space Vehicles") for the European Space Agency (ESA) in cooperation with IRAS and Planet.com
• Multiple projects for Volkswagen
• CG:SHOP Challenges

Awards

• Best Paper Award at CIAC 2019 in Rome. Sponsored by Springer with 1000Euro
• Preis der Gesellschaft für Informatiker e.V. für herausragende Studienleistungen im Masterstudiengang Informatik (2017)
• Preis der Gesellschaft für Informatiker e.V. für herausragende Studienleistungen im Bachelorstudiengang Informatik (2014)

Teaching

I have been responsible for multiple software development labs and assisted lectures on algorithm engineering, mathematical optimization, and approximation algorithms. Additionally, I supervise theses on practical and theoretical aspects of algorithms.