Logo Uni Bremen

Zentrum für Technomathematik

ZeTeM > Arbeitsgruppen > AG Diskrete Optimierung > Publikationen

Kontakt Sitemap Impressum [ English | Deutsch ]

Publikationen der AG Diskrete Optimierung

Zeitschriftenartikel (5)

  1. D. Schmand, M. Schröder, L. Vargas Koch.
    A greedy algorithm for the social golfer and the Oberwolfach problem.
    European Journal of Operational Research, in press, available online , 10 S., 2021.

    DOI: 10.1016/j.ejor.2021.09.018

  2. 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

  3. 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

  4. 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

  5. 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 (7)

  1. P. Berenbrink, M. Hoefer, D. Kaaser, P. Lenzner, M. Rau, D. Schmand.
    Asynchronous Opinion Dynamics in Social Networks.
    21st International Joint Conference on Autonomous Agents & Multiagent Systems (AAMAS 2022), Auckland, Neuseeland.

    online unter: https://dl.acm.org/doi/10.5555/3535850.3535864

  2. M. Hoefer, K. Schewior, D. Schmand.
    Stochastic Probing with Increasing Precision.
    2021 International Joint Conference on Artificial Intelligence (IJCAI 2021), Montreal, Kanada.

    DOI: 10.24963/ijcai.2021/560

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

Buchkapitel (1)

  1. D. Schmand.
    Recent Developments in Mathematical Traffic Models.
    Dynamics in Logistics, M. Freitag, H. Kotzab, N. Megow (Hrsg.), S. 71-78, Springer Verlag, 2021.

    DOI: 10.1007/978-3-030-88662-2_4