Logo Uni Bremen

Zentrum für Technomathematik

ZeTeM > Über das ZeTeM > Mitarbeiter*innen > Prof. Dr. Daniel Schmand > Publikationen

Kontakt Sitemap Impressum [ English | Deutsch ]

Publikationen von Prof. Dr. Daniel Schmand

Zeitschriftenartikel (4)

  1. Y. Disser, J. Fearnley, M. Gairing, O. Göbel, M. Klimm, D. Schmand, A. Skopalik, A. Tönnis.
    Hiring Secretaries over Time: The Benefit of Concurrent Employment.
    Mathematics of Operations Research, 45(1):323-352, 2020.

    DOI: 10.1287/moor.2019.0993

  2. K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand, A. Wierz.
    Additive stabilizers for unstable graphs.
    Discrete Optimization, 31:56-78, 2019.

    DOI: 10.1016/j.disopt.2018.08.003

  3. T. Harks, B. Peis, D. Schmand, B. Tauer, L. Vargas Koch.
    Competitive Packet Routing with Priority Lists.
    ACM Transactions on Economics and Computation, 6(1):4:1--4:26, 2018.

    DOI: 10.1145/3184137

  4. C. Gottschalk, A. Koster, F. Liers, B. Peis, D. Schmand, A. Wierz.
    Robust flows over time: models and complexity results.
    Mathematical Programming, 171(1):55-85, 2018.

    DOI: 10.1007/s10107-017-1170-3

Tagungsbeiträge (6)

  1. M. Hoefer, K. Schewior, D. Schmand.
    Stochastic Probing with Increasing Precision.
    2021 International Joint Conference on Artificial Intelligence (IJCAI 2021), Montreal, Kanada.
  2. N. Bertschinger, M. Hoefer, D. Schmand.
    Strategic Payments in Financial Networks.
    11th Innovations in Theoretical Computer Science Conference (ITCS 2020).

    DOI: 10.4230/LIPIcs.ITCS.2020.46

  3. D. Schmand, M. Schröder, A. Skopalik.
    Network Investment Games with Wardrop Followers.
    46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).

    DOI: 10.4230/LIPIcs.ICALP.2019.151

  4. M. Klimm, A. Tönnis, D. Schmand.
    The Online Best Reply Algorithm for Resource Allocation Problems.
    12th International Symposium on Algorithmic Game Theory (SAGT 2019).

    DOI: 10.1007/978-3-030-30473-7_14

  5. A. Bjelde, M. Klimm, D. Schmand.
    Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale.
    29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017).

    DOI: 10.1145/3087556.3087597

  6. M. Klimm, D. Schmand.
    Sharing Non-anonymous Costs of Multiple Resources Optimally.
    9th International Conference on Algorithms and Complexity (CIAC 2015).

    DOI: 10.1007/978-3-319-18173-8_20