Daniel Schmand

According to our database, Daniel Schmand authored at least 24 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Flow Allocation Games.

Nils Bertschinger, Martin Hoefer, Daniel Schmand

Math. Oper. Res., 2025

On the Price of Anarchy in Packet Routing Games with FIFO.

Daniel Schmand, Torben Schürenberg, Martin Strehler

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

Network Creation Games with 2-Neighborhood Maximization.

Merlin de La Haye, Pascal Lenzner, Daniel Schmand, Nicole Schröder

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Solution Discovery via Reconfiguration for Problems in P.

Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games.

Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Prophet Inequalities over Time.

Andreas Abels, Elias Pitschmann, Daniel Schmand

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

On Solution Discovery via Reconfiguration.

Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

A greedy algorithm for the social golfer and the Oberwolfach problem.

Daniel Schmand, Marc Schröder, Laura Vargas Koch

Eur. J. Oper. Res., 2022

Bicriteria Nash Flows over Time.

Tim Oosterwijk, Daniel Schmand, Marc Schröder

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Asynchronous Opinion Dynamics in Social Networks.

Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Stochastic Probing with Increasing Precision.

Martin Hoefer, Kevin Schewior, Daniel Schmand

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.

Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis

Math. Oper. Res., 2020

Strategic Payments in Financial Networks.

Nils Bertschinger, Martin Hoefer, Daniel Schmand

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Strategic Decisions and Uncertainties.

Daniel Schmand

PhD thesis, 2019

Additive stabilizers for unstable graphs.

Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz

Discret. Optim., 2019

Network Investment Game with Wardrop Followers.

Daniel Schmand, Marc Schröder, Alexander Skopalik

CoRR, 2019

The Online Best Reply Algorithm for Resource Allocation Problems.

Max Klimm, Daniel Schmand, Andreas Tönnis

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Network Investment Games with Wardrop Followers.

Daniel Schmand, Marc Schröder, Alexander Skopalik

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Competitive Packet Routing with Priority Lists.

Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch

ACM Trans. Economics and Comput., 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

Online Best Reply Algorithms for Resource Allocation Problems.

Max Klimm, Daniel Schmand, Andreas Tönnis

CoRR, 2018

2017

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale.

Antje Bjelde, Max Klimm, Daniel Schmand

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

Competitive Packet Routing with Priority Lists.

Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Sharing Non-anonymous Costs of Multiple Resources Optimally.

Max Klimm, Daniel Schmand

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015