( en | de | ru )

 

Disambiguation of "Schmand, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale.

, , and . SPAA, page 227-229. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthias Schmand

Julius Schmand

Theo Schmand

Horst Schmand

Jochen Franz Schmand

 

Other publications of authors with the same name

Sharing Non-anonymous Costs of Multiple Resources Optimally., and . CIAC, volume 9079 of Lecture Notes in Computer Science, page 274-287. Springer, (2015)Stochastic Probing with Increasing Precision., , and . SIAM J. Discret. Math., 38 (1): 148-169 (March 2024)Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale., , and . SPAA, page 227-229. ACM, (2017)Competitive Packet Routing with Priority Lists., , , and . MFCS, volume 58 of LIPIcs, page 49:1-49:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Solution Discovery via Reconfiguration for Problems in P., , , , , , and . ICALP, volume 297 of LIPIcs, page 76:1-76:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Flow Allocation Games., , and . Math. Oper. Res., 50 (1): 68-89 (2025)Solution discovery via reconfiguration for problems in P., , , , , , and . CoRR, (2023)Prophet Inequalities over Time., , and . EC, page 1-20. ACM, (2023)On Solution Discovery via Reconfiguration., , , , , , , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 700-707. IOS Press, (2023)Asynchronous opinion dynamics in social networks., , , , , and . Distributed Comput., 37 (3): 207-224 (September 2024)