Leo Wennmann

PhD Student

About Me

I am a PhD student with a broad interest in theoretical computer science, specifically in fine-grained algorithm design (and complexity) and applications of randomized rounding and linear programming techniques. Currently, I am supervised by Lars Rohwedder at the University of Southern Denmark (SDU).

I am a strong advocate for making the TCS community a safe and inclusive space for everyone. If you need someone to listen or want to have a respectful conversation about the fact that there is still a long way to go, please reach out or come talk to me.

In my personal life, there is a 99% chance that:

  • You will find on my mat –– doing yoga, functional strength training, HIIT or any combination thereof –– or outside biking or going for a walk; more recently, I also started bouldering.
  • I am listening to music –– I am always counting down the days to the next concert or festival day.

Teaching

I am very passionate about teaching and enjoyed being a TA for various courses.
  • Discrete Math –– SDU
  • Algorithms and Data Structures –– KU, FU, SDU
  • Introduction to Programming –– KU, MU
  • Management of Operations and Product Development –– MU
  • Seminar: Mathematics and Computation –– FU
  • Optimization –– SU
  • Implementation of Fundamental Numerical Methods –– KU
  • Computer Science as Minor Subject –– KU

* Frankfurt | Kiel | Maastricht | Saarland University

Supervision

I loved learning from co-supervising the following talented students.
  • Marius Hagemann –– Block-Structured Mixed Integer Linear Programs
  • Lars Huth –– Analyzing MILP Security Bound Modeling for Linear and Differential Cryptanalysis
  • Melvin Kallmayer –– ​Experimental Evaluation of a Simpler Algorithm for Trimmed Multipoint Evaluation in Rust
  • Sofia Lohr –– Analyzing MILPs for Linear and Differential Cryptanalysis
  • Jonas Strauch –– A Mixed-Integer Analogue to Carathéodory's Theorem
  • PJ van Mill –– Simple Online Algorithms for Maximum-Flowtime Scheduling on Related Machines

Co-authors

Publications

2026

Distributed Santa Claus via Global Rounding

Malte Baumecker, Yannic Maus, Florian Schager, Tijn de Vos, Leo Wennmann

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting

Tatiana Rocha Avila, Lars Rohwedder, Leo Wennmann

2025
ESA 2025

A Simple Algorithm for Trimmed Multipoint Evaluation

Nick Fischer, Melvin Kallmayer, Leo Wennmann

ICALP 2025

Cost Preserving Dependent Rounding for Allocation Problems

Lars Rohwedder, Arman Rouhani, Leo Wennmann

SODA 2025

Solving Polynomial Equations Over Finite Fields

Holger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann

2024
ICALP 2024
TheoretiCS 2025

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time

Nick Fischer, Leo Wennmann