A Greedy Heuristic for Crossing-Angle Maximization. - Almut Demel; Dominik Dürrschnabel; Tamara Mchedlidze; Marcel Radermacher; Lasse Wulf (GD, 2018)

Linearizable Special Cases of the Quadratic Shortest Path Problem. - Eranda Çela; Bettina Klinz; Stefan Lendl; James B. Orlin; Gerhard J. Woeginger; Lasse Wulf (WG, 2021)

On the Recoverable Traveling Salesman Problem. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2021)

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2022)

Exact Matching and the Top-k Perfect Matching Problem. - Nicolas El Maalouly; Lasse Wulf (CoRR, 2022)

On the Multi-Robber Damage Number. - Milos Stojakovic; Lasse Wulf (CoRR, 2022)

Two-Stage robust optimization problems with two-stage uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

Recoverable robust representatives selection problems with discrete budgeted uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. - Anita Dürr; Nicolas El Maalouly; Lasse Wulf (APPROX/RANDOM, 2023)

Exact Matching: Correct Parity and FPT Parameterized by Independence Number. - Nicolas El Maalouly; Raphael Steiner; Lasse Wulf (ISAAC, 2023)

A large and natural Class of Σp2- and Σp3-complete Problems in Bilevel and Robust Optimization. - Christoph Grüne; Lasse Wulf (CoRR, 2023)

Non-Preemptive Tree Packing. - Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Algorithmica, 2023)

Assistance and interdiction problems on interval graphs. - Hung P. Hoang 001; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2023)

On the Exact Matching Problem in Dense Graphs. - Nicolas El Maalouly; Sebastian Haslebacher; Lasse Wulf (STACS, 2024)

Recognition of Unit Segment and Polyline Graphs is $ exists mathbb {R} $-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (WG, 2024)

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (CoRR, 2024)

On the Complexity of the Bilevel Shortest Path Problem. - Dorothee Henke; Lasse Wulf (CoRR, 2024)

On the complexity of robust multi-stage problems with discrete recourse. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2024)

Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization. - Christoph Grüne; Lasse Wulf (IPCO, 2025)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy. - Christoph Grüne; Lasse Wulf (MFCS, 2025)

The Complexity of Blocking All Solutions. - Christoph Grüne; Lasse Wulf (CoRR, 2025)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings). - Lasse Wulf (CoRR, 2025)

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. - Eranda Çela; Bettina Klinz; Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Math. Program., 2025)

Fréchet Distance in Unweighted Planar Graphs. - Ivor van der Hoog; Thijs van der Horst; Eva Rotenberg; Lasse Wulf (CoRR, 2025)

On Finding ℓ-th Smallest Perfect Matchings. - Nicolas El Maalouly; Sebastian Haslebacher; Adrian Taubner; Lasse Wulf (CoRR, 2025)