Stefan Lendl

Available identifiers

zbMath Open lendl.stefanMaRDI QIDQ1630702

List of research outcomes

Publication	Date of Publication	Type
Dispersing obnoxious facilities on graphs by rounding distances	2024-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q6192487	2024-02-12	Paper
On the complexity of robust multi-stage problems with discrete recourse	2024-01-02	Paper
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	2023-11-09	Paper
Assistance and interdiction problems on interval graphs	2023-09-14	Paper
Allocation of indivisible items with individual preference graphs	2023-05-11	Paper
Allocating indivisible items with minimum dissatisfaction on preference graphs	2023-03-31	Paper
Non-preemptive tree packing	2023-03-09	Paper
Continuous Facility Location on Graphs	2022-10-14	Paper
Robust combinatorial optimization with locally budgeted uncertainty	2022-08-20	Paper
Recoverable robust representatives selection problems with discrete budgeted uncertainty	2022-07-22	Paper
Dispersing Obnoxious Facilities on a Graph	2022-07-18	Paper
Matroid bases with cardinality constraints on the intersection	2022-06-29	Paper
Linearizable special cases of the quadratic shortest path problem	2022-06-08	Paper
Two-stage robust optimization problems with two-stage uncertainty	2022-05-20	Paper
Continuous facility location on graphs	2022-03-22	Paper
Non-preemptive tree packing	2022-03-22	Paper
The Steiner cycle and path cover problem on interval graphs	2022-02-14	Paper
A linear time algorithm for the robust recoverable selection problem	2021-09-15	Paper
Dispersing obnoxious facilities on a graph	2021-06-11	Paper
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty	2021-04-07	Paper
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty	2020-08-28	Paper
Combinatorial optimization with interaction costs: complexity and solvable cases	2019-11-28	Paper
On sequences covering all rainbow \(k\)-progressions	2018-12-10	Paper

Research outcomes over time

This page was built for person: Stefan Lendl