Stefan Lendl

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 35

Top Topics

Traveling Salesman

Polynomial Hierarchy

Combinatorial Optimization

Top Venues

Discret. Appl. Math.

Publications

Marc Goerigk, Stefan Lendl, Lasse Wulf
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343 (2024)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR (2024)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334 (2023)
Hung P. Hoang, Stefan Lendl, Lasse Wulf
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340 (2023)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO (2023)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-Preemptive Tree Packing. Algorithmica 85 (3) (2023)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous facility location on graphs. Math. Program. 192 (1) (2022)
Stefan Lendl, Britta Peis, Veerle Timmermans
Matroid bases with cardinality constraints on the intersection. Math. Program. 194 (1) (2022)
Ante Custic, Stefan Lendl
The Steiner cycle and path cover problem on interval graphs. J. Comb. Optim. 43 (1) (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303 (2) (2022)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of Indivisible Items with Individual Preference Graphs. CoRR (2022)
Tim A. Hartmann, Stefan Lendl
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. CoRR (2022)
Tim A. Hartmann, Stefan Lendl
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. MFCS (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302 (1) (2022)
Hung P. Hoang, Stefan Lendl, Lasse Wulf
Assistance and Interdiction Problems on Interval Graphs. CoRR (2021)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. IPEC (2021)
Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303 (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR (2021)
Marc Goerigk, Stefan Lendl
Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. 2 (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Recoverable Traveling Salesman Problem. CoRR (2021)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83 (6) (2021)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-preemptive Tree Packing. IWOCA (2021)
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG (2021)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous Facility Location on Graphs. IPCO (2020)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. CoRR (2020)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR (2020)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. STACS (2019)
Stefan Lendl, Britta Peis, Veerle Timmermans
Matroid Bases with Cardinality Constraints on the Intersection. CoRR (2019)
Stefan Lendl, Ante Custic, Abraham P. Punnen
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33 (2019)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing obnoxious facilities on a graph. CoRR (2018)
Ante Custic, Stefan Lendl
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. CoRR (2018)