Logo Uni Bremen

Zentrum für Industriemathematik

ZeTeM > Arbeitsgruppen > AG Diskrete Optimierung > Publikationen

Kontakt Sitemap Impressum [ English | Deutsch ]

Publikationen der AG Diskrete Optimierung

Zeitschriftenartikel (7)

  1. N. Bertschinger, M. Hoefer, D. Schmand.
    Flow Allocation Games.
    Mathematics of Operations Research, prelim. version at ITCS 2020. :1-22, 2024.

    DOI: 10.1287/moor.2022.0355

  2. M. Hoefer, K. Schewior, D. Schmand.
    Stochastic Probing with Increasing Precision.
    SIAM Journal on Discrete Mathematics, prelim. version at IJCAI 2021. 28(1):148-169, SIAM, 2024.

    DOI: 10.1137/22M149466X

  3. D. Schmand, M. Schröder, L. Vargas Koch.
    A greedy algorithm for the social golfer and the Oberwolfach problem.
    European Journal of Operational Research, 300(1):310-319, Elsevier, 2022.

    DOI: 10.1016/j.ejor.2021.09.018

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

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

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

    DOI: 10.1145/3184137

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

  1. M. R. Fellows, M. Grobler, N. Megow, A. E. Mouawad, V. Ramamoorthi, F. A. Rosamond, D. Schmand, S. Siebertz.
    On Solution Discovery via Reconfiguration.
    26th European Conference on Artificial Intelligence (ECAI 2023), Krakau, Polen.

    DOI: 10.3233/FAIA230334

  2. A. Abels, E. Pitschmann, D. Schmand.
    Prophet Inequalities over Time.
    24th ACM Conference on Economics and Computation (EC 2023), London, Großbritannien.

    DOI: 10.1145/3580507.3597741

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

  4. T. Oosterwijk, D. Schmand, M. Schröder.
    Bicriteria Nash Flows over Time.
    18th International Conference on Web and Internet Economics (WINE 2022).

    DOI: 10.48550/arXiv.2111.08589

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

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

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

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

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

  10. T. Harks, B. Peis, D. Schmand, B. Tauer, L. Vargas Koch.
    Competitive Packet Routing with Priority Lists.
    41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakau, Polen.

    DOI: 10.4230/LIPIcs.MFCS.2016.49

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

Preprints (2)

  1. M. Grobler, S. Maaz, N. Megow, A. E. Mouawad, V. Ramamoorthi, D. Schmand, S. Siebertz.
    Solution discovery via reconfiguration for problems in P.
    Zur Veröffentlichung eingereicht.

    online unter: https://arxiv.org/abs/2311.13478

  2. A. Constantinescu, P. Lenzner, R. Reiffenhäuser, D. Schmand, G. Varriccio.
    Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games.
    Zur Veröffentlichung eingereicht.

    online unter: https://arxiv.org/abs/2311.02067