High Profile Area at the

logo-mmm-w
logo-mmm-w
daniel website
Junior Professor Daniel Schmand
  • Faculty: Faculty 3 - Mathematics & Computer Science
  • Subject area:Algorithmic Game Theory, Discrete Optimization, Efficient Algorithms, Optimization under Uncertainty
  • Office: MZH 2420

Further information:

Projects:

Hydrogen for Bremen's industrial transformation hyBit, BMBF (DFKI, BIBA, OFFIS e.V., Statistisches Landesamt Bremen, Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V., Institut für Klimaschutz, Energie und Mobilität (IKEM), Hochschule Bremen, Steinbeis-Innovationszentrum energie+, Wuppertal Institut für Klima, Umwelt, Energie gGmbH, Hamburgisches WeltWirtschaftsInstitut, Freie Hansestadt Bremen, swb Erzeugung AG & Co. KG, Wesernetz Bremen GmbH, Rhenus Weserport GmbH, indiwa digitale kommunikation GmbH, B. Dettmer Reederei GmbH & Co KG, BLG LOGISTICS GROUP AG & Co. KG, GVZ Entwicklungsgesellschaft Bremen mbH, KVT Kurlbaum AG, ArcelorMittal Bremen GmbH, Senatorin für Wissenschaft und Häfen)

Ecosystem

Member of the scientific focus "Minds Media Machines"
Principal investigators of the Research Training Group Pi^3
Member and head of the working group: Discrete Optimization at the Center for Industrial Mathematics (ZeTeM)
Member of the Board of Directors of the "Logdynamics" research cluster
Publications
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.
DOI: 10.4230/LIPIcs.ICALP.2024.48
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.
DOI: 10.4230/LIPIcs.ICALP.2024.76
2024 // journal-article

Asynchronous opinion dynamics in social networks

Distributed Computing

Berenbrink, P.; Hoefer, M.; Kaaser, D.; Lenzner, P.; Rau, M.; Schmand, D.
DOI: 10.1007/s00446-024-00467-3
2024 // journal-article

Bicriteria Nash flows over time

Games and Economic Behavior

Oosterwijk, T.; Schmand, D.; Schröder, M.
DOI: 10.1016/j.geb.2024.06.002
2024 // journal-article

STOCHASTIC PROBING WITH INCREASING PRECISION

SIAM Journal on Discrete Mathematics

Hoefer, M.; Schewior, K.; Schmand, D.
DOI: 10.1137/22M149466X
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.
DOI: 10.1145/3580507.3597741
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.
DOI: 10.3233/FAIA230334
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.
DOI:
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.
DOI: 10.1016/j.ejor.2021.09.018
2021 // conference-paper

Stochastic Probing with Increasing Precision

IJCAI International Joint Conference on Artificial Intelligence

Hoefer, M.; Schewior, K.; Schmand, D.
DOI:
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.
DOI: 10.1287/MOOR.2019.0993
2020 // conference-paper

Strategic payments in financial networks

Leibniz International Proceedings in Informatics, LIPIcs

Bertschinger, N.; Hoefer, M.; Schmand, D.
DOI: 10.4230/LIPIcs.ITCS.2020.46
2019 // journal-article

Additive stabilizers for unstable graphs

Discrete Optimization

Chandrasekaran, K.; Gottschalk, C.; Könemann, J.; Peis, B.; Schmand, D.; Wierz, A.
DOI: 10.1016/j.disopt.2018.08.003
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.
DOI: 10.1007/978-3-030-30473-7_14
2019 // conference-paper

Network investment games with wardrop followers

Leibniz International Proceedings in Informatics, LIPIcs

Schmand, D.; Schröder, M.; Skopalik, A.
DOI: 10.4230/LIPIcs.ICALP.2019.151
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.
DOI: 10.1007/s10107-017-1170-3
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.
DOI: 10.1145/3184137
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.
DOI: 10.1145/3087556.3087597
2016 // conference-paper

Competitive packet routing with priority lists

Leibniz International Proceedings in Informatics, LIPIcs

Harks, T.; Peis, B.; Schmand, D.; Koch, L.V.
DOI: 10.4230/LIPIcs.MFCS.2016.49
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.
DOI: 10.1007/978-3-319-18173-8_20

Please feel free to mail us, if you have any further questions

mmm@uni-bremen.de 

  • 2025 Minds, Media, Machines

Please feel free to mail us, if you have any further questions

mmm@uni-bremen.de 

  • 2025 Minds, Media, Machines