Daniel Schmand

Orcid: 0000-0001-7776-3426

Affiliations:
  • University of Bremen, Germany


According to our database1, Daniel Schmand authored at least 21 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stochastic Probing with Increasing Precision.
SIAM J. Discret. Math., March, 2024

2023
Solution discovery via reconfiguration for problems in P.
CoRR, 2023

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

Prophet Inequalities over Time.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

On Solution Discovery via Reconfiguration.
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.
Eur. J. Oper. Res., 2022

Bicriteria Nash Flows over Time.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Asynchronous Opinion Dynamics in Social Networks.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2020
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
Math. Oper. Res., 2020

Strategic Payments in Financial Networks.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Strategic Decisions and Uncertainties.
PhD thesis, 2019

Additive stabilizers for unstable graphs.
Discret. Optim., 2019

Network Investment Game with Wardrop Followers.
CoRR, 2019

The Online Best Reply Algorithm for Resource Allocation Problems.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Network Investment Games with Wardrop Followers.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Competitive Packet Routing with Priority Lists.
ACM Trans. Economics and Comput., 2018

Robust flows over time: models and complexity results.
Math. Program., 2018

Online Best Reply Algorithms for Resource Allocation Problems.
CoRR, 2018

2017
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, 2017

2016
Competitive Packet Routing with Priority Lists.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Sharing Non-anonymous Costs of Multiple Resources Optimally.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015


  Loading...