| 2026 | ESA | The Complexity of Stackelberg Pricing Games. | Christoph Grne, Dorothee Henke, Eva Rotenberg, Lasse Wulf |
| 2026 | ESA | The Presort Hierarchy for Geometric Problems. | Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf |
| 2025 | ESA | Frchet Distance in Unweighted Planar Graphs. | Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf |
| 2025 | ESA | On Finding 𝓁-Th Smallest Perfect Matchings. | Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf |
| 2025 | FOCS | Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings). | Lasse Wulf |
| 2025 | IPCO | Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization. | Christoph Grne, Lasse Wulf |
| 2025 | MFCS | On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy. | Christoph Grne, Lasse Wulf |
| 2024 | STACS | On the Exact Matching Problem in Dense Graphs. | Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf |
| 2024 | WG | Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete. | Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf |
| 2023 | IPCO | A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. | Eranda ela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2023 | ISAAC | Exact Matching: Correct Parity and FPT Parameterized by Independence Number. | Nicolas El Maalouly, Raphael Steiner, Lasse Wulf |
| 2021 | IWOCA | Non-preemptive Tree Packing. | Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | WG | Linearizable Special Cases of the Quadratic Shortest Path Problem. | Eranda ela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf |
| 2018 | GD | A Greedy Heuristic for Crossing-Angle Maximization. | Almut Demel, Dominik Drrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf |