Lasse Wulf

45 papers A* 1A 5B 6C 1Journal 32
YearRankTypeTitle / Venue / Authors
2026 J jnl
Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP.
CoRR
Christoph Grüne, Berit Johannes, James B. Orlin, Lasse Wulf
2026 J jnl
The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty.
CoRR
Marc Goerigk, Dorothee Henke, Lasse Wulf
2026 J jnl
The Presort Hierarchy for Geometric Problems.
CoRR
Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf
2026 J jnl
The complexity of blocking all solutions.
Theor. Comput. Sci.
Christoph Grüne, Lasse Wulf
2025 J jnl
A linear time algorithm for linearizing quadratic and higher-order shortest path problems.
Math. Program.
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2025 B conf
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization.
IPCO
Christoph Grüne, Lasse Wulf
2025 A* conf
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings).
FOCS
Lasse Wulf
2025 J jnl
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings).
CoRR
Lasse Wulf
2025 A conf
Fréchet Distance in Unweighted Planar Graphs.
ESA
Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf
2025 J jnl
Fréchet Distance in Unweighted Planar Graphs.
CoRR
Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf
2025 J jnl
On Finding ℓ-th Smallest Perfect Matchings.
CoRR
Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf
2025 A conf
On Finding 𝓁-Th Smallest Perfect Matchings.
ESA
Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf
2025 B conf
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.
MFCS
Christoph Grüne, Lasse Wulf
2025 J jnl
On the Complexity of the Bilevel Shortest Path Problem.
Networks
Dorothee Henke, Lasse Wulf
2025 J jnl
The Complexity of Blocking All Solutions.
CoRR
Christoph Grüne, Lasse Wulf
2025 J jnl
The Complexity of Stackelberg Pricing Games.
CoRR
Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf
2024 J jnl
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.
CoRR
Christoph Grüne, Lasse Wulf
2024 J jnl
On the Complexity of the Bilevel Shortest Path Problem.
CoRR
Dorothee Henke, Lasse Wulf
2024 A conf
On the Exact Matching Problem in Dense Graphs.
STACS
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
2024 J jnl
On the Exact Matching Problem in Dense Graphs.
CoRR
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
2024 J jnl
On the complexity of robust multi-stage problems with discrete recourse.
Discret. Appl. Math.
Marc Goerigk, Stefan Lendl, Lasse Wulf
2024 B conf
Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete.
WG
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2024 J jnl
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.
CoRR
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2023 B conf
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.
IPCO
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023 J jnl
A large and natural Class of Σ
CoRR
Christoph Grüne, Lasse Wulf
2023 J jnl
A linear time algorithm for linearizing quadratic and higher-order shortest path problems.
CoRR
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023 A conf
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs.
APPROX/RANDOM
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
2023 J jnl
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs.
CoRR
Anita Dürr, Nicolas El Maalouly, Lasse Wulf
2023 J jnl
Assistance and interdiction problems on interval graphs.
Discret. Appl. Math.
Hung P. Hoang, Stefan Lendl, Lasse Wulf
2023 B conf
Exact Matching: Correct Parity and FPT Parameterized by Independence Number.
ISAAC
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
2023 J jnl
Non-Preemptive Tree Packing.
Algorithmica
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2022 J jnl
Exact Matching and the Top-k Perfect Matching Problem.
CoRR
Nicolas El Maalouly, Lasse Wulf
2022 J jnl
Exact Matching: Correct Parity and FPT Parameterized by Independence Number.
CoRR
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
2022 J jnl
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy.
CoRR
Marc Goerigk, Stefan Lendl, Lasse Wulf
2022 J jnl
On the Multi-Robber Damage Number.
CoRR
Milos Stojakovic, Lasse Wulf
2022 J jnl
Recoverable robust representatives selection problems with discrete budgeted uncertainty.
Eur. J. Oper. Res.
Marc Goerigk, Stefan Lendl, Lasse Wulf
2022 J jnl
Two-Stage robust optimization problems with two-stage uncertainty.
Eur. J. Oper. Res.
Marc Goerigk, Stefan Lendl, Lasse Wulf
2021 J jnl
Assistance and Interdiction Problems on Interval Graphs.
CoRR
Hung P. Hoang, Stefan Lendl, Lasse Wulf
2021 B conf
Linearizable Special Cases of the Quadratic Shortest Path Problem.
WG
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2021 C conf
Non-preemptive Tree Packing.
IWOCA
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2021 J jnl
On the Recoverable Traveling Salesman Problem.
CoRR
Marc Goerigk, Stefan Lendl, Lasse Wulf
2021 J jnl
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty.
CoRR
Marc Goerigk, Stefan Lendl, Lasse Wulf
2020 J jnl
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty.
CoRR
Marc Goerigk, Stefan Lendl, Lasse Wulf
2018 A conf
A Greedy Heuristic for Crossing-Angle Maximization.
GD
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf
2018 J jnl
A Greedy Heuristic for Crossing-Angle Maximization.
CoRR
Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf