2025 // Journal article
Flow Allocation Games
Mathematics of Operations Research
Bertschinger, N.; Hoefer, M.; Schmand, D.
2025 // Conference paper
Network Creation Games with 2-Neighborhood Maximization
Lecture Notes in Computer Science
de la Haye, M.; Lenzner, P.; Schmand, D.; Schröder, N.
2025 // Conference paper
On the Price of Anarchy in Packet Routing Games with FIFO
Lecture Notes in Computer Science
Schmand, D.; Schürenberg, T.; Strehler, M.
2025 // Journal article
Prophet Inequalities over Time
ACM Transactions on Economics and Computation
Abels, A.; Pitschmann, E.; Schmand, D.
2024 // Journal article
Asynchronous opinion dynamics in social networks
Distributed Computing
Berenbrink, P.; Hoefer, M.; Kaaser, D.; Lenzner, P.; Rau, M.; Schmand, D.
2024 // Journal article
Bicriteria Nash flows over time
Games and Economic Behavior
Oosterwijk, T.; Schmand, D.; Schröder, M.
2024 // Conference paper
Solution Discovery via Reconfiguration for Problems in P
Leibniz International Proceedings in Informatics, LIPIcs
Grobler, M.; Maaz, S.; Megow, N.; Mouawad, A.E.; Ramamoorthi, V.; Schmand, D.; Siebertz, S.
2024 // Conference paper
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
Leibniz International Proceedings in Informatics, LIPIcs
Constantinescu, A.; Lenzner, P.; Reiffenhäuser, R.; Schmand, D.; Varricchio, G.
2024 // Journal article
STOCHASTIC PROBING WITH INCREASING PRECISION
SIAM Journal on Discrete Mathematics
Hoefer, M.; Schewior, K.; Schmand, D.
2023 // Conference paper
On Solution Discovery via Reconfiguration
Frontiers in Artificial Intelligence and Applications
Fellows, M.R.; Grobler, M.; Megow, N.; Mouawad, A.E.; Ramamoorthi, V.; Rosamond, F.A.; Schmand, D.; Siebertz, S.
2023 // Conference paper
Prophet Inequalities over Time
EC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation
Abels, A.; Pitschmann, E.; Schmand, D.
2022 // Journal article
A greedy algorithm for the social golfer and the Oberwolfach problem
European Journal of Operational Research
Schmand, D.; Schröder, M.; Vargas Koch, L.
2022 // Conference paper
Asynchronous Opinion Dynamics in Social Networks
Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Berenbrink, P.; Hoefer, M.; Kaaser, D.; Lenzner, P.; Rau, M.; Schmand, D.
2021 // Book chapter
Recent developments in mathematical traffic models
Dynamics in Logistics: Twenty-Five Years of Interdisciplinary Logistics Research in Bremen, Germany
Sour cream, D.
2021 // Conference paper
Stochastic Probing with Increasing Precision
IJCAI International Joint Conference on Artificial Intelligence
Hoefer, M.; Schewior, K.; Schmand, D.
2020 // Journal article
Hiring secretaries over time: The benefit of concurrent employment
Mathematics of Operations Research
Disser, Y.; Fearnley, J.; Gairing, M.; Göbel, O.; Klimm, M.; Schmand, D.; Skopalik, A.; Tönnis, A.
2020 // Conference paper
Strategic payments in financial networks
Leibniz International Proceedings in Informatics, LIPIcs
Bertschinger, N.; Hoefer, M.; Schmand, D.
2019 // Journal article
Additive stabilizers for unstable graphs
Discrete Optimization
Chandrasekaran, K.; Gottschalk, C.; Könemann, J.; Peis, B.; Schmand, D.; Wierz, A.
2019 // Conference paper
Network investment games with wardrop followers
Leibniz International Proceedings in Informatics, LIPIcs
Schmand, D.; Schröder, M.; Skopalik, A.
2019 // Conference paper
The Online Best Reply Algorithm for Resource Allocation Problems
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Klimm, M.; Schmand, D.; Tönnis, A.
2018 // Journal article
Competitive packet routing with priority lists
ACM Transactions on Economics and Computation
Harks, T.; Peis, B.; Schmand, D.; Tauer, B.; Koch, L.V.
2018 // Journal article
Robust flows over time: models and complexity results
Mathematical Programming
Gottschalk, C.; Koster, A.M.C.A.; Liers, F.; Peis, B.; Schmand, D.; Wierz, A.
2017 // Conference paper
Brief announcement: Approximation algorithms for unsplittable resource allocation problems with diseconomies of scale
Annual ACM Symposium on Parallelism in Algorithms and Architectures
Bjelde, A.; Klimm, M.; Schmand, D.
2016 // Conference paper
Competitive packet routing with priority lists
Leibniz International Proceedings in Informatics, LIPIcs
Harks, T.; Peis, B.; Schmand, D.; Koch, L.V.
2015 // Conference paper
Sharing non-anonymous costs of multiple resources optimally
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Klimm, M.; Schmand, D.