Lasse Wulf

According to our database, Lasse Wulf authored at least 17 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the complexity of robust multi-stage problems with discrete recourse.

Marc Goerigk, Stefan Lendl, Lasse Wulf

Discret. Appl. Math., January, 2024

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.

Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf

CoRR, 2024

On the Exact Matching Problem in Dense Graphs.

Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Assistance and interdiction problems on interval graphs.

Hung P. Hoang, Stefan Lendl, Lasse Wulf

Discret. Appl. Math., December, 2023

Non-Preemptive Tree Packing.

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

Algorithmica, March, 2023

A large and natural Class of Σ^p₂- and Σ^p₃-complete Problems in Bilevel and Robust Optimization.

Christoph Grüne, Lasse Wulf

CoRR, 2023

Exact Matching: Correct Parity and FPT Parameterized by Independence Number.

Nicolas El Maalouly, Raphael Steiner, Lasse Wulf

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.

Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs.

Anita Dürr, Nicolas El Maalouly, Lasse Wulf

Proceedings of the Approximation, 2023

2022

Recoverable robust representatives selection problems with discrete budgeted uncertainty.

Marc Goerigk, Stefan Lendl, Lasse Wulf

Eur. J. Oper. Res., 2022

Two-Stage robust optimization problems with two-stage uncertainty.

Marc Goerigk, Stefan Lendl, Lasse Wulf

Eur. J. Oper. Res., 2022

On the Multi-Robber Damage Number.

Milos Stojakovic, Lasse Wulf

CoRR, 2022

Exact Matching and the Top-k Perfect Matching Problem.

Nicolas El Maalouly, Lasse Wulf

CoRR, 2022

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy.

Marc Goerigk, Stefan Lendl, Lasse Wulf

CoRR, 2022

2021

On the Recoverable Traveling Salesman Problem.

Marc Goerigk, Stefan Lendl, Lasse Wulf

CoRR, 2021

Linearizable Special Cases of the Quadratic Shortest Path Problem.

Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2018

A Greedy Heuristic for Crossing-Angle Maximization.

Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018