No photo of Stefan Lendl

Stefan Lendl

Dipl.-Ing. Dr.techn., BSc

20182024

Research activity per year

Filter
Conference paper

Search results

  • 2023

    A linear time algorithm for linearizing quadratic and higher-order shortest path problems

    Çela , E. ., Klinz, B., Lendl, S., Woeginger, G. J. & Wulf, L., 2023, Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings. Del Pia, A. & Kaibel, V. (eds.). Cham: Springer, p. 466-479 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13904 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • 2021

    An Investigation of the Recoverable Robust Assignment Problem

    Fischer, D., Hartmann, T. A., Lendl, S. & Woeginger, G. J., 2021, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Golovach, P. A. & Zehavi, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 214. p. 19:1--19:14 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 214).

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

    Open Access

  • Linearizable Special Cases of the Quadratic Shortest Path Problem

    Dragoti-Cela, E., Klinz, B., Lendl, S., Orlin, J. B., Woeginger, G. & Wulf, L., 20 Sept 2021, Graph-Theoretic Concepts in Computer Science: WG 2021. Kowalik, Ł., Pilipczuk, M. & Rzążewski, P. (eds.). Springer, p. 245-256 12 p. (Springer Lecture Notes in Computer Science; vol. 12911).

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Non-preemptive Tree Packing

    Lendl, S., Woeginger, G. & Wulf, L., 2021, Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science. Flocchini, P. & Moura, L. (eds.). Springer, Vol. 12757.

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • 2020

    Continuous facility location on graphs

    Hartmann, T. A., Lendl, S. & Woeginger, G. J., 1 Jan 2020, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Bienstock, D. & Zambelli, G. (eds.). Cham: Springer, p. 171-181 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12125 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • 2019

    Dispersing obnoxious facilities on a graph

    Grigoriev, A., Hartmann, T. A., Lendl, S. & Woeginger, G. J., 2019, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 33:1-33:11 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 126).

    Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

    Open Access