| A greedy heuristic for crossing-angle maximization A Demel, D Dürrschnabel, T Mchedlidze, M Radermacher, L Wulf International Symposium on Graph Drawing and Network Visualization, 286-299, 2018 | 15 | 2018 |
| Recoverable robust representatives selection problems with discrete budgeted uncertainty M Goerigk, S Lendl, L Wulf European Journal of Operational Research 303 (2), 567-580, 2022 | 13 | 2022 |
| Two-stage robust optimization problems with two-stage uncertainty M Goerigk, S Lendl, L Wulf European Journal of Operational Research 302 (1), 62-78, 2022 | 10 | 2022 |
| On the complexity of robust multi-stage problems with discrete recourse M Goerigk, S Lendl, L Wulf Discrete Applied Mathematics 343, 355-370, 2024 | 9 | 2024 |
| Exact matching: Correct parity and FPT parameterized by independence number N El Maalouly, R Steiner, L Wulf 34th International Symposium on Algorithms and Computation (ISAAC 2023) 283, 28, 2023 | 8 | 2023 |
| On the recoverable traveling salesman problem M Goerigk, S Lendl, L Wulf arXiv preprint arXiv:2111.09691, 2021 | 7 | 2021 |
| Assistance and interdiction problems on interval graphs HP Hoang, S Lendl, L Wulf Discrete Applied Mathematics 340, 153-170, 2023 | 5 | 2023 |
| Stacked treewidth and the Colin de Verdiére number L Wulf Bachelorthesis, Karlsruhe Institute of Technology 17, 2016 | 5 | 2016 |
| Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization C Grüne, L Wulf arXiv preprint arXiv:2311.10540, 2023 | 4 | 2023 |
| Recognition of Unit Segment and Polyline Graphs is -Complete M Hoffmann, T Miltzow, S Weber, L Wulf International Workshop on Graph-Theoretic Concepts in Computer Science, 266-281, 2024 | 3 | 2024 |
| An approximation algorithm for the exact matching problem in bipartite graphs A Dürr, NE Maalouly, L Wulf arXiv preprint arXiv:2307.02205, 2023 | 3 | 2023 |
| A large and natural class of σp 2-and σp 3-complete problems in bilevel and robust optimization C Grüne, L Wulf arXiv preprint ArXiv:2311.10540, 2023 | 3 | 2023 |
| Exact matching and the top-k perfect matching problem NE Maalouly, L Wulf arXiv preprint arXiv:2209.09661, 2022 | 3 | 2022 |
| A linear time algorithm for linearizing quadratic and higher-order shortest path problems E Çela, B Klinz, S Lendl, GJ Woeginger, L Wulf Mathematical Programming, 1-24, 2024 | 2 | 2024 |
| On the exact matching problem in dense graphs NE Maalouly, S Haslebacher, L Wulf arXiv preprint arXiv:2401.03924, 2024 | 2 | 2024 |
| On the complexity of robust multi-stage problems in the polynomial hierarchy M Goerigk, S Lendl, L Wulf arXiv preprint arXiv:2209.01011, 2022 | 2 | 2022 |
| The Complexity of Blocking All Solutions C Grüne, L Wulf arXiv preprint arXiv:2502.05348, 2025 | 1 | 2025 |
| Non-Preemptive Tree Packing S Lendl, G Woeginger, L Wulf Algorithmica 85 (3), 783-804, 2023 | 1 | 2023 |
| Linearizable special cases of the quadratic shortest path problem E Çela, B Klinz, S Lendl, JB Orlin, GJ Woeginger, L Wulf Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021 | 1 | 2021 |
| Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings) L Wulf arXiv preprint arXiv:2502.16398, 2025 | | 2025 |
Stefan LendlUniversity of GrazVerified email at uni-graz.at
