Sharing Non-anonymous Costs of Multiple Resources Optimally. - Max Klimm; Daniel Schmand (CIAC, 2015)

Competitive Packet Routing with Priority Lists. - Tobias Harks; Britta Peis; Daniel Schmand; Laura Vargas Koch (MFCS, 2016)

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. - Antje Bjelde; Max Klimm; Daniel Schmand (SPAA, 2017)

Online Best Reply Algorithms for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (CoRR, 2018)

Robust flows over time: models and complexity results. - Corinna Gottschalk; Arie M. C. A. Koster; Frauke Liers; Britta Peis; Daniel Schmand; Andreas Wierz (Math. Program., 2018)

Competitive Packet Routing with Priority Lists. - Tobias Harks; Britta Peis; Daniel Schmand; Bjoern Tauer; Laura Vargas Koch (ACM Trans. Economics and Comput., 2018)

Network Investment Games with Wardrop Followers. - Daniel Schmand; Marc Schröder 002; Alexander Skopalik (ICALP, 2019)

The Online Best Reply Algorithm for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (SAGT, 2019)

Network Investment Game with Wardrop Followers. - Daniel Schmand; Marc Schröder 002; Alexander Skopalik (CoRR, 2019)

Additive stabilizers for unstable graphs. - Karthekeyan Chandrasekaran; Corinna Gottschalk; Jochen Könemann; Britta Peis; Daniel Schmand; Andreas Wierz (Discret. Optim., 2019)

Strategic Decisions and Uncertainties. - Daniel Schmand (Dr. Hut, 2019)

Strategic Payments in Financial Networks. - Nils Bertschinger; Martin Hoefer 001; Daniel Schmand (ITCS, 2020)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

A greedy algorithm for the social golfer and the Oberwolfach problem. - Daniel Schmand; Marc Schröder 002; Laura Vargas Koch (Eur. J. Oper. Res., 2022)

On Solution Discovery via Reconfiguration. - Michael R. Fellows; Mario Grobler; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Frances A. Rosamond; Daniel Schmand; Sebastian Siebertz (ECAI, 2023)

Prophet Inequalities over Time. - Andreas Abels; Elias Pitschmann; Daniel Schmand (EC, 2023)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. - Andrei Constantinescu 001; Pascal Lenzner; Rebecca Reiffenhäuser; Daniel Schmand; Giovanna Varricchio (ICALP, 2024)

Solution Discovery via Reconfiguration for Problems in P. - Mario Grobler; Stephanie Maaz; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Daniel Schmand; Sebastian Siebertz (ICALP, 2024)

Bicriteria Nash flows over time. - Tim Oosterwijk; Daniel Schmand; Marc Schröder 002 (Games Econ. Behav., 2024)

Stochastic Probing with Increasing Precision. - Martin Hoefer 001; Kevin Schewior; Daniel Schmand (SIAM J. Discret. Math., 2024)

Asynchronous opinion dynamics in social networks. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Pascal Lenzner; Malin Rau; Daniel Schmand (Distributed Comput., 2024)

Network Creation Games with 2-Neighborhood Maximization. - Merlin de La Haye; Pascal Lenzner; Daniel Schmand; Nicole Schröder (CIAC (2), 2025)

On the Price of Anarchy in Packet Routing Games with FIFO. - Daniel Schmand; Torben Schürenberg; Martin Strehler 001 (CIAC (1), 2025)

Flow Allocation Games. - Nils Bertschinger; Martin Hoefer 001; Daniel Schmand (Math. Oper. Res., 2025)