The following pages link to Daniel Schmand (Q1785194):
Displaying 11 items.
- Robust flows over time: models and complexity results (Q1785195) (← links)
- The online best reply algorithm for resource allocation problems (Q2292625) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Q2947026) (← links)
- Competitive Packet Routing with Priority Lists (Q4608611) (← links)
- Network investment games with Wardrop followers (Q5092358) (← links)
- Hiring Secretaries over Time: The Benefit of Concurrent Employment (Q5108268) (← links)
- (Q5875747) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)
- Solution discovery via reconfiguration for problems in P (Q6460409) (← links)