Michael Schloter

Prof. Dr. rer. nat. habil.

1985 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2022

    A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method

    Schloter, M., Skutella, M. & Tran, K. V., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 90-102 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • 2020

    Constructing Lattice-Free Gradient Polyhedra in Dimension Two

    Paat, J., Schlöter, M. & Speakman, E., 2020, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Bienstock, D. & Zambelli, G. (eds.). Springer, p. 364-377 14 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 proceedingConference contributionpeer-review

    Open Access
  • The Integrality Number of an Integer Program

    Paat, J., Schlöter, M. & Weismantel, R., 2020, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Bienstock, D. & Zambelli, G. (eds.). Springer, p. 338-350 13 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 proceedingConference contributionpeer-review

    Open Access
    5 Scopus citations
  • 2019

    Earliest Arrival Transshipments in Networks with Multiple Sinks

    Schlöter, M., 2019, Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Nagarajan, V. & Lodi, A. (eds.). Springer Verlag, p. 370-384 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2017

    Fast and memory-efficient algorithms for evacuation problems

    Schlöter, M. & Skutella, M., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 821-840 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    13 Scopus citations
  • Tight bounds for online TSP on the line

    Bjelde, A., Disser, Y., Hackfeld, J., Hansknecht, C., Lipmann, M., Meißner, J., Schewior, K., Schloter, M. & Stougie, L., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 994-1005 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    23 Scopus citations