| An investigation of the recoverable robust assignment problem D Fischer, TA Hartmann, S Lendl, GJ Woeginger arXiv preprint arXiv:2010.11456, 2020 | 16 | 2020 |
| Combinatorial optimization with interaction costs: Complexity and solvable cases S Lendl, A Ćustić, AP Punnen Discrete optimization 33, 101-117, 2019 | 16 | 2019 |
| 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 | 9 | 2022 |
| Matroid bases with cardinality constraints on the intersection S Lendl, B Peis, V Timmermans Mathematical Programming, 1-24, 2022 | 9 | 2022 |
| Continuous facility location on graphs TA Hartmann, S Lendl, GJ Woeginger Mathematical Programming 192 (1), 207-227, 2022 | 8 | 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 | 7 | 2022 |
| A linear time algorithm for the robust recoverable selection problem T Lachmann, S Lendl, GJ Woeginger Discrete Applied Mathematics 303, 94-107, 2021 | 7 | 2021 |
| Robust combinatorial optimization with locally budgeted uncertainty M Goerigk, S Lendl Open Journal of Mathematical Optimization 2, 1-18, 2021 | 6 | 2021 |
| The Steiner cycle and path cover problem on interval graphs A Ćustić, S Lendl Journal of combinatorial optimization 43 (1), 226-234, 2022 | 4* | 2022 |
| On the recoverable traveling salesman problem M Goerigk, S Lendl, L Wulf arXiv preprint arXiv:2111.09691, 2021 | 4 | 2021 |
| Dispersing obnoxious facilities on a graph A Grigoriev, TA Hartmann, S Lendl, GJ Woeginger Algorithmica 83 (6), 1734-1749, 2021 | 4 | 2021 |
| Allocating indivisible items with minimum dissatisfaction on preference graphs N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ... Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021 | 3 | 2021 |
| On the complexity of robust multi-stage problems with discrete recourse M Goerigk, S Lendl, L Wulf Discrete Applied Mathematics 343, 355-370, 2024 | 2 | 2024 |
| Assistance and interdiction problems on interval graphs HP Hoang, S Lendl, L Wulf Discrete Applied Mathematics 340, 153-170, 2023 | 2 | 2023 |
| Allocation of indivisible items with individual preference graphs N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ... Discrete Applied Mathematics 334, 45-62, 2023 | 2 | 2023 |
| 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 |
| A linear time algorithm for linearizing quadratic and higher-order shortest path problems E Çela, B Klinz, S Lendl, GJ Woeginger, L Wulf International Conference on Integer Programming and Combinatorial …, 2023 | 1 | 2023 |
| Non-Preemptive Tree Packing S Lendl, G Woeginger, L Wulf Algorithmica 85 (3), 783-804, 2023 | 1 | 2023 |
| Dispersing obnoxious facilities on graphs by rounding distances TA Hartmann, S Lendl arXiv preprint arXiv:2206.11337, 2022 | 1 | 2022 |
| 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 |
