Lasse Wulf

According to our database, Lasse Wulf authored at least 30 papers between 2018 and 2026.

Collaborative distances:

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

2026

The Gallai Vertex Problem is Θ₂^p-Complete.

Amir Nikabadi, Eva Rotenberg, Lasse Wulf

CoRR, May, 2026

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty.

Marc Goerigk, Dorothee Henke, Lasse Wulf

CoRR, February, 2026

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP.

Christoph Grüne, Berit Johannes, James B. Orlin, Lasse Wulf

CoRR, February, 2026

The Presort Hierarchy for Geometric Problems.

Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf

CoRR, February, 2026

The complexity of blocking all solutions.

Christoph Grüne, Lasse Wulf

Theor. Comput. Sci., 2026

2025

The Complexity of Stackelberg Pricing Games.

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

CoRR, November, 2025

On the Complexity of the Bilevel Shortest Path Problem.

Dorothee Henke, Lasse Wulf

Networks, 2025

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.

Christoph Grüne, Lasse Wulf

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization.

Christoph Grüne, Lasse Wulf

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings).

Lasse Wulf

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

On Finding 𝓁-Th Smallest Perfect Matchings.

Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Fréchet Distance in Unweighted Planar Graphs.

Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

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

Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete.

Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

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

Non-preemptive Tree Packing.

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 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