Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
Published on Minimum Scan Cover with Angular Transition Costs; developed state-of-the-art Pairwise Interaction Sampling algorithm; technical organizer for CG:SHOP competitions; provided an intricate NP-hardness proof for Open Problems Project (#53); (co-)authored multiple papers on coverage path planning.
Research Experience
PostDoc Researcher/Instructor/Consultant at TU Braunschweig, Algorithms Division. Successfully applied skills across diverse projects as a freelance consultant.
Background
Research interests include algorithm engineering and NP-hard combinatorial optimization problems. Specializes in Mixed Integer Programming, Constraint Programming, SAT solvers, graph algorithms, and meta-heuristics. Full-stack expertise in theoretical computer science, operations research, mathematical optimization, data science, and robust software engineering.
Miscellany
Able to adapt theoretical knowledge to practical deployments, familiar with various optimization techniques, and can rapidly adapt to diverse challenges.