Publikationen der AG Diskrete Optimierung
Zeitschriftenartikel (9)
- P. Berenbrink, M. Hoefer, D. Kaaser, P. Lenzner, M. Rau, D. Schmand.
Asynchronous opinion dynamics in social networks.
Distributed Computing, , 2024.
(previously at AAMAS 2022) - T. Oosterwijk, D. Schmand, M. Schröder.
Bicriteria Nash Flows over Time.
Games and Economic Behavior, 147:19-37, 2024.
(previously at WINE 2022) - N. Bertschinger, M. Hoefer, D. Schmand.
Flow Allocation Games.
Mathematics of Operations Research, :1-22, 2024.
(previously at ITCS 2020) - M. Hoefer, K. Schewior, D. Schmand.
Stochastic Probing with Increasing Precision.
SIAM Journal on Discrete Mathematics, 28(1):148-169, SIAM, 2024.
(previously at IJCAI 2021)DOI: 10.1137/22M149466X
- 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. - 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. - K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand, A. Wierz.
Additive stabilizers for unstable graphs.
Discrete Optimization, 31:56-78, 2019. - 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.
(previously at MFCS 2016)DOI: 10.1145/3184137
- 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.
Tagungsbeiträge (13)
- M. Grobler, S. Maaz, N. Megow, A. E. Mouawad, V. Ramamoorthi, D. Schmand, S. Siebertz.
Solution Discovery via Reconfiguration for Problems in P.
51st International Colloquium on Automata, Languages, and Programming (ICALP 2024).
- A. Constantinescu, P. Lenzner, R. Reiffenhäuser, D. Schmand, G. Varriccio.
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games.
51st International Colloquium on Automata, Languages, and Programming (ICALP 2024).
- 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
- A. Abels, E. Pitschmann, D. Schmand.
Prophet Inequalities over Time.
24th ACM Conference on Economics and Computation (EC 2023), London, Großbritannien.
- 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
- T. Oosterwijk, D. Schmand, M. Schröder.
Bicriteria Nash Flows over Time.
18th International Conference on Web and Internet Economics (WINE 2022).
- M. Hoefer, K. Schewior, D. Schmand.
Stochastic Probing with Increasing Precision.
2021 International Joint Conference on Artificial Intelligence (IJCAI 2021), Montreal, Kanada.
- N. Bertschinger, M. Hoefer, D. Schmand.
Strategic Payments in Financial Networks.
11th Innovations in Theoretical Computer Science Conference (ITCS 2020).
- D. Schmand, M. Schröder, A. Skopalik.
Network Investment Games with Wardrop Followers.
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).
- 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).
- 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).
- 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.
- M. Klimm, D. Schmand.
Sharing Non-anonymous Costs of Multiple Resources Optimally.
9th International Conference on Algorithms and Complexity (CIAC 2015).
Buchkapitel (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.