( en | de | ru )

 

Disambiguation of "Lendl, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Linearizable Special Cases of the Quadratic Shortest Path Problem.

, , , , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 245-256. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christine Lendl

Markus Lendl

Markus Lendl

Wilhelmine Lendl

Jochen Lendle

 

Other publications of authors with the same name

Dispersing Obnoxious Facilities on a Graph., , , and . Algorithmica, 83 (6): 1734-1749 (2021)Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs., , , , , , , and . ADT, volume 13023 of Lecture Notes in Computer Science, page 243-257. Springer, (2021)Assistance and Interdiction Problems on Interval Graphs., , and . CoRR, (2021)An Investigation of the Recoverable Robust Assignment Problem., , , and . IPEC, volume 214 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dispersing obnoxious facilities on a graph., , , and . CoRR, (2018)Robust Combinatorial Optimization with Locally Budgeted Uncertainty., and . Open J. Math. Optim., (2021)Allocation of indivisible items with individual preference graphs., , , , , , , and . Discret. Appl. Math., (July 2023)An Investigation of the Recoverable Robust Assignment Problem., , , and . CoRR, (2020)The Steiner cycle and path cover problem on interval graphs., and . J. Comb. Optim., 43 (1): 226-234 (2022)Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph., , , , , , and . CoRR, (2023)