Lasse Wulf's homepage

Postdoc at Technical University of Denmark

About me

Hi! I am Lasse Wulf, currently a postdoc under Eva Rotenberg in the Section for Algorithms, Logic, and Graphs at the Technical University of Denmark, Copenhagen. Recently, I obtained my PhD from Graz Institute of Technology, under the supervision of Bettina Klinz.

Broadly speaking, my research interests are centered around combinatorial optimization, algorithms, graph theory and complexity theory. More specifically, I am currently working on several problems regarding robust optimization, interdiction problems, interval graphs, spanning tree packing, and the quadratic shortest path problem, respectively. I have also recently found an interest in the Exact Matching problem.

Together with my coauthors, I received the best student paper award at IWOCA2021.

Before starting my PhD, I obtained a double master's degree in mathematics and computer science from Karlsruhe Institute of Technology, Germany, in 2019. I also received a "Deutschlandstipendium" scholarship and participated successfully in some competitions.

In my free time, I enjoy playing and improvising jazz piano and going climbing/bouldering.

[dblp] [Google Scholar]

Curriculum Vitae

04/2022 - 07/2022 - Research visit at ETH Zurich, Switzerland. Visiting the groups of Emo Welzl, Bernd Gärtner and Rico Zenklusen
2019 – present: PhD student at Graz Institute of Technology, under the supervision of Bettina Klinz. Part of the Doctoral Program "Discrete Mathematics" funded by the Austrian Science Fund (FWF).
09/2016 – 09/2019: Double master's degree in mathematics and computer science at Karlsruhe Institute of Technology (KIT). Masterthesis advised by Torsten Ueckerdt.
09/2013 – 09/2016: Bachelor's degree in computer science at Karlsruhe Institute of Technology (KIT). Bachelorthesis advised by Torsten Ueckerdt and Ignaz Rutter.

Awards and Scholarships

05/2021 - Best student paper award at IWOCA2021 for the paper 'non-preemptive tree packing'. Together with S. Lendl and G. Woeginger.
10/2014 – 09/2018: Recipient of the "Deutschlandstipendium" scholarship at KIT. Funded alternatingly by the Vector Foundation, by private Alumni Christoph Felix and by the "Begabtenstiftung Informatik Karlsruhe".
09/2017: First place in the Automatic Category at the 25th International Symposium on Graph Drawing and Network Visuaization (GD 2017). Together with Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze and Marcel Radermacher.
04/2015: Winner of the German National Finals in the category "Games", Imagine Cup 2015. Together with Eric Klappert, Nicklas Kulp, and Jannik Prinz.
02/2014: German Bundeswettbewerb Mathematics. (Participant in the final round.)
09/2013: German Bundeswettbewerb Computer Science. (Participant in the final round and awardee.)

Talks

23.10.23 Some recent advances on the exact matching problem. University of Bonn
16.10.23 A new Class of Sigma-2- and Sigma-3-complete Problems in Bilevel and Robust Optimization. University of Passau
23.06.23 A linear time algorithm for linearizing quadratic and higher-order shortest path problems. 24th Conference on Integer Programming and Combinatorial Optimization (IPCO23), University of Wisconsin-Madison, Wisconsin
26.09.22: Exact Matching and Top-k Perfect Matching. 25th Workshop on Future Research in Combinatorial Optimization (FRICO25), Bonn University, Germany
07.09.22: On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. International Conference on Operations Research (OR2022), KIT Karlsruhe
28.04.22: Non-preemptive tree packing. Mittagsseminar, ETH Zurich
01.09.21: Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. International Conference on Operations Research (OR2021), University of Bern
05.07.21: Non-preemptive tree packing. 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), University of Ottawa
24.06.21: Linearizable special cases of the quadratic shortest path problem. 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG21), University of Warsaw
22.01.21: Assistance and Interdiction Problems on Interval Graphs. Advanced Topics Seminar, TU Graz.
11.12.20: Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. Doctoral School Seminar, TU Graz.
01.10.20: Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. Online Seminar "Robust Optimization" of Dick den Hertog, Tilburg University.
02.07.20: Keeping a graph connected via nonpreemptive edge scheduling (Maximizing the minimum load time in a graphic matroid). Work group Seminar "Optimization", TU Graz.
18.05.20: On the Computational Complexity of the Game Top Trumps. Work group Seminar "Optimization", TU Graz.

Attended Conferences and PhD Schools

19.06. - 23.06.2023 24th Conference on Integer Programming and Combinatorial Optimization (IPCO23), University of Wisconsin-Madison, Wisconsin
26.09. - 30.09.2022: 25th Workshop on Future Research in Combinatorial Optimization (FRICO25), Bonn University, Germany
05.09. - 09.09.2022: International Conference on Operations Research (OR2022), KIT Karlsruhe, Germany
18.07. - 22.07.2022: Bernoulli Center Summer School on Modern Trends in Combinatorial Optimization, EPFL Lausanne, Switzerland
26.06. - 01.07.2022: Swedish Summer School in Computer Science (S3CS), KTH university Stockholm, Sweden
31.08. - 303.09.2021: International Conference on Operations Research (OR2021) (online event)
05.07.- 08.07.2021: 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021) (online event)
23.06. - 25.06.2021: 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG21) (online event)
24.05. - 28.05.2021: School in Algorithms, Combinatorics, and Complexity (online event)
17.05. - 21.05.2022: IPCO 2021 Summer School (online event)
24.08.- 28.08.2020: Prague Summer School on Discrete Mathematics 2020 (online event)
06.06. - 07.06.2020: IPCO 2020 summer school (online event)