Daniel Schmand, M. Sc.

  Photo of Daniel Schmand Private



with A. Bjelde and M. Klimm:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 227-229 (2017).
with C. Gottschalk, A. M. C. A. Koster, F. Liers, B. Peis und A. Wierz:
Robust Flows over Time: Models and Complexity Results
Mathematical Programming (2017).

with T. Harks, B. Peis, and L. Vargas Koch:
Competitive Packet Routing with Priority Lists
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 49:1-49:14 (2016).

with M. Klimm:
Sharing Non-anonymous Costs of Multiple Resources Optimally
Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287 (2015).



with Y. Disser, J. Fearnley, M. Gairing, O. Göbel, M. Klimm, A. Skopalik, and A. Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment
preprint (2016).

with K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, and A. Wierz:
Additive Stabilizers for Unstable Graphs
preprint (2016).


All publications of the Chair of Management Science