On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. - Ante Custic; Stefan Lendl (CoRR, 2018)

Combinatorial optimization with interaction costs: Complexity and solvable cases. - Stefan Lendl; Ante Custic; Abraham P. Punnen (Discret. Optim., 2019)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

An Investigation of the Recoverable Robust Assignment Problem. - Dennis Fischer 001; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (IPEC, 2021)

Linearizable Special Cases of the Quadratic Shortest Path Problem. - Eranda Çela; Bettina Klinz; Stefan Lendl; James B. Orlin; Gerhard J. Woeginger; Lasse Wulf (WG, 2021)

Dispersing Obnoxious Facilities on a Graph. - Alexander Grigoriev; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (Algorithmica, 2021)

On the Recoverable Traveling Salesman Problem. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2021)

A linear time algorithm for the robust recoverable selection problem. - Thomas Lachmann; Stefan Lendl; Gerhard J. Woeginger (Discret. Appl. Math., 2021)

Robust Combinatorial Optimization with Locally Budgeted Uncertainty. - Marc Goerigk; Stefan Lendl (Open J. Math. Optim., 2021)

Dispersing Obnoxious Facilities on Graphs by Rounding Distances. - Tim A. Hartmann; Stefan Lendl (MFCS, 2022)

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2022)

Two-Stage robust optimization problems with two-stage uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

Recoverable robust representatives selection problems with discrete budgeted uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

The Steiner cycle and path cover problem on interval graphs. - Ante Custic; Stefan Lendl (J. Comb. Optim., 2022)

Continuous facility location on graphs. - Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (Math. Program., 2022)

Matroid bases with cardinality constraints on the intersection. - Stefan Lendl; Britta Peis; Veerle Timmermans (Math. Program., 2022)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2023)

Non-Preemptive Tree Packing. - Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Algorithmica, 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

Assistance and interdiction problems on interval graphs. - Hung P. Hoang 001; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2023)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

Rescheduling with New Orders Under Bounded Disruption. - Stefan Lendl; Ulrich Pferschy; Elena Rener (INFORMS J. Comput., 2024)

On the complexity of robust multi-stage problems with discrete recourse. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2024)

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. - Eranda Çela; Bettina Klinz; Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Math. Program., 2025)