Lasse Wulf

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 26

Top Topics

Robust Optimization

Top Venues

Discret. Appl. Math.

Eur. J. Oper. Res.

Publications

Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR (2024)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343 (2024)
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
On the Exact Matching Problem in Dense Graphs. STACS (2024)
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
On the Exact Matching Problem in Dense Graphs. CoRR (2024)
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. CoRR (2023)
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ISAAC (2023)
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. APPROX/RANDOM (2023)
Christoph Grüne, Lasse Wulf
-complete Problems in Bilevel and Robust Optimization. CoRR (2023)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR (2023)
Hung P. Hoang, Stefan Lendl, Lasse Wulf
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340 (2023)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO (2023)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-Preemptive Tree Packing. Algorithmica 85 (3) (2023)
Nicolas El Maalouly, Lasse Wulf
Exact Matching and the Top-k Perfect Matching Problem. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303 (2) (2022)
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302 (1) (2022)
Milos Stojakovic, Lasse Wulf
On the Multi-Robber Damage Number. CoRR (2022)
Hung P. Hoang, Stefan Lendl, Lasse Wulf
Assistance and Interdiction Problems on Interval Graphs. CoRR (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Recoverable Traveling Salesman Problem. CoRR (2021)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-preemptive Tree Packing. IWOCA (2021)
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR (2020)
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf
A Greedy Heuristic for Crossing-Angle Maximization. Graph Drawing (2018)
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf
A Greedy Heuristic for Crossing-Angle Maximization. CoRR (2018)